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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-examples/sanfoundry_02_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:58:11,537 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:58:11,541 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:58:11,554 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:58:11,555 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:58:11,556 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:58:11,557 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:58:11,561 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:58:11,563 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:58:11,573 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:58:11,574 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:58:11,574 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:58:11,575 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:58:11,578 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:58:11,580 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:58:11,580 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:58:11,581 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:58:11,585 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:58:11,590 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:58:11,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:58:11,595 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:58:11,598 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:58:11,601 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:58:11,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:58:11,605 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:58:11,607 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:58:11,607 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:58:11,610 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:58:11,610 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:58:11,614 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:58:11,614 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:58:11,615 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:58:11,615 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:58:11,615 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:58:11,616 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:58:11,617 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:58:11,617 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-23 11:58:11,632 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:58:11,633 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:58:11,634 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:58:11,634 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:58:11,634 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:58:11,635 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:58:11,635 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:58:11,635 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:58:11,635 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:58:11,636 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 11:58:11,636 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:58:11,636 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:58:11,636 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:58:11,636 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:58:11,636 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:58:11,637 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:58:11,637 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:58:11,637 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:58:11,637 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:58:11,637 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:58:11,638 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:58:11,638 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:58:11,638 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:58:11,638 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:58:11,638 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:58:11,639 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:58:11,639 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:58:11,639 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 11:58:11,639 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:58:11,639 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 11:58:11,639 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:58:11,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:58:11,714 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:58:11,719 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:58:11,721 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:58:11,721 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:58:11,722 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sanfoundry_02_true-unreach-call_ground.i [2018-11-23 11:58:11,794 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e134f9f5b/dc5082b0217d4639b7c94f2a481dbf35/FLAGed7996e91 [2018-11-23 11:58:12,284 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:58:12,286 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_02_true-unreach-call_ground.i [2018-11-23 11:58:12,294 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e134f9f5b/dc5082b0217d4639b7c94f2a481dbf35/FLAGed7996e91 [2018-11-23 11:58:12,645 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e134f9f5b/dc5082b0217d4639b7c94f2a481dbf35 [2018-11-23 11:58:12,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:58:12,656 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:58:12,657 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:12,657 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:58:12,661 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:58:12,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:12" (1/1) ... [2018-11-23 11:58:12,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d81cc59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:12, skipping insertion in model container [2018-11-23 11:58:12,667 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:58:12" (1/1) ... [2018-11-23 11:58:12,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:58:12,702 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:58:12,955 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:12,960 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:58:12,991 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:58:13,016 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:58:13,017 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:13 WrapperNode [2018-11-23 11:58:13,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:58:13,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:13,019 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:58:13,019 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:58:13,030 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:13" (1/1) ... [2018-11-23 11:58:13,041 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:13" (1/1) ... [2018-11-23 11:58:13,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:58:13,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:58:13,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:58:13,051 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:58:13,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:13" (1/1) ... [2018-11-23 11:58:13,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:13" (1/1) ... [2018-11-23 11:58:13,064 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:13" (1/1) ... [2018-11-23 11:58:13,064 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:13" (1/1) ... [2018-11-23 11:58:13,077 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:13" (1/1) ... [2018-11-23 11:58:13,086 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:13" (1/1) ... [2018-11-23 11:58:13,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:13" (1/1) ... [2018-11-23 11:58:13,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:58:13,090 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:58:13,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:58:13,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:58:13,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:13" (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-23 11:58:13,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:58:13,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:58:13,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 11:58:13,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:58:13,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:58:13,259 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 11:58:13,259 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:58:13,259 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:58:13,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:58:13,260 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:58:13,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 11:58:14,090 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:58:14,091 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 11:58:14,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:14 BoogieIcfgContainer [2018-11-23 11:58:14,091 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:58:14,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:58:14,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:58:14,099 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:58:14,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:58:12" (1/3) ... [2018-11-23 11:58:14,101 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1489f427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:14, skipping insertion in model container [2018-11-23 11:58:14,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:58:13" (2/3) ... [2018-11-23 11:58:14,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1489f427 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:58:14, skipping insertion in model container [2018-11-23 11:58:14,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:58:14" (3/3) ... [2018-11-23 11:58:14,104 INFO L112 eAbstractionObserver]: Analyzing ICFG sanfoundry_02_true-unreach-call_ground.i [2018-11-23 11:58:14,116 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:58:14,128 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:58:14,146 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:58:14,187 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:58:14,188 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:58:14,188 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:58:14,188 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:58:14,189 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:58:14,189 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:58:14,189 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:58:14,189 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:58:14,189 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:58:14,211 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-23 11:58:14,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:58:14,218 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:14,219 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:14,222 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:14,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:14,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1324526188, now seen corresponding path program 1 times [2018-11-23 11:58:14,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:14,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:14,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:14,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:14,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:14,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:14,415 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-23 11:58:14,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37#true} is VALID [2018-11-23 11:58:14,421 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-23 11:58:14,421 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #88#return; {37#true} is VALID [2018-11-23 11:58:14,422 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret13 := main(); {37#true} is VALID [2018-11-23 11:58:14,422 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {37#true} is VALID [2018-11-23 11:58:14,422 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {37#true} is VALID [2018-11-23 11:58:14,423 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#true} ~i~0 := 2; {37#true} is VALID [2018-11-23 11:58:14,425 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-23 11:58:14,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} havoc ~x~0;~x~0 := 0; {38#false} is VALID [2018-11-23 11:58:14,426 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {38#false} is VALID [2018-11-23 11:58:14,426 INFO L256 TraceCheckUtils]: 11: Hoare triple {38#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {38#false} is VALID [2018-11-23 11:58:14,426 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-23 11:58:14,427 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume 0 == ~cond; {38#false} is VALID [2018-11-23 11:58:14,427 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-23 11:58:14,430 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-23 11:58:14,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:14,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:58:14,438 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:58:14,441 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:14,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:58:14,651 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-23 11:58:14,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:58:14,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:58:14,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:58:14,666 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-23 11:58:14,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:14,836 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2018-11-23 11:58:14,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:58:14,836 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 11:58:14,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:14,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:14,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 11:58:14,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:58:14,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 11:58:14,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2018-11-23 11:58:15,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:15,145 INFO L225 Difference]: With dead ends: 56 [2018-11-23 11:58:15,145 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 11:58:15,149 INFO L631 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-23 11:58:15,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 11:58:15,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 11:58:15,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:15,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 11:58:15,199 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 11:58:15,199 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 11:58:15,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:15,205 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-23 11:58:15,206 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 11:58:15,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:15,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:15,207 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 11:58:15,207 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 11:58:15,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:15,213 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-23 11:58:15,213 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 11:58:15,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:15,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:15,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:15,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:15,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:58:15,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-23 11:58:15,220 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 15 [2018-11-23 11:58:15,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:15,221 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-23 11:58:15,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:58:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 11:58:15,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 11:58:15,222 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:15,222 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:15,223 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:15,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:15,223 INFO L82 PathProgramCache]: Analyzing trace with hash 9369180, now seen corresponding path program 1 times [2018-11-23 11:58:15,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:15,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:15,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:15,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:15,307 INFO L256 TraceCheckUtils]: 0: Hoare triple {209#true} call ULTIMATE.init(); {209#true} is VALID [2018-11-23 11:58:15,307 INFO L273 TraceCheckUtils]: 1: Hoare triple {209#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {209#true} is VALID [2018-11-23 11:58:15,308 INFO L273 TraceCheckUtils]: 2: Hoare triple {209#true} assume true; {209#true} is VALID [2018-11-23 11:58:15,308 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {209#true} {209#true} #88#return; {209#true} is VALID [2018-11-23 11:58:15,308 INFO L256 TraceCheckUtils]: 4: Hoare triple {209#true} call #t~ret13 := main(); {209#true} is VALID [2018-11-23 11:58:15,309 INFO L273 TraceCheckUtils]: 5: Hoare triple {209#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {209#true} is VALID [2018-11-23 11:58:15,309 INFO L273 TraceCheckUtils]: 6: Hoare triple {209#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {209#true} is VALID [2018-11-23 11:58:15,325 INFO L273 TraceCheckUtils]: 7: Hoare triple {209#true} ~i~0 := 2; {211#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:15,340 INFO L273 TraceCheckUtils]: 8: Hoare triple {211#(<= main_~i~0 2)} assume !(~i~0 < 100000); {210#false} is VALID [2018-11-23 11:58:15,341 INFO L273 TraceCheckUtils]: 9: Hoare triple {210#false} havoc ~x~0;~x~0 := 0; {210#false} is VALID [2018-11-23 11:58:15,341 INFO L273 TraceCheckUtils]: 10: Hoare triple {210#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {210#false} is VALID [2018-11-23 11:58:15,341 INFO L256 TraceCheckUtils]: 11: Hoare triple {210#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {210#false} is VALID [2018-11-23 11:58:15,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {210#false} ~cond := #in~cond; {210#false} is VALID [2018-11-23 11:58:15,342 INFO L273 TraceCheckUtils]: 13: Hoare triple {210#false} assume 0 == ~cond; {210#false} is VALID [2018-11-23 11:58:15,343 INFO L273 TraceCheckUtils]: 14: Hoare triple {210#false} assume !false; {210#false} is VALID [2018-11-23 11:58:15,346 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-23 11:58:15,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:58:15,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:58:15,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:58:15,350 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:15,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:58:15,392 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-23 11:58:15,392 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:58:15,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:58:15,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:58:15,393 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 3 states. [2018-11-23 11:58:15,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:15,960 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2018-11-23 11:58:15,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:58:15,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 11:58:15,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:15,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 11:58:15,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:58:15,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 11:58:15,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-11-23 11:58:16,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:16,185 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:58:16,186 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:58:16,187 INFO L631 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-23 11:58:16,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:58:16,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-23 11:58:16,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:16,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 30 states. [2018-11-23 11:58:16,213 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 30 states. [2018-11-23 11:58:16,213 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 30 states. [2018-11-23 11:58:16,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:16,217 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2018-11-23 11:58:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2018-11-23 11:58:16,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:16,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:16,219 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 33 states. [2018-11-23 11:58:16,219 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 33 states. [2018-11-23 11:58:16,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:16,223 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2018-11-23 11:58:16,224 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2018-11-23 11:58:16,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:16,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:16,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:16,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:58:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 11:58:16,228 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 15 [2018-11-23 11:58:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:16,228 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 11:58:16,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:58:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 11:58:16,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:58:16,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:16,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:16,230 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:16,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:16,231 INFO L82 PathProgramCache]: Analyzing trace with hash 594149057, now seen corresponding path program 1 times [2018-11-23 11:58:16,231 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:16,231 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:16,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:16,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:16,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:16,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:16,340 INFO L256 TraceCheckUtils]: 0: Hoare triple {387#true} call ULTIMATE.init(); {387#true} is VALID [2018-11-23 11:58:16,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {387#true} is VALID [2018-11-23 11:58:16,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {387#true} assume true; {387#true} is VALID [2018-11-23 11:58:16,342 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {387#true} {387#true} #88#return; {387#true} is VALID [2018-11-23 11:58:16,342 INFO L256 TraceCheckUtils]: 4: Hoare triple {387#true} call #t~ret13 := main(); {387#true} is VALID [2018-11-23 11:58:16,343 INFO L273 TraceCheckUtils]: 5: Hoare triple {387#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {387#true} is VALID [2018-11-23 11:58:16,343 INFO L273 TraceCheckUtils]: 6: Hoare triple {387#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {387#true} is VALID [2018-11-23 11:58:16,344 INFO L273 TraceCheckUtils]: 7: Hoare triple {387#true} ~i~0 := 2; {389#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:16,344 INFO L273 TraceCheckUtils]: 8: Hoare triple {389#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {389#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:16,348 INFO L273 TraceCheckUtils]: 9: Hoare triple {389#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {389#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:16,350 INFO L273 TraceCheckUtils]: 10: Hoare triple {389#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {390#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:16,351 INFO L273 TraceCheckUtils]: 11: Hoare triple {390#(<= main_~i~0 3)} assume !(~i~0 < 100000); {388#false} is VALID [2018-11-23 11:58:16,351 INFO L273 TraceCheckUtils]: 12: Hoare triple {388#false} havoc ~x~0;~x~0 := 0; {388#false} is VALID [2018-11-23 11:58:16,351 INFO L273 TraceCheckUtils]: 13: Hoare triple {388#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {388#false} is VALID [2018-11-23 11:58:16,352 INFO L256 TraceCheckUtils]: 14: Hoare triple {388#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {388#false} is VALID [2018-11-23 11:58:16,352 INFO L273 TraceCheckUtils]: 15: Hoare triple {388#false} ~cond := #in~cond; {388#false} is VALID [2018-11-23 11:58:16,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {388#false} assume 0 == ~cond; {388#false} is VALID [2018-11-23 11:58:16,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {388#false} assume !false; {388#false} is VALID [2018-11-23 11:58:16,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:16,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:16,356 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-23 11:58:16,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:16,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:16,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:16,422 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:16,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {387#true} call ULTIMATE.init(); {387#true} is VALID [2018-11-23 11:58:16,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {387#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {387#true} is VALID [2018-11-23 11:58:16,618 INFO L273 TraceCheckUtils]: 2: Hoare triple {387#true} assume true; {387#true} is VALID [2018-11-23 11:58:16,618 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {387#true} {387#true} #88#return; {387#true} is VALID [2018-11-23 11:58:16,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {387#true} call #t~ret13 := main(); {387#true} is VALID [2018-11-23 11:58:16,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {387#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {387#true} is VALID [2018-11-23 11:58:16,619 INFO L273 TraceCheckUtils]: 6: Hoare triple {387#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {387#true} is VALID [2018-11-23 11:58:16,632 INFO L273 TraceCheckUtils]: 7: Hoare triple {387#true} ~i~0 := 2; {389#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:16,645 INFO L273 TraceCheckUtils]: 8: Hoare triple {389#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {389#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:16,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {389#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {389#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:16,672 INFO L273 TraceCheckUtils]: 10: Hoare triple {389#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {390#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:16,685 INFO L273 TraceCheckUtils]: 11: Hoare triple {390#(<= main_~i~0 3)} assume !(~i~0 < 100000); {388#false} is VALID [2018-11-23 11:58:16,685 INFO L273 TraceCheckUtils]: 12: Hoare triple {388#false} havoc ~x~0;~x~0 := 0; {388#false} is VALID [2018-11-23 11:58:16,686 INFO L273 TraceCheckUtils]: 13: Hoare triple {388#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {388#false} is VALID [2018-11-23 11:58:16,688 INFO L256 TraceCheckUtils]: 14: Hoare triple {388#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {388#false} is VALID [2018-11-23 11:58:16,688 INFO L273 TraceCheckUtils]: 15: Hoare triple {388#false} ~cond := #in~cond; {388#false} is VALID [2018-11-23 11:58:16,688 INFO L273 TraceCheckUtils]: 16: Hoare triple {388#false} assume 0 == ~cond; {388#false} is VALID [2018-11-23 11:58:16,689 INFO L273 TraceCheckUtils]: 17: Hoare triple {388#false} assume !false; {388#false} is VALID [2018-11-23 11:58:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:16,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:16,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 11:58:16,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 11:58:16,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:16,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 11:58:16,805 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:16,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 11:58:16,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 11:58:16,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:58:16,807 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2018-11-23 11:58:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:17,217 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2018-11-23 11:58:17,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 11:58:17,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-11-23 11:58:17,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:17,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:58:17,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 11:58:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 11:58:17,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 69 transitions. [2018-11-23 11:58:17,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 69 transitions. [2018-11-23 11:58:17,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:17,449 INFO L225 Difference]: With dead ends: 54 [2018-11-23 11:58:17,449 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 11:58:17,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 11:58:17,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 11:58:17,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-11-23 11:58:17,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:17,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 34 states. [2018-11-23 11:58:17,470 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 34 states. [2018-11-23 11:58:17,470 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 34 states. [2018-11-23 11:58:17,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:17,475 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2018-11-23 11:58:17,476 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-23 11:58:17,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:17,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:17,480 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 37 states. [2018-11-23 11:58:17,480 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 37 states. [2018-11-23 11:58:17,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:17,483 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2018-11-23 11:58:17,484 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 48 transitions. [2018-11-23 11:58:17,484 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:17,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:17,485 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:17,485 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:17,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:58:17,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2018-11-23 11:58:17,488 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 18 [2018-11-23 11:58:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:17,489 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2018-11-23 11:58:17,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 11:58:17,489 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2018-11-23 11:58:17,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 11:58:17,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:17,490 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:17,491 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:17,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:17,491 INFO L82 PathProgramCache]: Analyzing trace with hash 1384112188, now seen corresponding path program 2 times [2018-11-23 11:58:17,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:17,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:17,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:17,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:17,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:17,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:17,604 INFO L256 TraceCheckUtils]: 0: Hoare triple {635#true} call ULTIMATE.init(); {635#true} is VALID [2018-11-23 11:58:17,605 INFO L273 TraceCheckUtils]: 1: Hoare triple {635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {635#true} is VALID [2018-11-23 11:58:17,605 INFO L273 TraceCheckUtils]: 2: Hoare triple {635#true} assume true; {635#true} is VALID [2018-11-23 11:58:17,605 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {635#true} {635#true} #88#return; {635#true} is VALID [2018-11-23 11:58:17,605 INFO L256 TraceCheckUtils]: 4: Hoare triple {635#true} call #t~ret13 := main(); {635#true} is VALID [2018-11-23 11:58:17,606 INFO L273 TraceCheckUtils]: 5: Hoare triple {635#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {635#true} is VALID [2018-11-23 11:58:17,606 INFO L273 TraceCheckUtils]: 6: Hoare triple {635#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {635#true} is VALID [2018-11-23 11:58:17,607 INFO L273 TraceCheckUtils]: 7: Hoare triple {635#true} ~i~0 := 2; {637#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:17,607 INFO L273 TraceCheckUtils]: 8: Hoare triple {637#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {637#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:17,608 INFO L273 TraceCheckUtils]: 9: Hoare triple {637#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {637#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:17,610 INFO L273 TraceCheckUtils]: 10: Hoare triple {637#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {638#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:17,610 INFO L273 TraceCheckUtils]: 11: Hoare triple {638#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {638#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:17,611 INFO L273 TraceCheckUtils]: 12: Hoare triple {638#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {638#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:17,612 INFO L273 TraceCheckUtils]: 13: Hoare triple {638#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {639#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:17,612 INFO L273 TraceCheckUtils]: 14: Hoare triple {639#(<= main_~i~0 4)} assume !(~i~0 < 100000); {636#false} is VALID [2018-11-23 11:58:17,613 INFO L273 TraceCheckUtils]: 15: Hoare triple {636#false} havoc ~x~0;~x~0 := 0; {636#false} is VALID [2018-11-23 11:58:17,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {636#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {636#false} is VALID [2018-11-23 11:58:17,613 INFO L256 TraceCheckUtils]: 17: Hoare triple {636#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {636#false} is VALID [2018-11-23 11:58:17,613 INFO L273 TraceCheckUtils]: 18: Hoare triple {636#false} ~cond := #in~cond; {636#false} is VALID [2018-11-23 11:58:17,614 INFO L273 TraceCheckUtils]: 19: Hoare triple {636#false} assume 0 == ~cond; {636#false} is VALID [2018-11-23 11:58:17,614 INFO L273 TraceCheckUtils]: 20: Hoare triple {636#false} assume !false; {636#false} is VALID [2018-11-23 11:58:17,616 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:17,616 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:17,617 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-23 11:58:17,630 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:17,674 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:17,674 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:17,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:17,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:17,786 INFO L256 TraceCheckUtils]: 0: Hoare triple {635#true} call ULTIMATE.init(); {635#true} is VALID [2018-11-23 11:58:17,787 INFO L273 TraceCheckUtils]: 1: Hoare triple {635#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {635#true} is VALID [2018-11-23 11:58:17,787 INFO L273 TraceCheckUtils]: 2: Hoare triple {635#true} assume true; {635#true} is VALID [2018-11-23 11:58:17,787 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {635#true} {635#true} #88#return; {635#true} is VALID [2018-11-23 11:58:17,788 INFO L256 TraceCheckUtils]: 4: Hoare triple {635#true} call #t~ret13 := main(); {635#true} is VALID [2018-11-23 11:58:17,788 INFO L273 TraceCheckUtils]: 5: Hoare triple {635#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {635#true} is VALID [2018-11-23 11:58:17,788 INFO L273 TraceCheckUtils]: 6: Hoare triple {635#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {635#true} is VALID [2018-11-23 11:58:17,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {635#true} ~i~0 := 2; {637#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:17,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {637#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {637#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:17,795 INFO L273 TraceCheckUtils]: 9: Hoare triple {637#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {637#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:17,796 INFO L273 TraceCheckUtils]: 10: Hoare triple {637#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {638#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:17,796 INFO L273 TraceCheckUtils]: 11: Hoare triple {638#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {638#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:17,797 INFO L273 TraceCheckUtils]: 12: Hoare triple {638#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {638#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:17,798 INFO L273 TraceCheckUtils]: 13: Hoare triple {638#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {639#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:17,798 INFO L273 TraceCheckUtils]: 14: Hoare triple {639#(<= main_~i~0 4)} assume !(~i~0 < 100000); {636#false} is VALID [2018-11-23 11:58:17,799 INFO L273 TraceCheckUtils]: 15: Hoare triple {636#false} havoc ~x~0;~x~0 := 0; {636#false} is VALID [2018-11-23 11:58:17,799 INFO L273 TraceCheckUtils]: 16: Hoare triple {636#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {636#false} is VALID [2018-11-23 11:58:17,799 INFO L256 TraceCheckUtils]: 17: Hoare triple {636#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {636#false} is VALID [2018-11-23 11:58:17,800 INFO L273 TraceCheckUtils]: 18: Hoare triple {636#false} ~cond := #in~cond; {636#false} is VALID [2018-11-23 11:58:17,800 INFO L273 TraceCheckUtils]: 19: Hoare triple {636#false} assume 0 == ~cond; {636#false} is VALID [2018-11-23 11:58:17,801 INFO L273 TraceCheckUtils]: 20: Hoare triple {636#false} assume !false; {636#false} is VALID [2018-11-23 11:58:17,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:17,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:17,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2018-11-23 11:58:17,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 11:58:17,825 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:17,825 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:58:17,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:17,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:58:17,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:58:17,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:17,859 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand 5 states. [2018-11-23 11:58:18,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:18,126 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2018-11-23 11:58:18,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:58:18,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2018-11-23 11:58:18,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:18,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-23 11:58:18,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:58:18,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 75 transitions. [2018-11-23 11:58:18,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 75 transitions. [2018-11-23 11:58:18,300 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:18,303 INFO L225 Difference]: With dead ends: 58 [2018-11-23 11:58:18,304 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:58:18,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:58:18,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:58:18,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-11-23 11:58:18,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:18,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 38 states. [2018-11-23 11:58:18,345 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 38 states. [2018-11-23 11:58:18,345 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 38 states. [2018-11-23 11:58:18,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:18,348 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2018-11-23 11:58:18,348 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2018-11-23 11:58:18,349 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:18,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:18,349 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 41 states. [2018-11-23 11:58:18,350 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 41 states. [2018-11-23 11:58:18,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:18,353 INFO L93 Difference]: Finished difference Result 41 states and 54 transitions. [2018-11-23 11:58:18,353 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2018-11-23 11:58:18,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:18,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:18,354 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:18,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:18,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:58:18,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 49 transitions. [2018-11-23 11:58:18,357 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 49 transitions. Word has length 21 [2018-11-23 11:58:18,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:18,357 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 49 transitions. [2018-11-23 11:58:18,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:58:18,358 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 49 transitions. [2018-11-23 11:58:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 11:58:18,358 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:18,359 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:18,359 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:18,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:18,360 INFO L82 PathProgramCache]: Analyzing trace with hash -1245034271, now seen corresponding path program 3 times [2018-11-23 11:58:18,360 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:18,360 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:18,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:18,361 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:18,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:18,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:18,498 INFO L256 TraceCheckUtils]: 0: Hoare triple {911#true} call ULTIMATE.init(); {911#true} is VALID [2018-11-23 11:58:18,498 INFO L273 TraceCheckUtils]: 1: Hoare triple {911#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {911#true} is VALID [2018-11-23 11:58:18,499 INFO L273 TraceCheckUtils]: 2: Hoare triple {911#true} assume true; {911#true} is VALID [2018-11-23 11:58:18,499 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {911#true} {911#true} #88#return; {911#true} is VALID [2018-11-23 11:58:18,500 INFO L256 TraceCheckUtils]: 4: Hoare triple {911#true} call #t~ret13 := main(); {911#true} is VALID [2018-11-23 11:58:18,500 INFO L273 TraceCheckUtils]: 5: Hoare triple {911#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {911#true} is VALID [2018-11-23 11:58:18,500 INFO L273 TraceCheckUtils]: 6: Hoare triple {911#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {911#true} is VALID [2018-11-23 11:58:18,501 INFO L273 TraceCheckUtils]: 7: Hoare triple {911#true} ~i~0 := 2; {913#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:18,502 INFO L273 TraceCheckUtils]: 8: Hoare triple {913#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {913#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:18,503 INFO L273 TraceCheckUtils]: 9: Hoare triple {913#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {913#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:18,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {913#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {914#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:18,504 INFO L273 TraceCheckUtils]: 11: Hoare triple {914#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {914#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:18,504 INFO L273 TraceCheckUtils]: 12: Hoare triple {914#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {914#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:18,521 INFO L273 TraceCheckUtils]: 13: Hoare triple {914#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {915#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:18,527 INFO L273 TraceCheckUtils]: 14: Hoare triple {915#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {915#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:18,528 INFO L273 TraceCheckUtils]: 15: Hoare triple {915#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {915#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:18,529 INFO L273 TraceCheckUtils]: 16: Hoare triple {915#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {916#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:18,531 INFO L273 TraceCheckUtils]: 17: Hoare triple {916#(<= main_~i~0 5)} assume !(~i~0 < 100000); {912#false} is VALID [2018-11-23 11:58:18,531 INFO L273 TraceCheckUtils]: 18: Hoare triple {912#false} havoc ~x~0;~x~0 := 0; {912#false} is VALID [2018-11-23 11:58:18,532 INFO L273 TraceCheckUtils]: 19: Hoare triple {912#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {912#false} is VALID [2018-11-23 11:58:18,532 INFO L256 TraceCheckUtils]: 20: Hoare triple {912#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {912#false} is VALID [2018-11-23 11:58:18,533 INFO L273 TraceCheckUtils]: 21: Hoare triple {912#false} ~cond := #in~cond; {912#false} is VALID [2018-11-23 11:58:18,533 INFO L273 TraceCheckUtils]: 22: Hoare triple {912#false} assume 0 == ~cond; {912#false} is VALID [2018-11-23 11:58:18,534 INFO L273 TraceCheckUtils]: 23: Hoare triple {912#false} assume !false; {912#false} is VALID [2018-11-23 11:58:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:18,536 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:18,536 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-23 11:58:18,547 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:18,567 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2018-11-23 11:58:18,568 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:18,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:18,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:18,666 INFO L256 TraceCheckUtils]: 0: Hoare triple {911#true} call ULTIMATE.init(); {911#true} is VALID [2018-11-23 11:58:18,666 INFO L273 TraceCheckUtils]: 1: Hoare triple {911#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {911#true} is VALID [2018-11-23 11:58:18,667 INFO L273 TraceCheckUtils]: 2: Hoare triple {911#true} assume true; {911#true} is VALID [2018-11-23 11:58:18,667 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {911#true} {911#true} #88#return; {911#true} is VALID [2018-11-23 11:58:18,667 INFO L256 TraceCheckUtils]: 4: Hoare triple {911#true} call #t~ret13 := main(); {911#true} is VALID [2018-11-23 11:58:18,667 INFO L273 TraceCheckUtils]: 5: Hoare triple {911#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {911#true} is VALID [2018-11-23 11:58:18,668 INFO L273 TraceCheckUtils]: 6: Hoare triple {911#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {911#true} is VALID [2018-11-23 11:58:18,669 INFO L273 TraceCheckUtils]: 7: Hoare triple {911#true} ~i~0 := 2; {913#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:18,672 INFO L273 TraceCheckUtils]: 8: Hoare triple {913#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {913#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:18,672 INFO L273 TraceCheckUtils]: 9: Hoare triple {913#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {913#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:18,673 INFO L273 TraceCheckUtils]: 10: Hoare triple {913#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {914#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:18,673 INFO L273 TraceCheckUtils]: 11: Hoare triple {914#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {914#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:18,674 INFO L273 TraceCheckUtils]: 12: Hoare triple {914#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {914#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:18,675 INFO L273 TraceCheckUtils]: 13: Hoare triple {914#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {915#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:18,675 INFO L273 TraceCheckUtils]: 14: Hoare triple {915#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {915#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:18,675 INFO L273 TraceCheckUtils]: 15: Hoare triple {915#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {915#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:18,676 INFO L273 TraceCheckUtils]: 16: Hoare triple {915#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {916#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:18,677 INFO L273 TraceCheckUtils]: 17: Hoare triple {916#(<= main_~i~0 5)} assume !(~i~0 < 100000); {912#false} is VALID [2018-11-23 11:58:18,678 INFO L273 TraceCheckUtils]: 18: Hoare triple {912#false} havoc ~x~0;~x~0 := 0; {912#false} is VALID [2018-11-23 11:58:18,678 INFO L273 TraceCheckUtils]: 19: Hoare triple {912#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {912#false} is VALID [2018-11-23 11:58:18,679 INFO L256 TraceCheckUtils]: 20: Hoare triple {912#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {912#false} is VALID [2018-11-23 11:58:18,679 INFO L273 TraceCheckUtils]: 21: Hoare triple {912#false} ~cond := #in~cond; {912#false} is VALID [2018-11-23 11:58:18,679 INFO L273 TraceCheckUtils]: 22: Hoare triple {912#false} assume 0 == ~cond; {912#false} is VALID [2018-11-23 11:58:18,680 INFO L273 TraceCheckUtils]: 23: Hoare triple {912#false} assume !false; {912#false} is VALID [2018-11-23 11:58:18,681 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:18,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:18,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 11:58:18,702 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-23 11:58:18,702 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:18,702 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 11:58:18,730 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-23 11:58:18,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 11:58:18,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 11:58:18,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:58:18,731 INFO L87 Difference]: Start difference. First operand 38 states and 49 transitions. Second operand 6 states. [2018-11-23 11:58:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:19,045 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2018-11-23 11:58:19,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 11:58:19,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-23 11:58:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:58:19,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 11:58:19,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 11:58:19,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 81 transitions. [2018-11-23 11:58:19,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 81 transitions. [2018-11-23 11:58:19,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:19,178 INFO L225 Difference]: With dead ends: 62 [2018-11-23 11:58:19,179 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 11:58:19,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 11:58:19,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 11:58:19,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 42. [2018-11-23 11:58:19,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:19,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 42 states. [2018-11-23 11:58:19,211 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 42 states. [2018-11-23 11:58:19,211 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 42 states. [2018-11-23 11:58:19,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:19,213 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2018-11-23 11:58:19,214 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2018-11-23 11:58:19,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:19,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:19,216 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 45 states. [2018-11-23 11:58:19,216 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 45 states. [2018-11-23 11:58:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:19,223 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2018-11-23 11:58:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2018-11-23 11:58:19,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:19,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:19,227 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:19,228 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:19,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:58:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2018-11-23 11:58:19,230 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 24 [2018-11-23 11:58:19,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:19,231 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2018-11-23 11:58:19,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 11:58:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2018-11-23 11:58:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 11:58:19,232 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:19,232 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:19,233 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:19,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:19,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1171382812, now seen corresponding path program 4 times [2018-11-23 11:58:19,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:19,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:19,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:19,235 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:19,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:19,382 INFO L256 TraceCheckUtils]: 0: Hoare triple {1215#true} call ULTIMATE.init(); {1215#true} is VALID [2018-11-23 11:58:19,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {1215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1215#true} is VALID [2018-11-23 11:58:19,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {1215#true} assume true; {1215#true} is VALID [2018-11-23 11:58:19,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1215#true} {1215#true} #88#return; {1215#true} is VALID [2018-11-23 11:58:19,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {1215#true} call #t~ret13 := main(); {1215#true} is VALID [2018-11-23 11:58:19,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {1215#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {1215#true} is VALID [2018-11-23 11:58:19,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {1215#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1215#true} is VALID [2018-11-23 11:58:19,385 INFO L273 TraceCheckUtils]: 7: Hoare triple {1215#true} ~i~0 := 2; {1217#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:19,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {1217#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1217#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:19,386 INFO L273 TraceCheckUtils]: 9: Hoare triple {1217#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1217#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:19,387 INFO L273 TraceCheckUtils]: 10: Hoare triple {1217#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1218#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:19,387 INFO L273 TraceCheckUtils]: 11: Hoare triple {1218#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1218#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:19,388 INFO L273 TraceCheckUtils]: 12: Hoare triple {1218#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1218#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:19,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {1218#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1219#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:19,389 INFO L273 TraceCheckUtils]: 14: Hoare triple {1219#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1219#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:19,390 INFO L273 TraceCheckUtils]: 15: Hoare triple {1219#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1219#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:19,391 INFO L273 TraceCheckUtils]: 16: Hoare triple {1219#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1220#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:19,392 INFO L273 TraceCheckUtils]: 17: Hoare triple {1220#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1220#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:19,393 INFO L273 TraceCheckUtils]: 18: Hoare triple {1220#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1220#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:19,394 INFO L273 TraceCheckUtils]: 19: Hoare triple {1220#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1221#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:19,394 INFO L273 TraceCheckUtils]: 20: Hoare triple {1221#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1216#false} is VALID [2018-11-23 11:58:19,395 INFO L273 TraceCheckUtils]: 21: Hoare triple {1216#false} havoc ~x~0;~x~0 := 0; {1216#false} is VALID [2018-11-23 11:58:19,395 INFO L273 TraceCheckUtils]: 22: Hoare triple {1216#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {1216#false} is VALID [2018-11-23 11:58:19,395 INFO L256 TraceCheckUtils]: 23: Hoare triple {1216#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {1216#false} is VALID [2018-11-23 11:58:19,396 INFO L273 TraceCheckUtils]: 24: Hoare triple {1216#false} ~cond := #in~cond; {1216#false} is VALID [2018-11-23 11:58:19,396 INFO L273 TraceCheckUtils]: 25: Hoare triple {1216#false} assume 0 == ~cond; {1216#false} is VALID [2018-11-23 11:58:19,396 INFO L273 TraceCheckUtils]: 26: Hoare triple {1216#false} assume !false; {1216#false} is VALID [2018-11-23 11:58:19,399 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:19,399 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:19,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 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-23 11:58:19,417 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:19,439 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:19,439 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:19,468 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:19,684 INFO L256 TraceCheckUtils]: 0: Hoare triple {1215#true} call ULTIMATE.init(); {1215#true} is VALID [2018-11-23 11:58:19,684 INFO L273 TraceCheckUtils]: 1: Hoare triple {1215#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1215#true} is VALID [2018-11-23 11:58:19,685 INFO L273 TraceCheckUtils]: 2: Hoare triple {1215#true} assume true; {1215#true} is VALID [2018-11-23 11:58:19,685 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1215#true} {1215#true} #88#return; {1215#true} is VALID [2018-11-23 11:58:19,685 INFO L256 TraceCheckUtils]: 4: Hoare triple {1215#true} call #t~ret13 := main(); {1215#true} is VALID [2018-11-23 11:58:19,686 INFO L273 TraceCheckUtils]: 5: Hoare triple {1215#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {1215#true} is VALID [2018-11-23 11:58:19,686 INFO L273 TraceCheckUtils]: 6: Hoare triple {1215#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1215#true} is VALID [2018-11-23 11:58:19,687 INFO L273 TraceCheckUtils]: 7: Hoare triple {1215#true} ~i~0 := 2; {1217#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:19,688 INFO L273 TraceCheckUtils]: 8: Hoare triple {1217#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1217#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:19,689 INFO L273 TraceCheckUtils]: 9: Hoare triple {1217#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1217#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:19,690 INFO L273 TraceCheckUtils]: 10: Hoare triple {1217#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1218#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:19,707 INFO L273 TraceCheckUtils]: 11: Hoare triple {1218#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1218#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:19,721 INFO L273 TraceCheckUtils]: 12: Hoare triple {1218#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1218#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:19,729 INFO L273 TraceCheckUtils]: 13: Hoare triple {1218#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1219#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:19,730 INFO L273 TraceCheckUtils]: 14: Hoare triple {1219#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1219#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:19,730 INFO L273 TraceCheckUtils]: 15: Hoare triple {1219#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1219#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:19,736 INFO L273 TraceCheckUtils]: 16: Hoare triple {1219#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1220#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:19,736 INFO L273 TraceCheckUtils]: 17: Hoare triple {1220#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1220#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:19,737 INFO L273 TraceCheckUtils]: 18: Hoare triple {1220#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1220#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:19,738 INFO L273 TraceCheckUtils]: 19: Hoare triple {1220#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1221#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:19,745 INFO L273 TraceCheckUtils]: 20: Hoare triple {1221#(<= main_~i~0 6)} assume !(~i~0 < 100000); {1216#false} is VALID [2018-11-23 11:58:19,745 INFO L273 TraceCheckUtils]: 21: Hoare triple {1216#false} havoc ~x~0;~x~0 := 0; {1216#false} is VALID [2018-11-23 11:58:19,745 INFO L273 TraceCheckUtils]: 22: Hoare triple {1216#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {1216#false} is VALID [2018-11-23 11:58:19,746 INFO L256 TraceCheckUtils]: 23: Hoare triple {1216#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {1216#false} is VALID [2018-11-23 11:58:19,746 INFO L273 TraceCheckUtils]: 24: Hoare triple {1216#false} ~cond := #in~cond; {1216#false} is VALID [2018-11-23 11:58:19,746 INFO L273 TraceCheckUtils]: 25: Hoare triple {1216#false} assume 0 == ~cond; {1216#false} is VALID [2018-11-23 11:58:19,746 INFO L273 TraceCheckUtils]: 26: Hoare triple {1216#false} assume !false; {1216#false} is VALID [2018-11-23 11:58:19,748 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:19,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:19,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2018-11-23 11:58:19,770 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-23 11:58:19,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:19,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 11:58:19,802 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:19,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 11:58:19,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 11:58:19,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:58:19,804 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 7 states. [2018-11-23 11:58:20,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:20,099 INFO L93 Difference]: Finished difference Result 66 states and 87 transitions. [2018-11-23 11:58:20,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 11:58:20,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-23 11:58:20,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:20,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:58:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2018-11-23 11:58:20,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 11:58:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2018-11-23 11:58:20,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2018-11-23 11:58:20,207 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-23 11:58:20,209 INFO L225 Difference]: With dead ends: 66 [2018-11-23 11:58:20,209 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 11:58:20,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 11:58:20,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 11:58:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-11-23 11:58:20,264 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:20,265 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 46 states. [2018-11-23 11:58:20,265 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 46 states. [2018-11-23 11:58:20,265 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 46 states. [2018-11-23 11:58:20,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:20,268 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2018-11-23 11:58:20,268 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2018-11-23 11:58:20,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:20,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:20,269 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 49 states. [2018-11-23 11:58:20,269 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 49 states. [2018-11-23 11:58:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:20,272 INFO L93 Difference]: Finished difference Result 49 states and 66 transitions. [2018-11-23 11:58:20,272 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 66 transitions. [2018-11-23 11:58:20,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:20,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:20,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:20,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:20,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 11:58:20,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2018-11-23 11:58:20,276 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 27 [2018-11-23 11:58:20,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:20,277 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2018-11-23 11:58:20,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 11:58:20,277 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2018-11-23 11:58:20,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 11:58:20,278 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:20,278 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:20,278 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:20,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:20,279 INFO L82 PathProgramCache]: Analyzing trace with hash 705854209, now seen corresponding path program 5 times [2018-11-23 11:58:20,279 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:20,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:20,280 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:20,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:20,454 INFO L256 TraceCheckUtils]: 0: Hoare triple {1547#true} call ULTIMATE.init(); {1547#true} is VALID [2018-11-23 11:58:20,455 INFO L273 TraceCheckUtils]: 1: Hoare triple {1547#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1547#true} is VALID [2018-11-23 11:58:20,455 INFO L273 TraceCheckUtils]: 2: Hoare triple {1547#true} assume true; {1547#true} is VALID [2018-11-23 11:58:20,455 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1547#true} {1547#true} #88#return; {1547#true} is VALID [2018-11-23 11:58:20,456 INFO L256 TraceCheckUtils]: 4: Hoare triple {1547#true} call #t~ret13 := main(); {1547#true} is VALID [2018-11-23 11:58:20,456 INFO L273 TraceCheckUtils]: 5: Hoare triple {1547#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {1547#true} is VALID [2018-11-23 11:58:20,457 INFO L273 TraceCheckUtils]: 6: Hoare triple {1547#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1547#true} is VALID [2018-11-23 11:58:20,458 INFO L273 TraceCheckUtils]: 7: Hoare triple {1547#true} ~i~0 := 2; {1549#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:20,458 INFO L273 TraceCheckUtils]: 8: Hoare triple {1549#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1549#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:20,459 INFO L273 TraceCheckUtils]: 9: Hoare triple {1549#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1549#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:20,459 INFO L273 TraceCheckUtils]: 10: Hoare triple {1549#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1550#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:20,460 INFO L273 TraceCheckUtils]: 11: Hoare triple {1550#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1550#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:20,460 INFO L273 TraceCheckUtils]: 12: Hoare triple {1550#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1550#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:20,461 INFO L273 TraceCheckUtils]: 13: Hoare triple {1550#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1551#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:20,462 INFO L273 TraceCheckUtils]: 14: Hoare triple {1551#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1551#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:20,462 INFO L273 TraceCheckUtils]: 15: Hoare triple {1551#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1551#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:20,464 INFO L273 TraceCheckUtils]: 16: Hoare triple {1551#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1552#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:20,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {1552#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1552#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:20,469 INFO L273 TraceCheckUtils]: 18: Hoare triple {1552#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1552#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:20,470 INFO L273 TraceCheckUtils]: 19: Hoare triple {1552#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1553#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:20,471 INFO L273 TraceCheckUtils]: 20: Hoare triple {1553#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1553#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:20,471 INFO L273 TraceCheckUtils]: 21: Hoare triple {1553#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1553#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:20,472 INFO L273 TraceCheckUtils]: 22: Hoare triple {1553#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1554#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:20,473 INFO L273 TraceCheckUtils]: 23: Hoare triple {1554#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1548#false} is VALID [2018-11-23 11:58:20,473 INFO L273 TraceCheckUtils]: 24: Hoare triple {1548#false} havoc ~x~0;~x~0 := 0; {1548#false} is VALID [2018-11-23 11:58:20,473 INFO L273 TraceCheckUtils]: 25: Hoare triple {1548#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {1548#false} is VALID [2018-11-23 11:58:20,474 INFO L256 TraceCheckUtils]: 26: Hoare triple {1548#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {1548#false} is VALID [2018-11-23 11:58:20,474 INFO L273 TraceCheckUtils]: 27: Hoare triple {1548#false} ~cond := #in~cond; {1548#false} is VALID [2018-11-23 11:58:20,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {1548#false} assume 0 == ~cond; {1548#false} is VALID [2018-11-23 11:58:20,475 INFO L273 TraceCheckUtils]: 29: Hoare triple {1548#false} assume !false; {1548#false} is VALID [2018-11-23 11:58:20,476 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:20,477 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:20,477 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-23 11:58:20,486 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:58:20,588 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2018-11-23 11:58:20,588 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:20,618 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:20,758 INFO L256 TraceCheckUtils]: 0: Hoare triple {1547#true} call ULTIMATE.init(); {1547#true} is VALID [2018-11-23 11:58:20,759 INFO L273 TraceCheckUtils]: 1: Hoare triple {1547#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1547#true} is VALID [2018-11-23 11:58:20,759 INFO L273 TraceCheckUtils]: 2: Hoare triple {1547#true} assume true; {1547#true} is VALID [2018-11-23 11:58:20,759 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1547#true} {1547#true} #88#return; {1547#true} is VALID [2018-11-23 11:58:20,760 INFO L256 TraceCheckUtils]: 4: Hoare triple {1547#true} call #t~ret13 := main(); {1547#true} is VALID [2018-11-23 11:58:20,760 INFO L273 TraceCheckUtils]: 5: Hoare triple {1547#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {1547#true} is VALID [2018-11-23 11:58:20,760 INFO L273 TraceCheckUtils]: 6: Hoare triple {1547#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1547#true} is VALID [2018-11-23 11:58:20,761 INFO L273 TraceCheckUtils]: 7: Hoare triple {1547#true} ~i~0 := 2; {1549#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:20,762 INFO L273 TraceCheckUtils]: 8: Hoare triple {1549#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1549#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:20,763 INFO L273 TraceCheckUtils]: 9: Hoare triple {1549#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1549#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:20,764 INFO L273 TraceCheckUtils]: 10: Hoare triple {1549#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1550#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:20,764 INFO L273 TraceCheckUtils]: 11: Hoare triple {1550#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1550#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:20,765 INFO L273 TraceCheckUtils]: 12: Hoare triple {1550#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1550#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:20,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {1550#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1551#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:20,771 INFO L273 TraceCheckUtils]: 14: Hoare triple {1551#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1551#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:20,775 INFO L273 TraceCheckUtils]: 15: Hoare triple {1551#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1551#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:20,777 INFO L273 TraceCheckUtils]: 16: Hoare triple {1551#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1552#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:20,778 INFO L273 TraceCheckUtils]: 17: Hoare triple {1552#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1552#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:20,778 INFO L273 TraceCheckUtils]: 18: Hoare triple {1552#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1552#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:20,779 INFO L273 TraceCheckUtils]: 19: Hoare triple {1552#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1553#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:20,779 INFO L273 TraceCheckUtils]: 20: Hoare triple {1553#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1553#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:20,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {1553#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1553#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:20,780 INFO L273 TraceCheckUtils]: 22: Hoare triple {1553#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1554#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:20,781 INFO L273 TraceCheckUtils]: 23: Hoare triple {1554#(<= main_~i~0 7)} assume !(~i~0 < 100000); {1548#false} is VALID [2018-11-23 11:58:20,781 INFO L273 TraceCheckUtils]: 24: Hoare triple {1548#false} havoc ~x~0;~x~0 := 0; {1548#false} is VALID [2018-11-23 11:58:20,782 INFO L273 TraceCheckUtils]: 25: Hoare triple {1548#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {1548#false} is VALID [2018-11-23 11:58:20,782 INFO L256 TraceCheckUtils]: 26: Hoare triple {1548#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {1548#false} is VALID [2018-11-23 11:58:20,783 INFO L273 TraceCheckUtils]: 27: Hoare triple {1548#false} ~cond := #in~cond; {1548#false} is VALID [2018-11-23 11:58:20,783 INFO L273 TraceCheckUtils]: 28: Hoare triple {1548#false} assume 0 == ~cond; {1548#false} is VALID [2018-11-23 11:58:20,783 INFO L273 TraceCheckUtils]: 29: Hoare triple {1548#false} assume !false; {1548#false} is VALID [2018-11-23 11:58:20,786 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:20,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:20,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2018-11-23 11:58:20,817 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-23 11:58:20,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:20,818 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:58:20,857 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:20,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:58:20,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:58:20,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:20,858 INFO L87 Difference]: Start difference. First operand 46 states and 61 transitions. Second operand 8 states. [2018-11-23 11:58:21,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:21,315 INFO L93 Difference]: Finished difference Result 70 states and 93 transitions. [2018-11-23 11:58:21,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:58:21,315 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2018-11-23 11:58:21,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:21,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:21,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2018-11-23 11:58:21,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:58:21,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 93 transitions. [2018-11-23 11:58:21,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 93 transitions. [2018-11-23 11:58:21,453 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:21,456 INFO L225 Difference]: With dead ends: 70 [2018-11-23 11:58:21,456 INFO L226 Difference]: Without dead ends: 53 [2018-11-23 11:58:21,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:58:21,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-23 11:58:21,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-11-23 11:58:21,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:21,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 50 states. [2018-11-23 11:58:21,478 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 50 states. [2018-11-23 11:58:21,478 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 50 states. [2018-11-23 11:58:21,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:21,481 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2018-11-23 11:58:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2018-11-23 11:58:21,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:21,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:21,482 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 53 states. [2018-11-23 11:58:21,482 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 53 states. [2018-11-23 11:58:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:21,485 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2018-11-23 11:58:21,485 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 72 transitions. [2018-11-23 11:58:21,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:21,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:21,486 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:21,486 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:21,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 11:58:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2018-11-23 11:58:21,488 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 30 [2018-11-23 11:58:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:21,489 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2018-11-23 11:58:21,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:58:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2018-11-23 11:58:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 11:58:21,490 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:21,490 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:21,490 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:21,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:21,491 INFO L82 PathProgramCache]: Analyzing trace with hash 592641020, now seen corresponding path program 6 times [2018-11-23 11:58:21,491 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:21,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:21,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:21,492 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:21,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:21,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:21,898 INFO L256 TraceCheckUtils]: 0: Hoare triple {1907#true} call ULTIMATE.init(); {1907#true} is VALID [2018-11-23 11:58:21,898 INFO L273 TraceCheckUtils]: 1: Hoare triple {1907#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1907#true} is VALID [2018-11-23 11:58:21,898 INFO L273 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2018-11-23 11:58:21,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {1907#true} #88#return; {1907#true} is VALID [2018-11-23 11:58:21,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {1907#true} call #t~ret13 := main(); {1907#true} is VALID [2018-11-23 11:58:21,899 INFO L273 TraceCheckUtils]: 5: Hoare triple {1907#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {1907#true} is VALID [2018-11-23 11:58:21,899 INFO L273 TraceCheckUtils]: 6: Hoare triple {1907#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1907#true} is VALID [2018-11-23 11:58:21,905 INFO L273 TraceCheckUtils]: 7: Hoare triple {1907#true} ~i~0 := 2; {1909#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:21,906 INFO L273 TraceCheckUtils]: 8: Hoare triple {1909#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1909#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:21,907 INFO L273 TraceCheckUtils]: 9: Hoare triple {1909#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1909#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:21,907 INFO L273 TraceCheckUtils]: 10: Hoare triple {1909#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1910#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:21,910 INFO L273 TraceCheckUtils]: 11: Hoare triple {1910#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1910#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:21,911 INFO L273 TraceCheckUtils]: 12: Hoare triple {1910#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1910#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:21,912 INFO L273 TraceCheckUtils]: 13: Hoare triple {1910#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1911#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:21,912 INFO L273 TraceCheckUtils]: 14: Hoare triple {1911#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1911#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:21,913 INFO L273 TraceCheckUtils]: 15: Hoare triple {1911#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1911#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:21,913 INFO L273 TraceCheckUtils]: 16: Hoare triple {1911#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1912#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:21,914 INFO L273 TraceCheckUtils]: 17: Hoare triple {1912#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1912#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:21,914 INFO L273 TraceCheckUtils]: 18: Hoare triple {1912#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1912#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:21,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {1912#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1913#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:21,916 INFO L273 TraceCheckUtils]: 20: Hoare triple {1913#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1913#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:21,917 INFO L273 TraceCheckUtils]: 21: Hoare triple {1913#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1913#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:21,918 INFO L273 TraceCheckUtils]: 22: Hoare triple {1913#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1914#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:21,919 INFO L273 TraceCheckUtils]: 23: Hoare triple {1914#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1914#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:21,920 INFO L273 TraceCheckUtils]: 24: Hoare triple {1914#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1914#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:21,921 INFO L273 TraceCheckUtils]: 25: Hoare triple {1914#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1915#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:21,921 INFO L273 TraceCheckUtils]: 26: Hoare triple {1915#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1908#false} is VALID [2018-11-23 11:58:21,921 INFO L273 TraceCheckUtils]: 27: Hoare triple {1908#false} havoc ~x~0;~x~0 := 0; {1908#false} is VALID [2018-11-23 11:58:21,922 INFO L273 TraceCheckUtils]: 28: Hoare triple {1908#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {1908#false} is VALID [2018-11-23 11:58:21,922 INFO L256 TraceCheckUtils]: 29: Hoare triple {1908#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {1908#false} is VALID [2018-11-23 11:58:21,922 INFO L273 TraceCheckUtils]: 30: Hoare triple {1908#false} ~cond := #in~cond; {1908#false} is VALID [2018-11-23 11:58:21,922 INFO L273 TraceCheckUtils]: 31: Hoare triple {1908#false} assume 0 == ~cond; {1908#false} is VALID [2018-11-23 11:58:21,923 INFO L273 TraceCheckUtils]: 32: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2018-11-23 11:58:21,925 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:21,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:21,926 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-23 11:58:21,935 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:58:22,041 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2018-11-23 11:58:22,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:22,067 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:22,441 INFO L256 TraceCheckUtils]: 0: Hoare triple {1907#true} call ULTIMATE.init(); {1907#true} is VALID [2018-11-23 11:58:22,442 INFO L273 TraceCheckUtils]: 1: Hoare triple {1907#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1907#true} is VALID [2018-11-23 11:58:22,442 INFO L273 TraceCheckUtils]: 2: Hoare triple {1907#true} assume true; {1907#true} is VALID [2018-11-23 11:58:22,443 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1907#true} {1907#true} #88#return; {1907#true} is VALID [2018-11-23 11:58:22,443 INFO L256 TraceCheckUtils]: 4: Hoare triple {1907#true} call #t~ret13 := main(); {1907#true} is VALID [2018-11-23 11:58:22,443 INFO L273 TraceCheckUtils]: 5: Hoare triple {1907#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {1907#true} is VALID [2018-11-23 11:58:22,443 INFO L273 TraceCheckUtils]: 6: Hoare triple {1907#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1907#true} is VALID [2018-11-23 11:58:22,444 INFO L273 TraceCheckUtils]: 7: Hoare triple {1907#true} ~i~0 := 2; {1909#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:22,446 INFO L273 TraceCheckUtils]: 8: Hoare triple {1909#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1909#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:22,446 INFO L273 TraceCheckUtils]: 9: Hoare triple {1909#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1909#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:22,447 INFO L273 TraceCheckUtils]: 10: Hoare triple {1909#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1910#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:22,448 INFO L273 TraceCheckUtils]: 11: Hoare triple {1910#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1910#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:22,448 INFO L273 TraceCheckUtils]: 12: Hoare triple {1910#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1910#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:22,449 INFO L273 TraceCheckUtils]: 13: Hoare triple {1910#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1911#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:22,450 INFO L273 TraceCheckUtils]: 14: Hoare triple {1911#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1911#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:22,450 INFO L273 TraceCheckUtils]: 15: Hoare triple {1911#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1911#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:22,451 INFO L273 TraceCheckUtils]: 16: Hoare triple {1911#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1912#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:22,452 INFO L273 TraceCheckUtils]: 17: Hoare triple {1912#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1912#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:22,453 INFO L273 TraceCheckUtils]: 18: Hoare triple {1912#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1912#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:22,454 INFO L273 TraceCheckUtils]: 19: Hoare triple {1912#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1913#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:22,454 INFO L273 TraceCheckUtils]: 20: Hoare triple {1913#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1913#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:22,455 INFO L273 TraceCheckUtils]: 21: Hoare triple {1913#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1913#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:22,456 INFO L273 TraceCheckUtils]: 22: Hoare triple {1913#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1914#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:22,457 INFO L273 TraceCheckUtils]: 23: Hoare triple {1914#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {1914#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:22,457 INFO L273 TraceCheckUtils]: 24: Hoare triple {1914#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {1914#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:22,458 INFO L273 TraceCheckUtils]: 25: Hoare triple {1914#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {1915#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:22,459 INFO L273 TraceCheckUtils]: 26: Hoare triple {1915#(<= main_~i~0 8)} assume !(~i~0 < 100000); {1908#false} is VALID [2018-11-23 11:58:22,460 INFO L273 TraceCheckUtils]: 27: Hoare triple {1908#false} havoc ~x~0;~x~0 := 0; {1908#false} is VALID [2018-11-23 11:58:22,460 INFO L273 TraceCheckUtils]: 28: Hoare triple {1908#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {1908#false} is VALID [2018-11-23 11:58:22,460 INFO L256 TraceCheckUtils]: 29: Hoare triple {1908#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {1908#false} is VALID [2018-11-23 11:58:22,461 INFO L273 TraceCheckUtils]: 30: Hoare triple {1908#false} ~cond := #in~cond; {1908#false} is VALID [2018-11-23 11:58:22,461 INFO L273 TraceCheckUtils]: 31: Hoare triple {1908#false} assume 0 == ~cond; {1908#false} is VALID [2018-11-23 11:58:22,461 INFO L273 TraceCheckUtils]: 32: Hoare triple {1908#false} assume !false; {1908#false} is VALID [2018-11-23 11:58:22,463 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:22,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:22,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-11-23 11:58:22,483 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-23 11:58:22,484 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:22,484 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2018-11-23 11:58:22,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:22,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 11:58:22,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 11:58:22,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:58:22,540 INFO L87 Difference]: Start difference. First operand 50 states and 67 transitions. Second operand 9 states. [2018-11-23 11:58:23,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:23,392 INFO L93 Difference]: Finished difference Result 74 states and 99 transitions. [2018-11-23 11:58:23,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 11:58:23,392 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2018-11-23 11:58:23,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:23,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:58:23,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2018-11-23 11:58:23,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-23 11:58:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 99 transitions. [2018-11-23 11:58:23,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 99 transitions. [2018-11-23 11:58:23,507 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:23,509 INFO L225 Difference]: With dead ends: 74 [2018-11-23 11:58:23,509 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 11:58:23,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-11-23 11:58:23,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 11:58:23,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2018-11-23 11:58:23,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:23,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand 54 states. [2018-11-23 11:58:23,529 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 54 states. [2018-11-23 11:58:23,529 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 54 states. [2018-11-23 11:58:23,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:23,531 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2018-11-23 11:58:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2018-11-23 11:58:23,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:23,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:23,532 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 57 states. [2018-11-23 11:58:23,532 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 57 states. [2018-11-23 11:58:23,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:23,534 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2018-11-23 11:58:23,534 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 78 transitions. [2018-11-23 11:58:23,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:23,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:23,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:23,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:23,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 11:58:23,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 73 transitions. [2018-11-23 11:58:23,537 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 73 transitions. Word has length 33 [2018-11-23 11:58:23,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:23,537 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 73 transitions. [2018-11-23 11:58:23,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 11:58:23,537 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 73 transitions. [2018-11-23 11:58:23,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-23 11:58:23,538 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:23,538 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:23,538 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:23,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:23,539 INFO L82 PathProgramCache]: Analyzing trace with hash -592145119, now seen corresponding path program 7 times [2018-11-23 11:58:23,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:23,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:23,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:23,540 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:23,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:23,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {2295#true} call ULTIMATE.init(); {2295#true} is VALID [2018-11-23 11:58:23,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {2295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2295#true} is VALID [2018-11-23 11:58:23,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {2295#true} assume true; {2295#true} is VALID [2018-11-23 11:58:23,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2295#true} {2295#true} #88#return; {2295#true} is VALID [2018-11-23 11:58:23,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {2295#true} call #t~ret13 := main(); {2295#true} is VALID [2018-11-23 11:58:23,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {2295#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {2295#true} is VALID [2018-11-23 11:58:23,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {2295#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {2295#true} is VALID [2018-11-23 11:58:23,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {2295#true} ~i~0 := 2; {2297#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:23,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {2297#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2297#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:23,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {2297#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2297#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:23,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {2297#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2298#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:23,787 INFO L273 TraceCheckUtils]: 11: Hoare triple {2298#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2298#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:23,787 INFO L273 TraceCheckUtils]: 12: Hoare triple {2298#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2298#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:23,788 INFO L273 TraceCheckUtils]: 13: Hoare triple {2298#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2299#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:23,788 INFO L273 TraceCheckUtils]: 14: Hoare triple {2299#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2299#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:23,789 INFO L273 TraceCheckUtils]: 15: Hoare triple {2299#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2299#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:23,789 INFO L273 TraceCheckUtils]: 16: Hoare triple {2299#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2300#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:23,790 INFO L273 TraceCheckUtils]: 17: Hoare triple {2300#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2300#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:23,790 INFO L273 TraceCheckUtils]: 18: Hoare triple {2300#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2300#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:23,790 INFO L273 TraceCheckUtils]: 19: Hoare triple {2300#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2301#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:23,791 INFO L273 TraceCheckUtils]: 20: Hoare triple {2301#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2301#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:23,791 INFO L273 TraceCheckUtils]: 21: Hoare triple {2301#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2301#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:23,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {2301#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2302#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:23,792 INFO L273 TraceCheckUtils]: 23: Hoare triple {2302#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2302#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:23,801 INFO L273 TraceCheckUtils]: 24: Hoare triple {2302#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2302#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:23,802 INFO L273 TraceCheckUtils]: 25: Hoare triple {2302#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2303#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:23,803 INFO L273 TraceCheckUtils]: 26: Hoare triple {2303#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2303#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:23,803 INFO L273 TraceCheckUtils]: 27: Hoare triple {2303#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2303#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:23,803 INFO L273 TraceCheckUtils]: 28: Hoare triple {2303#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2304#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:23,804 INFO L273 TraceCheckUtils]: 29: Hoare triple {2304#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2296#false} is VALID [2018-11-23 11:58:23,804 INFO L273 TraceCheckUtils]: 30: Hoare triple {2296#false} havoc ~x~0;~x~0 := 0; {2296#false} is VALID [2018-11-23 11:58:23,804 INFO L273 TraceCheckUtils]: 31: Hoare triple {2296#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {2296#false} is VALID [2018-11-23 11:58:23,804 INFO L256 TraceCheckUtils]: 32: Hoare triple {2296#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {2296#false} is VALID [2018-11-23 11:58:23,804 INFO L273 TraceCheckUtils]: 33: Hoare triple {2296#false} ~cond := #in~cond; {2296#false} is VALID [2018-11-23 11:58:23,805 INFO L273 TraceCheckUtils]: 34: Hoare triple {2296#false} assume 0 == ~cond; {2296#false} is VALID [2018-11-23 11:58:23,805 INFO L273 TraceCheckUtils]: 35: Hoare triple {2296#false} assume !false; {2296#false} is VALID [2018-11-23 11:58:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:23,806 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:23,806 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-23 11:58:23,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:23,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:23,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:23,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:24,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {2295#true} call ULTIMATE.init(); {2295#true} is VALID [2018-11-23 11:58:24,189 INFO L273 TraceCheckUtils]: 1: Hoare triple {2295#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2295#true} is VALID [2018-11-23 11:58:24,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {2295#true} assume true; {2295#true} is VALID [2018-11-23 11:58:24,190 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2295#true} {2295#true} #88#return; {2295#true} is VALID [2018-11-23 11:58:24,190 INFO L256 TraceCheckUtils]: 4: Hoare triple {2295#true} call #t~ret13 := main(); {2295#true} is VALID [2018-11-23 11:58:24,190 INFO L273 TraceCheckUtils]: 5: Hoare triple {2295#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {2295#true} is VALID [2018-11-23 11:58:24,191 INFO L273 TraceCheckUtils]: 6: Hoare triple {2295#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {2295#true} is VALID [2018-11-23 11:58:24,193 INFO L273 TraceCheckUtils]: 7: Hoare triple {2295#true} ~i~0 := 2; {2297#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:24,193 INFO L273 TraceCheckUtils]: 8: Hoare triple {2297#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2297#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:24,194 INFO L273 TraceCheckUtils]: 9: Hoare triple {2297#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2297#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:24,195 INFO L273 TraceCheckUtils]: 10: Hoare triple {2297#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2298#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:24,195 INFO L273 TraceCheckUtils]: 11: Hoare triple {2298#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2298#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:24,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {2298#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2298#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:24,199 INFO L273 TraceCheckUtils]: 13: Hoare triple {2298#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2299#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:24,199 INFO L273 TraceCheckUtils]: 14: Hoare triple {2299#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2299#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:24,200 INFO L273 TraceCheckUtils]: 15: Hoare triple {2299#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2299#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:24,200 INFO L273 TraceCheckUtils]: 16: Hoare triple {2299#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2300#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:24,201 INFO L273 TraceCheckUtils]: 17: Hoare triple {2300#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2300#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:24,201 INFO L273 TraceCheckUtils]: 18: Hoare triple {2300#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2300#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:24,201 INFO L273 TraceCheckUtils]: 19: Hoare triple {2300#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2301#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:24,202 INFO L273 TraceCheckUtils]: 20: Hoare triple {2301#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2301#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:24,202 INFO L273 TraceCheckUtils]: 21: Hoare triple {2301#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2301#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:24,203 INFO L273 TraceCheckUtils]: 22: Hoare triple {2301#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2302#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:24,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {2302#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2302#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:24,204 INFO L273 TraceCheckUtils]: 24: Hoare triple {2302#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2302#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:24,205 INFO L273 TraceCheckUtils]: 25: Hoare triple {2302#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2303#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:24,205 INFO L273 TraceCheckUtils]: 26: Hoare triple {2303#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2303#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:24,206 INFO L273 TraceCheckUtils]: 27: Hoare triple {2303#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2303#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:24,207 INFO L273 TraceCheckUtils]: 28: Hoare triple {2303#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2304#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:24,207 INFO L273 TraceCheckUtils]: 29: Hoare triple {2304#(<= main_~i~0 9)} assume !(~i~0 < 100000); {2296#false} is VALID [2018-11-23 11:58:24,208 INFO L273 TraceCheckUtils]: 30: Hoare triple {2296#false} havoc ~x~0;~x~0 := 0; {2296#false} is VALID [2018-11-23 11:58:24,208 INFO L273 TraceCheckUtils]: 31: Hoare triple {2296#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {2296#false} is VALID [2018-11-23 11:58:24,208 INFO L256 TraceCheckUtils]: 32: Hoare triple {2296#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {2296#false} is VALID [2018-11-23 11:58:24,208 INFO L273 TraceCheckUtils]: 33: Hoare triple {2296#false} ~cond := #in~cond; {2296#false} is VALID [2018-11-23 11:58:24,209 INFO L273 TraceCheckUtils]: 34: Hoare triple {2296#false} assume 0 == ~cond; {2296#false} is VALID [2018-11-23 11:58:24,209 INFO L273 TraceCheckUtils]: 35: Hoare triple {2296#false} assume !false; {2296#false} is VALID [2018-11-23 11:58:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:24,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:24,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 11:58:24,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-11-23 11:58:24,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:24,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 11:58:24,264 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-23 11:58:24,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 11:58:24,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 11:58:24,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:58:24,265 INFO L87 Difference]: Start difference. First operand 54 states and 73 transitions. Second operand 10 states. [2018-11-23 11:58:24,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:24,468 INFO L93 Difference]: Finished difference Result 78 states and 105 transitions. [2018-11-23 11:58:24,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 11:58:24,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 36 [2018-11-23 11:58:24,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:58:24,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2018-11-23 11:58:24,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 11:58:24,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 105 transitions. [2018-11-23 11:58:24,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 105 transitions. [2018-11-23 11:58:24,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:24,629 INFO L225 Difference]: With dead ends: 78 [2018-11-23 11:58:24,629 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 11:58:24,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:58:24,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 11:58:24,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2018-11-23 11:58:24,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:24,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 58 states. [2018-11-23 11:58:24,651 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 58 states. [2018-11-23 11:58:24,652 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 58 states. [2018-11-23 11:58:24,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:24,656 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2018-11-23 11:58:24,656 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2018-11-23 11:58:24,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:24,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:24,656 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 61 states. [2018-11-23 11:58:24,656 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 61 states. [2018-11-23 11:58:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:24,659 INFO L93 Difference]: Finished difference Result 61 states and 84 transitions. [2018-11-23 11:58:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 84 transitions. [2018-11-23 11:58:24,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:24,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:24,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:24,660 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 11:58:24,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 79 transitions. [2018-11-23 11:58:24,661 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 79 transitions. Word has length 36 [2018-11-23 11:58:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:24,662 INFO L480 AbstractCegarLoop]: Abstraction has 58 states and 79 transitions. [2018-11-23 11:58:24,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 11:58:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 79 transitions. [2018-11-23 11:58:24,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 11:58:24,662 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:24,663 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:24,663 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:24,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:24,663 INFO L82 PathProgramCache]: Analyzing trace with hash -514773540, now seen corresponding path program 8 times [2018-11-23 11:58:24,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:24,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:24,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:24,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:24,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:24,825 INFO L256 TraceCheckUtils]: 0: Hoare triple {2711#true} call ULTIMATE.init(); {2711#true} is VALID [2018-11-23 11:58:24,826 INFO L273 TraceCheckUtils]: 1: Hoare triple {2711#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2711#true} is VALID [2018-11-23 11:58:24,826 INFO L273 TraceCheckUtils]: 2: Hoare triple {2711#true} assume true; {2711#true} is VALID [2018-11-23 11:58:24,826 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2711#true} {2711#true} #88#return; {2711#true} is VALID [2018-11-23 11:58:24,826 INFO L256 TraceCheckUtils]: 4: Hoare triple {2711#true} call #t~ret13 := main(); {2711#true} is VALID [2018-11-23 11:58:24,827 INFO L273 TraceCheckUtils]: 5: Hoare triple {2711#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {2711#true} is VALID [2018-11-23 11:58:24,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {2711#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {2711#true} is VALID [2018-11-23 11:58:24,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {2711#true} ~i~0 := 2; {2713#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:24,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {2713#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2713#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:24,828 INFO L273 TraceCheckUtils]: 9: Hoare triple {2713#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2713#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:24,829 INFO L273 TraceCheckUtils]: 10: Hoare triple {2713#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2714#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:24,829 INFO L273 TraceCheckUtils]: 11: Hoare triple {2714#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2714#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:24,829 INFO L273 TraceCheckUtils]: 12: Hoare triple {2714#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2714#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:24,830 INFO L273 TraceCheckUtils]: 13: Hoare triple {2714#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2715#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:24,830 INFO L273 TraceCheckUtils]: 14: Hoare triple {2715#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2715#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:24,831 INFO L273 TraceCheckUtils]: 15: Hoare triple {2715#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2715#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:24,831 INFO L273 TraceCheckUtils]: 16: Hoare triple {2715#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2716#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:24,832 INFO L273 TraceCheckUtils]: 17: Hoare triple {2716#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2716#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:24,832 INFO L273 TraceCheckUtils]: 18: Hoare triple {2716#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2716#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:24,833 INFO L273 TraceCheckUtils]: 19: Hoare triple {2716#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2717#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:24,834 INFO L273 TraceCheckUtils]: 20: Hoare triple {2717#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2717#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:24,834 INFO L273 TraceCheckUtils]: 21: Hoare triple {2717#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2717#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:24,835 INFO L273 TraceCheckUtils]: 22: Hoare triple {2717#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2718#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:24,836 INFO L273 TraceCheckUtils]: 23: Hoare triple {2718#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2718#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:24,836 INFO L273 TraceCheckUtils]: 24: Hoare triple {2718#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2718#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:24,837 INFO L273 TraceCheckUtils]: 25: Hoare triple {2718#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2719#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:24,838 INFO L273 TraceCheckUtils]: 26: Hoare triple {2719#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2719#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:24,838 INFO L273 TraceCheckUtils]: 27: Hoare triple {2719#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2719#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:24,839 INFO L273 TraceCheckUtils]: 28: Hoare triple {2719#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2720#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:24,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {2720#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2720#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:24,840 INFO L273 TraceCheckUtils]: 30: Hoare triple {2720#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2720#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:24,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {2720#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2721#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:24,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {2721#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2712#false} is VALID [2018-11-23 11:58:24,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {2712#false} havoc ~x~0;~x~0 := 0; {2712#false} is VALID [2018-11-23 11:58:24,842 INFO L273 TraceCheckUtils]: 34: Hoare triple {2712#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {2712#false} is VALID [2018-11-23 11:58:24,843 INFO L256 TraceCheckUtils]: 35: Hoare triple {2712#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {2712#false} is VALID [2018-11-23 11:58:24,843 INFO L273 TraceCheckUtils]: 36: Hoare triple {2712#false} ~cond := #in~cond; {2712#false} is VALID [2018-11-23 11:58:24,843 INFO L273 TraceCheckUtils]: 37: Hoare triple {2712#false} assume 0 == ~cond; {2712#false} is VALID [2018-11-23 11:58:24,843 INFO L273 TraceCheckUtils]: 38: Hoare triple {2712#false} assume !false; {2712#false} is VALID [2018-11-23 11:58:24,845 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:24,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:24,846 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-23 11:58:24,857 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:24,885 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:24,885 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:24,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:24,919 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:25,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {2711#true} call ULTIMATE.init(); {2711#true} is VALID [2018-11-23 11:58:25,041 INFO L273 TraceCheckUtils]: 1: Hoare triple {2711#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {2711#true} is VALID [2018-11-23 11:58:25,041 INFO L273 TraceCheckUtils]: 2: Hoare triple {2711#true} assume true; {2711#true} is VALID [2018-11-23 11:58:25,041 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2711#true} {2711#true} #88#return; {2711#true} is VALID [2018-11-23 11:58:25,041 INFO L256 TraceCheckUtils]: 4: Hoare triple {2711#true} call #t~ret13 := main(); {2711#true} is VALID [2018-11-23 11:58:25,041 INFO L273 TraceCheckUtils]: 5: Hoare triple {2711#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {2711#true} is VALID [2018-11-23 11:58:25,041 INFO L273 TraceCheckUtils]: 6: Hoare triple {2711#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {2711#true} is VALID [2018-11-23 11:58:25,045 INFO L273 TraceCheckUtils]: 7: Hoare triple {2711#true} ~i~0 := 2; {2713#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:25,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {2713#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2713#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:25,048 INFO L273 TraceCheckUtils]: 9: Hoare triple {2713#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2713#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:25,048 INFO L273 TraceCheckUtils]: 10: Hoare triple {2713#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2714#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:25,049 INFO L273 TraceCheckUtils]: 11: Hoare triple {2714#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2714#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:25,049 INFO L273 TraceCheckUtils]: 12: Hoare triple {2714#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2714#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:25,050 INFO L273 TraceCheckUtils]: 13: Hoare triple {2714#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2715#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:25,050 INFO L273 TraceCheckUtils]: 14: Hoare triple {2715#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2715#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:25,050 INFO L273 TraceCheckUtils]: 15: Hoare triple {2715#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2715#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:25,051 INFO L273 TraceCheckUtils]: 16: Hoare triple {2715#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2716#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:25,051 INFO L273 TraceCheckUtils]: 17: Hoare triple {2716#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2716#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:25,051 INFO L273 TraceCheckUtils]: 18: Hoare triple {2716#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2716#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:25,052 INFO L273 TraceCheckUtils]: 19: Hoare triple {2716#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2717#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:25,053 INFO L273 TraceCheckUtils]: 20: Hoare triple {2717#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2717#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:25,053 INFO L273 TraceCheckUtils]: 21: Hoare triple {2717#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2717#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:25,054 INFO L273 TraceCheckUtils]: 22: Hoare triple {2717#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2718#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:25,055 INFO L273 TraceCheckUtils]: 23: Hoare triple {2718#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2718#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:25,055 INFO L273 TraceCheckUtils]: 24: Hoare triple {2718#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2718#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:25,056 INFO L273 TraceCheckUtils]: 25: Hoare triple {2718#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2719#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:25,057 INFO L273 TraceCheckUtils]: 26: Hoare triple {2719#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2719#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:25,057 INFO L273 TraceCheckUtils]: 27: Hoare triple {2719#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2719#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:25,058 INFO L273 TraceCheckUtils]: 28: Hoare triple {2719#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2720#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:25,059 INFO L273 TraceCheckUtils]: 29: Hoare triple {2720#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {2720#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:25,059 INFO L273 TraceCheckUtils]: 30: Hoare triple {2720#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {2720#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:25,060 INFO L273 TraceCheckUtils]: 31: Hoare triple {2720#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {2721#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:25,061 INFO L273 TraceCheckUtils]: 32: Hoare triple {2721#(<= main_~i~0 10)} assume !(~i~0 < 100000); {2712#false} is VALID [2018-11-23 11:58:25,061 INFO L273 TraceCheckUtils]: 33: Hoare triple {2712#false} havoc ~x~0;~x~0 := 0; {2712#false} is VALID [2018-11-23 11:58:25,061 INFO L273 TraceCheckUtils]: 34: Hoare triple {2712#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {2712#false} is VALID [2018-11-23 11:58:25,061 INFO L256 TraceCheckUtils]: 35: Hoare triple {2712#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {2712#false} is VALID [2018-11-23 11:58:25,062 INFO L273 TraceCheckUtils]: 36: Hoare triple {2712#false} ~cond := #in~cond; {2712#false} is VALID [2018-11-23 11:58:25,062 INFO L273 TraceCheckUtils]: 37: Hoare triple {2712#false} assume 0 == ~cond; {2712#false} is VALID [2018-11-23 11:58:25,062 INFO L273 TraceCheckUtils]: 38: Hoare triple {2712#false} assume !false; {2712#false} is VALID [2018-11-23 11:58:25,064 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:25,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:25,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2018-11-23 11:58:25,085 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-11-23 11:58:25,085 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:25,086 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-23 11:58:25,125 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:25,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 11:58:25,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 11:58:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:58:25,126 INFO L87 Difference]: Start difference. First operand 58 states and 79 transitions. Second operand 11 states. [2018-11-23 11:58:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:25,360 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2018-11-23 11:58:25,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 11:58:25,361 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2018-11-23 11:58:25,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:58:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2018-11-23 11:58:25,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 11:58:25,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2018-11-23 11:58:25,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 111 transitions. [2018-11-23 11:58:25,534 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:25,536 INFO L225 Difference]: With dead ends: 82 [2018-11-23 11:58:25,536 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 11:58:25,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-11-23 11:58:25,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 11:58:25,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-11-23 11:58:25,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:25,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 62 states. [2018-11-23 11:58:25,569 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 62 states. [2018-11-23 11:58:25,569 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 62 states. [2018-11-23 11:58:25,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:25,571 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2018-11-23 11:58:25,571 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2018-11-23 11:58:25,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:25,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:25,572 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 65 states. [2018-11-23 11:58:25,572 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 65 states. [2018-11-23 11:58:25,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:25,573 INFO L93 Difference]: Finished difference Result 65 states and 90 transitions. [2018-11-23 11:58:25,573 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 90 transitions. [2018-11-23 11:58:25,574 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:25,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:25,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:25,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:25,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-11-23 11:58:25,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 85 transitions. [2018-11-23 11:58:25,576 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 85 transitions. Word has length 39 [2018-11-23 11:58:25,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:25,576 INFO L480 AbstractCegarLoop]: Abstraction has 62 states and 85 transitions. [2018-11-23 11:58:25,577 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 11:58:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 85 transitions. [2018-11-23 11:58:25,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 11:58:25,577 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:25,578 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:25,578 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:25,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:25,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1935501503, now seen corresponding path program 9 times [2018-11-23 11:58:25,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:25,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:25,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:25,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:25,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:25,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:26,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {3155#true} call ULTIMATE.init(); {3155#true} is VALID [2018-11-23 11:58:26,006 INFO L273 TraceCheckUtils]: 1: Hoare triple {3155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3155#true} is VALID [2018-11-23 11:58:26,006 INFO L273 TraceCheckUtils]: 2: Hoare triple {3155#true} assume true; {3155#true} is VALID [2018-11-23 11:58:26,006 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3155#true} {3155#true} #88#return; {3155#true} is VALID [2018-11-23 11:58:26,007 INFO L256 TraceCheckUtils]: 4: Hoare triple {3155#true} call #t~ret13 := main(); {3155#true} is VALID [2018-11-23 11:58:26,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {3155#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {3155#true} is VALID [2018-11-23 11:58:26,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {3155#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {3155#true} is VALID [2018-11-23 11:58:26,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {3155#true} ~i~0 := 2; {3157#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:26,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {3157#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3157#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:26,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {3157#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3157#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:26,010 INFO L273 TraceCheckUtils]: 10: Hoare triple {3157#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3158#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:26,010 INFO L273 TraceCheckUtils]: 11: Hoare triple {3158#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3158#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:26,011 INFO L273 TraceCheckUtils]: 12: Hoare triple {3158#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3158#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:26,012 INFO L273 TraceCheckUtils]: 13: Hoare triple {3158#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3159#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:26,012 INFO L273 TraceCheckUtils]: 14: Hoare triple {3159#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3159#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:26,013 INFO L273 TraceCheckUtils]: 15: Hoare triple {3159#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3159#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:26,014 INFO L273 TraceCheckUtils]: 16: Hoare triple {3159#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3160#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:26,014 INFO L273 TraceCheckUtils]: 17: Hoare triple {3160#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3160#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:26,015 INFO L273 TraceCheckUtils]: 18: Hoare triple {3160#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3160#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:26,016 INFO L273 TraceCheckUtils]: 19: Hoare triple {3160#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3161#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:26,016 INFO L273 TraceCheckUtils]: 20: Hoare triple {3161#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3161#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:26,017 INFO L273 TraceCheckUtils]: 21: Hoare triple {3161#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3161#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:26,018 INFO L273 TraceCheckUtils]: 22: Hoare triple {3161#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3162#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:26,018 INFO L273 TraceCheckUtils]: 23: Hoare triple {3162#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3162#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:26,019 INFO L273 TraceCheckUtils]: 24: Hoare triple {3162#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3162#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:26,020 INFO L273 TraceCheckUtils]: 25: Hoare triple {3162#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3163#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:26,035 INFO L273 TraceCheckUtils]: 26: Hoare triple {3163#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3163#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:26,036 INFO L273 TraceCheckUtils]: 27: Hoare triple {3163#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3163#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:26,037 INFO L273 TraceCheckUtils]: 28: Hoare triple {3163#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3164#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:26,037 INFO L273 TraceCheckUtils]: 29: Hoare triple {3164#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3164#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:26,037 INFO L273 TraceCheckUtils]: 30: Hoare triple {3164#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3164#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:26,038 INFO L273 TraceCheckUtils]: 31: Hoare triple {3164#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3165#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:26,038 INFO L273 TraceCheckUtils]: 32: Hoare triple {3165#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3165#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:26,039 INFO L273 TraceCheckUtils]: 33: Hoare triple {3165#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3165#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:26,039 INFO L273 TraceCheckUtils]: 34: Hoare triple {3165#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3166#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:26,039 INFO L273 TraceCheckUtils]: 35: Hoare triple {3166#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3156#false} is VALID [2018-11-23 11:58:26,040 INFO L273 TraceCheckUtils]: 36: Hoare triple {3156#false} havoc ~x~0;~x~0 := 0; {3156#false} is VALID [2018-11-23 11:58:26,040 INFO L273 TraceCheckUtils]: 37: Hoare triple {3156#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {3156#false} is VALID [2018-11-23 11:58:26,040 INFO L256 TraceCheckUtils]: 38: Hoare triple {3156#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {3156#false} is VALID [2018-11-23 11:58:26,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {3156#false} ~cond := #in~cond; {3156#false} is VALID [2018-11-23 11:58:26,040 INFO L273 TraceCheckUtils]: 40: Hoare triple {3156#false} assume 0 == ~cond; {3156#false} is VALID [2018-11-23 11:58:26,040 INFO L273 TraceCheckUtils]: 41: Hoare triple {3156#false} assume !false; {3156#false} is VALID [2018-11-23 11:58:26,042 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:26,043 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:26,043 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-23 11:58:26,052 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:26,080 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2018-11-23 11:58:26,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:26,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:26,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {3155#true} call ULTIMATE.init(); {3155#true} is VALID [2018-11-23 11:58:26,198 INFO L273 TraceCheckUtils]: 1: Hoare triple {3155#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3155#true} is VALID [2018-11-23 11:58:26,198 INFO L273 TraceCheckUtils]: 2: Hoare triple {3155#true} assume true; {3155#true} is VALID [2018-11-23 11:58:26,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3155#true} {3155#true} #88#return; {3155#true} is VALID [2018-11-23 11:58:26,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {3155#true} call #t~ret13 := main(); {3155#true} is VALID [2018-11-23 11:58:26,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {3155#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {3155#true} is VALID [2018-11-23 11:58:26,199 INFO L273 TraceCheckUtils]: 6: Hoare triple {3155#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {3155#true} is VALID [2018-11-23 11:58:26,200 INFO L273 TraceCheckUtils]: 7: Hoare triple {3155#true} ~i~0 := 2; {3157#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:26,200 INFO L273 TraceCheckUtils]: 8: Hoare triple {3157#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3157#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:26,200 INFO L273 TraceCheckUtils]: 9: Hoare triple {3157#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3157#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:26,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {3157#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3158#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:26,201 INFO L273 TraceCheckUtils]: 11: Hoare triple {3158#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3158#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:26,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {3158#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3158#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:26,202 INFO L273 TraceCheckUtils]: 13: Hoare triple {3158#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3159#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:26,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {3159#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3159#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:26,203 INFO L273 TraceCheckUtils]: 15: Hoare triple {3159#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3159#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:26,203 INFO L273 TraceCheckUtils]: 16: Hoare triple {3159#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3160#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:26,204 INFO L273 TraceCheckUtils]: 17: Hoare triple {3160#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3160#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:26,205 INFO L273 TraceCheckUtils]: 18: Hoare triple {3160#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3160#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:26,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {3160#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3161#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:26,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {3161#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3161#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:26,206 INFO L273 TraceCheckUtils]: 21: Hoare triple {3161#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3161#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:26,207 INFO L273 TraceCheckUtils]: 22: Hoare triple {3161#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3162#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:26,208 INFO L273 TraceCheckUtils]: 23: Hoare triple {3162#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3162#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:26,208 INFO L273 TraceCheckUtils]: 24: Hoare triple {3162#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3162#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:26,209 INFO L273 TraceCheckUtils]: 25: Hoare triple {3162#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3163#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:26,210 INFO L273 TraceCheckUtils]: 26: Hoare triple {3163#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3163#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:26,211 INFO L273 TraceCheckUtils]: 27: Hoare triple {3163#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3163#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:26,214 INFO L273 TraceCheckUtils]: 28: Hoare triple {3163#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3164#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:26,215 INFO L273 TraceCheckUtils]: 29: Hoare triple {3164#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3164#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:26,215 INFO L273 TraceCheckUtils]: 30: Hoare triple {3164#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3164#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:26,216 INFO L273 TraceCheckUtils]: 31: Hoare triple {3164#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3165#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:26,216 INFO L273 TraceCheckUtils]: 32: Hoare triple {3165#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3165#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:26,216 INFO L273 TraceCheckUtils]: 33: Hoare triple {3165#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3165#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:26,217 INFO L273 TraceCheckUtils]: 34: Hoare triple {3165#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3166#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:26,218 INFO L273 TraceCheckUtils]: 35: Hoare triple {3166#(<= main_~i~0 11)} assume !(~i~0 < 100000); {3156#false} is VALID [2018-11-23 11:58:26,218 INFO L273 TraceCheckUtils]: 36: Hoare triple {3156#false} havoc ~x~0;~x~0 := 0; {3156#false} is VALID [2018-11-23 11:58:26,218 INFO L273 TraceCheckUtils]: 37: Hoare triple {3156#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {3156#false} is VALID [2018-11-23 11:58:26,219 INFO L256 TraceCheckUtils]: 38: Hoare triple {3156#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {3156#false} is VALID [2018-11-23 11:58:26,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {3156#false} ~cond := #in~cond; {3156#false} is VALID [2018-11-23 11:58:26,219 INFO L273 TraceCheckUtils]: 40: Hoare triple {3156#false} assume 0 == ~cond; {3156#false} is VALID [2018-11-23 11:58:26,220 INFO L273 TraceCheckUtils]: 41: Hoare triple {3156#false} assume !false; {3156#false} is VALID [2018-11-23 11:58:26,223 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:26,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:26,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 12 [2018-11-23 11:58:26,243 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-23 11:58:26,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:26,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 11:58:26,288 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-23 11:58:26,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 11:58:26,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 11:58:26,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:58:26,289 INFO L87 Difference]: Start difference. First operand 62 states and 85 transitions. Second operand 12 states. [2018-11-23 11:58:26,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:26,727 INFO L93 Difference]: Finished difference Result 86 states and 117 transitions. [2018-11-23 11:58:26,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 11:58:26,727 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 42 [2018-11-23 11:58:26,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:26,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2018-11-23 11:58:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 11:58:26,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2018-11-23 11:58:26,731 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 117 transitions. [2018-11-23 11:58:26,897 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-23 11:58:26,899 INFO L225 Difference]: With dead ends: 86 [2018-11-23 11:58:26,899 INFO L226 Difference]: Without dead ends: 69 [2018-11-23 11:58:26,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 11:58:26,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-11-23 11:58:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-11-23 11:58:26,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:26,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 66 states. [2018-11-23 11:58:26,935 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 66 states. [2018-11-23 11:58:26,935 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 66 states. [2018-11-23 11:58:26,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:26,937 INFO L93 Difference]: Finished difference Result 69 states and 96 transitions. [2018-11-23 11:58:26,937 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2018-11-23 11:58:26,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:26,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:26,937 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 69 states. [2018-11-23 11:58:26,938 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 69 states. [2018-11-23 11:58:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:26,939 INFO L93 Difference]: Finished difference Result 69 states and 96 transitions. [2018-11-23 11:58:26,940 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2018-11-23 11:58:26,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:26,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:26,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:26,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:26,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 11:58:26,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2018-11-23 11:58:26,942 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 42 [2018-11-23 11:58:26,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:26,942 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2018-11-23 11:58:26,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 11:58:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2018-11-23 11:58:26,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 11:58:26,943 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:26,943 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:26,944 INFO L423 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:26,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:26,944 INFO L82 PathProgramCache]: Analyzing trace with hash 60454844, now seen corresponding path program 10 times [2018-11-23 11:58:26,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:26,944 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:26,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:26,945 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:26,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:26,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:27,326 INFO L256 TraceCheckUtils]: 0: Hoare triple {3627#true} call ULTIMATE.init(); {3627#true} is VALID [2018-11-23 11:58:27,326 INFO L273 TraceCheckUtils]: 1: Hoare triple {3627#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3627#true} is VALID [2018-11-23 11:58:27,326 INFO L273 TraceCheckUtils]: 2: Hoare triple {3627#true} assume true; {3627#true} is VALID [2018-11-23 11:58:27,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3627#true} {3627#true} #88#return; {3627#true} is VALID [2018-11-23 11:58:27,327 INFO L256 TraceCheckUtils]: 4: Hoare triple {3627#true} call #t~ret13 := main(); {3627#true} is VALID [2018-11-23 11:58:27,327 INFO L273 TraceCheckUtils]: 5: Hoare triple {3627#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {3627#true} is VALID [2018-11-23 11:58:27,327 INFO L273 TraceCheckUtils]: 6: Hoare triple {3627#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {3627#true} is VALID [2018-11-23 11:58:27,328 INFO L273 TraceCheckUtils]: 7: Hoare triple {3627#true} ~i~0 := 2; {3629#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:27,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {3629#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3629#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:27,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {3629#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3629#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:27,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {3629#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3630#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:27,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {3630#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3630#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:27,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {3630#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3630#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:27,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {3630#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3631#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:27,332 INFO L273 TraceCheckUtils]: 14: Hoare triple {3631#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3631#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:27,332 INFO L273 TraceCheckUtils]: 15: Hoare triple {3631#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3631#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:27,352 INFO L273 TraceCheckUtils]: 16: Hoare triple {3631#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3632#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:27,368 INFO L273 TraceCheckUtils]: 17: Hoare triple {3632#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3632#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:27,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {3632#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3632#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:27,376 INFO L273 TraceCheckUtils]: 19: Hoare triple {3632#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3633#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:27,376 INFO L273 TraceCheckUtils]: 20: Hoare triple {3633#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3633#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:27,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {3633#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3633#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:27,377 INFO L273 TraceCheckUtils]: 22: Hoare triple {3633#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:27,377 INFO L273 TraceCheckUtils]: 23: Hoare triple {3634#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3634#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:27,378 INFO L273 TraceCheckUtils]: 24: Hoare triple {3634#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3634#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:27,378 INFO L273 TraceCheckUtils]: 25: Hoare triple {3634#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3635#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:27,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {3635#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3635#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:27,379 INFO L273 TraceCheckUtils]: 27: Hoare triple {3635#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3635#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:27,380 INFO L273 TraceCheckUtils]: 28: Hoare triple {3635#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3636#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:27,381 INFO L273 TraceCheckUtils]: 29: Hoare triple {3636#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3636#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:27,381 INFO L273 TraceCheckUtils]: 30: Hoare triple {3636#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3636#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:27,382 INFO L273 TraceCheckUtils]: 31: Hoare triple {3636#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3637#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:27,382 INFO L273 TraceCheckUtils]: 32: Hoare triple {3637#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3637#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:27,383 INFO L273 TraceCheckUtils]: 33: Hoare triple {3637#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3637#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:27,384 INFO L273 TraceCheckUtils]: 34: Hoare triple {3637#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3638#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:27,384 INFO L273 TraceCheckUtils]: 35: Hoare triple {3638#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3638#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:27,385 INFO L273 TraceCheckUtils]: 36: Hoare triple {3638#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3638#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:27,386 INFO L273 TraceCheckUtils]: 37: Hoare triple {3638#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3639#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:27,386 INFO L273 TraceCheckUtils]: 38: Hoare triple {3639#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3628#false} is VALID [2018-11-23 11:58:27,387 INFO L273 TraceCheckUtils]: 39: Hoare triple {3628#false} havoc ~x~0;~x~0 := 0; {3628#false} is VALID [2018-11-23 11:58:27,387 INFO L273 TraceCheckUtils]: 40: Hoare triple {3628#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {3628#false} is VALID [2018-11-23 11:58:27,387 INFO L256 TraceCheckUtils]: 41: Hoare triple {3628#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {3628#false} is VALID [2018-11-23 11:58:27,387 INFO L273 TraceCheckUtils]: 42: Hoare triple {3628#false} ~cond := #in~cond; {3628#false} is VALID [2018-11-23 11:58:27,388 INFO L273 TraceCheckUtils]: 43: Hoare triple {3628#false} assume 0 == ~cond; {3628#false} is VALID [2018-11-23 11:58:27,388 INFO L273 TraceCheckUtils]: 44: Hoare triple {3628#false} assume !false; {3628#false} is VALID [2018-11-23 11:58:27,390 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:27,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:27,390 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-23 11:58:27,400 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:27,424 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:27,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:27,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:27,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:27,569 INFO L256 TraceCheckUtils]: 0: Hoare triple {3627#true} call ULTIMATE.init(); {3627#true} is VALID [2018-11-23 11:58:27,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {3627#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {3627#true} is VALID [2018-11-23 11:58:27,569 INFO L273 TraceCheckUtils]: 2: Hoare triple {3627#true} assume true; {3627#true} is VALID [2018-11-23 11:58:27,569 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3627#true} {3627#true} #88#return; {3627#true} is VALID [2018-11-23 11:58:27,569 INFO L256 TraceCheckUtils]: 4: Hoare triple {3627#true} call #t~ret13 := main(); {3627#true} is VALID [2018-11-23 11:58:27,570 INFO L273 TraceCheckUtils]: 5: Hoare triple {3627#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {3627#true} is VALID [2018-11-23 11:58:27,570 INFO L273 TraceCheckUtils]: 6: Hoare triple {3627#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {3627#true} is VALID [2018-11-23 11:58:27,570 INFO L273 TraceCheckUtils]: 7: Hoare triple {3627#true} ~i~0 := 2; {3629#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:27,570 INFO L273 TraceCheckUtils]: 8: Hoare triple {3629#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3629#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:27,571 INFO L273 TraceCheckUtils]: 9: Hoare triple {3629#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3629#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:27,571 INFO L273 TraceCheckUtils]: 10: Hoare triple {3629#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3630#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:27,572 INFO L273 TraceCheckUtils]: 11: Hoare triple {3630#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3630#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:27,572 INFO L273 TraceCheckUtils]: 12: Hoare triple {3630#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3630#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:27,572 INFO L273 TraceCheckUtils]: 13: Hoare triple {3630#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3631#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:27,573 INFO L273 TraceCheckUtils]: 14: Hoare triple {3631#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3631#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:27,574 INFO L273 TraceCheckUtils]: 15: Hoare triple {3631#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3631#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:27,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {3631#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3632#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:27,575 INFO L273 TraceCheckUtils]: 17: Hoare triple {3632#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3632#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:27,576 INFO L273 TraceCheckUtils]: 18: Hoare triple {3632#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3632#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:27,576 INFO L273 TraceCheckUtils]: 19: Hoare triple {3632#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3633#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:27,577 INFO L273 TraceCheckUtils]: 20: Hoare triple {3633#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3633#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:27,577 INFO L273 TraceCheckUtils]: 21: Hoare triple {3633#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3633#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:27,578 INFO L273 TraceCheckUtils]: 22: Hoare triple {3633#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3634#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:27,579 INFO L273 TraceCheckUtils]: 23: Hoare triple {3634#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3634#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:27,579 INFO L273 TraceCheckUtils]: 24: Hoare triple {3634#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3634#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:27,580 INFO L273 TraceCheckUtils]: 25: Hoare triple {3634#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3635#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:27,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {3635#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3635#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:27,581 INFO L273 TraceCheckUtils]: 27: Hoare triple {3635#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3635#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:27,582 INFO L273 TraceCheckUtils]: 28: Hoare triple {3635#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3636#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:27,583 INFO L273 TraceCheckUtils]: 29: Hoare triple {3636#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3636#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:27,583 INFO L273 TraceCheckUtils]: 30: Hoare triple {3636#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3636#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:27,584 INFO L273 TraceCheckUtils]: 31: Hoare triple {3636#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3637#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:27,585 INFO L273 TraceCheckUtils]: 32: Hoare triple {3637#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3637#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:27,585 INFO L273 TraceCheckUtils]: 33: Hoare triple {3637#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3637#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:27,586 INFO L273 TraceCheckUtils]: 34: Hoare triple {3637#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3638#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:27,586 INFO L273 TraceCheckUtils]: 35: Hoare triple {3638#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {3638#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:27,587 INFO L273 TraceCheckUtils]: 36: Hoare triple {3638#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {3638#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:27,588 INFO L273 TraceCheckUtils]: 37: Hoare triple {3638#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {3639#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:27,589 INFO L273 TraceCheckUtils]: 38: Hoare triple {3639#(<= main_~i~0 12)} assume !(~i~0 < 100000); {3628#false} is VALID [2018-11-23 11:58:27,589 INFO L273 TraceCheckUtils]: 39: Hoare triple {3628#false} havoc ~x~0;~x~0 := 0; {3628#false} is VALID [2018-11-23 11:58:27,589 INFO L273 TraceCheckUtils]: 40: Hoare triple {3628#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {3628#false} is VALID [2018-11-23 11:58:27,589 INFO L256 TraceCheckUtils]: 41: Hoare triple {3628#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {3628#false} is VALID [2018-11-23 11:58:27,590 INFO L273 TraceCheckUtils]: 42: Hoare triple {3628#false} ~cond := #in~cond; {3628#false} is VALID [2018-11-23 11:58:27,590 INFO L273 TraceCheckUtils]: 43: Hoare triple {3628#false} assume 0 == ~cond; {3628#false} is VALID [2018-11-23 11:58:27,590 INFO L273 TraceCheckUtils]: 44: Hoare triple {3628#false} assume !false; {3628#false} is VALID [2018-11-23 11:58:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:27,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:27,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 13 [2018-11-23 11:58:27,613 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-11-23 11:58:27,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:27,614 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 11:58:27,657 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:27,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 11:58:27,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 11:58:27,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:58:27,658 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 13 states. [2018-11-23 11:58:28,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:28,123 INFO L93 Difference]: Finished difference Result 90 states and 123 transitions. [2018-11-23 11:58:28,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:58:28,124 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 45 [2018-11-23 11:58:28,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:58:28,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 123 transitions. [2018-11-23 11:58:28,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 11:58:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 123 transitions. [2018-11-23 11:58:28,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 123 transitions. [2018-11-23 11:58:28,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:28,820 INFO L225 Difference]: With dead ends: 90 [2018-11-23 11:58:28,820 INFO L226 Difference]: Without dead ends: 73 [2018-11-23 11:58:28,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-11-23 11:58:28,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-11-23 11:58:28,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2018-11-23 11:58:28,881 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:28,882 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand 70 states. [2018-11-23 11:58:28,882 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand 70 states. [2018-11-23 11:58:28,882 INFO L87 Difference]: Start difference. First operand 73 states. Second operand 70 states. [2018-11-23 11:58:28,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:28,884 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2018-11-23 11:58:28,885 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2018-11-23 11:58:28,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:28,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:28,886 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand 73 states. [2018-11-23 11:58:28,886 INFO L87 Difference]: Start difference. First operand 70 states. Second operand 73 states. [2018-11-23 11:58:28,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:28,888 INFO L93 Difference]: Finished difference Result 73 states and 102 transitions. [2018-11-23 11:58:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2018-11-23 11:58:28,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:28,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:28,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:28,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:28,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-23 11:58:28,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 97 transitions. [2018-11-23 11:58:28,892 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 97 transitions. Word has length 45 [2018-11-23 11:58:28,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:28,892 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 97 transitions. [2018-11-23 11:58:28,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 11:58:28,892 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 97 transitions. [2018-11-23 11:58:28,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 11:58:28,893 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:28,893 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:28,893 INFO L423 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:28,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:28,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2068742497, now seen corresponding path program 11 times [2018-11-23 11:58:28,894 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:28,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:28,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:28,895 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:28,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:28,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:29,581 INFO L256 TraceCheckUtils]: 0: Hoare triple {4127#true} call ULTIMATE.init(); {4127#true} is VALID [2018-11-23 11:58:29,582 INFO L273 TraceCheckUtils]: 1: Hoare triple {4127#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4127#true} is VALID [2018-11-23 11:58:29,582 INFO L273 TraceCheckUtils]: 2: Hoare triple {4127#true} assume true; {4127#true} is VALID [2018-11-23 11:58:29,582 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4127#true} {4127#true} #88#return; {4127#true} is VALID [2018-11-23 11:58:29,583 INFO L256 TraceCheckUtils]: 4: Hoare triple {4127#true} call #t~ret13 := main(); {4127#true} is VALID [2018-11-23 11:58:29,583 INFO L273 TraceCheckUtils]: 5: Hoare triple {4127#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {4127#true} is VALID [2018-11-23 11:58:29,583 INFO L273 TraceCheckUtils]: 6: Hoare triple {4127#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {4127#true} is VALID [2018-11-23 11:58:29,599 INFO L273 TraceCheckUtils]: 7: Hoare triple {4127#true} ~i~0 := 2; {4129#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:29,613 INFO L273 TraceCheckUtils]: 8: Hoare triple {4129#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4129#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:29,616 INFO L273 TraceCheckUtils]: 9: Hoare triple {4129#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4129#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:29,617 INFO L273 TraceCheckUtils]: 10: Hoare triple {4129#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4130#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:29,617 INFO L273 TraceCheckUtils]: 11: Hoare triple {4130#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4130#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:29,617 INFO L273 TraceCheckUtils]: 12: Hoare triple {4130#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4130#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:29,618 INFO L273 TraceCheckUtils]: 13: Hoare triple {4130#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4131#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:29,618 INFO L273 TraceCheckUtils]: 14: Hoare triple {4131#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4131#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:29,619 INFO L273 TraceCheckUtils]: 15: Hoare triple {4131#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4131#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:29,619 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4132#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:29,620 INFO L273 TraceCheckUtils]: 17: Hoare triple {4132#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4132#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:29,621 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4132#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:29,621 INFO L273 TraceCheckUtils]: 19: Hoare triple {4132#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4133#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:29,622 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4133#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:29,623 INFO L273 TraceCheckUtils]: 21: Hoare triple {4133#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4133#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:29,624 INFO L273 TraceCheckUtils]: 22: Hoare triple {4133#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4134#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:29,624 INFO L273 TraceCheckUtils]: 23: Hoare triple {4134#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4134#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:29,625 INFO L273 TraceCheckUtils]: 24: Hoare triple {4134#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4134#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:29,626 INFO L273 TraceCheckUtils]: 25: Hoare triple {4134#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4135#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:29,627 INFO L273 TraceCheckUtils]: 26: Hoare triple {4135#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4135#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:29,627 INFO L273 TraceCheckUtils]: 27: Hoare triple {4135#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4135#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:29,628 INFO L273 TraceCheckUtils]: 28: Hoare triple {4135#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4136#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:29,629 INFO L273 TraceCheckUtils]: 29: Hoare triple {4136#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4136#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:29,630 INFO L273 TraceCheckUtils]: 30: Hoare triple {4136#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4136#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:29,630 INFO L273 TraceCheckUtils]: 31: Hoare triple {4136#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4137#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:29,631 INFO L273 TraceCheckUtils]: 32: Hoare triple {4137#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4137#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:29,632 INFO L273 TraceCheckUtils]: 33: Hoare triple {4137#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4137#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:29,633 INFO L273 TraceCheckUtils]: 34: Hoare triple {4137#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4138#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:29,633 INFO L273 TraceCheckUtils]: 35: Hoare triple {4138#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4138#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:29,634 INFO L273 TraceCheckUtils]: 36: Hoare triple {4138#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4138#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:29,635 INFO L273 TraceCheckUtils]: 37: Hoare triple {4138#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4139#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:29,636 INFO L273 TraceCheckUtils]: 38: Hoare triple {4139#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4139#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:29,636 INFO L273 TraceCheckUtils]: 39: Hoare triple {4139#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4139#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:29,637 INFO L273 TraceCheckUtils]: 40: Hoare triple {4139#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4140#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:29,638 INFO L273 TraceCheckUtils]: 41: Hoare triple {4140#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4128#false} is VALID [2018-11-23 11:58:29,638 INFO L273 TraceCheckUtils]: 42: Hoare triple {4128#false} havoc ~x~0;~x~0 := 0; {4128#false} is VALID [2018-11-23 11:58:29,638 INFO L273 TraceCheckUtils]: 43: Hoare triple {4128#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {4128#false} is VALID [2018-11-23 11:58:29,639 INFO L256 TraceCheckUtils]: 44: Hoare triple {4128#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {4128#false} is VALID [2018-11-23 11:58:29,639 INFO L273 TraceCheckUtils]: 45: Hoare triple {4128#false} ~cond := #in~cond; {4128#false} is VALID [2018-11-23 11:58:29,639 INFO L273 TraceCheckUtils]: 46: Hoare triple {4128#false} assume 0 == ~cond; {4128#false} is VALID [2018-11-23 11:58:29,640 INFO L273 TraceCheckUtils]: 47: Hoare triple {4128#false} assume !false; {4128#false} is VALID [2018-11-23 11:58:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:29,643 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:29,643 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-23 11:58:29,653 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:58:29,691 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2018-11-23 11:58:29,692 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:29,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:29,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:29,948 INFO L256 TraceCheckUtils]: 0: Hoare triple {4127#true} call ULTIMATE.init(); {4127#true} is VALID [2018-11-23 11:58:29,948 INFO L273 TraceCheckUtils]: 1: Hoare triple {4127#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4127#true} is VALID [2018-11-23 11:58:29,948 INFO L273 TraceCheckUtils]: 2: Hoare triple {4127#true} assume true; {4127#true} is VALID [2018-11-23 11:58:29,949 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4127#true} {4127#true} #88#return; {4127#true} is VALID [2018-11-23 11:58:29,949 INFO L256 TraceCheckUtils]: 4: Hoare triple {4127#true} call #t~ret13 := main(); {4127#true} is VALID [2018-11-23 11:58:29,949 INFO L273 TraceCheckUtils]: 5: Hoare triple {4127#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {4127#true} is VALID [2018-11-23 11:58:29,949 INFO L273 TraceCheckUtils]: 6: Hoare triple {4127#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {4127#true} is VALID [2018-11-23 11:58:29,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {4127#true} ~i~0 := 2; {4129#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:29,950 INFO L273 TraceCheckUtils]: 8: Hoare triple {4129#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4129#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:29,951 INFO L273 TraceCheckUtils]: 9: Hoare triple {4129#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4129#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:29,951 INFO L273 TraceCheckUtils]: 10: Hoare triple {4129#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4130#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:29,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {4130#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4130#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:29,952 INFO L273 TraceCheckUtils]: 12: Hoare triple {4130#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4130#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:29,953 INFO L273 TraceCheckUtils]: 13: Hoare triple {4130#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4131#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:29,953 INFO L273 TraceCheckUtils]: 14: Hoare triple {4131#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4131#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:29,954 INFO L273 TraceCheckUtils]: 15: Hoare triple {4131#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4131#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:29,954 INFO L273 TraceCheckUtils]: 16: Hoare triple {4131#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4132#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:29,954 INFO L273 TraceCheckUtils]: 17: Hoare triple {4132#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4132#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:29,955 INFO L273 TraceCheckUtils]: 18: Hoare triple {4132#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4132#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:29,956 INFO L273 TraceCheckUtils]: 19: Hoare triple {4132#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4133#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:29,956 INFO L273 TraceCheckUtils]: 20: Hoare triple {4133#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4133#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:29,957 INFO L273 TraceCheckUtils]: 21: Hoare triple {4133#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4133#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:29,958 INFO L273 TraceCheckUtils]: 22: Hoare triple {4133#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4134#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:29,959 INFO L273 TraceCheckUtils]: 23: Hoare triple {4134#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4134#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:29,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {4134#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4134#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:29,960 INFO L273 TraceCheckUtils]: 25: Hoare triple {4134#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4135#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:29,961 INFO L273 TraceCheckUtils]: 26: Hoare triple {4135#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4135#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:29,961 INFO L273 TraceCheckUtils]: 27: Hoare triple {4135#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4135#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:29,962 INFO L273 TraceCheckUtils]: 28: Hoare triple {4135#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4136#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:29,963 INFO L273 TraceCheckUtils]: 29: Hoare triple {4136#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4136#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:29,964 INFO L273 TraceCheckUtils]: 30: Hoare triple {4136#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4136#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:29,965 INFO L273 TraceCheckUtils]: 31: Hoare triple {4136#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4137#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:29,965 INFO L273 TraceCheckUtils]: 32: Hoare triple {4137#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4137#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:29,966 INFO L273 TraceCheckUtils]: 33: Hoare triple {4137#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4137#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:29,967 INFO L273 TraceCheckUtils]: 34: Hoare triple {4137#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4138#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:29,967 INFO L273 TraceCheckUtils]: 35: Hoare triple {4138#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4138#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:29,968 INFO L273 TraceCheckUtils]: 36: Hoare triple {4138#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4138#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:29,969 INFO L273 TraceCheckUtils]: 37: Hoare triple {4138#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4139#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:29,970 INFO L273 TraceCheckUtils]: 38: Hoare triple {4139#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4139#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:29,970 INFO L273 TraceCheckUtils]: 39: Hoare triple {4139#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4139#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:29,971 INFO L273 TraceCheckUtils]: 40: Hoare triple {4139#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4140#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:29,972 INFO L273 TraceCheckUtils]: 41: Hoare triple {4140#(<= main_~i~0 13)} assume !(~i~0 < 100000); {4128#false} is VALID [2018-11-23 11:58:29,972 INFO L273 TraceCheckUtils]: 42: Hoare triple {4128#false} havoc ~x~0;~x~0 := 0; {4128#false} is VALID [2018-11-23 11:58:29,973 INFO L273 TraceCheckUtils]: 43: Hoare triple {4128#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {4128#false} is VALID [2018-11-23 11:58:29,973 INFO L256 TraceCheckUtils]: 44: Hoare triple {4128#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {4128#false} is VALID [2018-11-23 11:58:29,973 INFO L273 TraceCheckUtils]: 45: Hoare triple {4128#false} ~cond := #in~cond; {4128#false} is VALID [2018-11-23 11:58:29,973 INFO L273 TraceCheckUtils]: 46: Hoare triple {4128#false} assume 0 == ~cond; {4128#false} is VALID [2018-11-23 11:58:29,974 INFO L273 TraceCheckUtils]: 47: Hoare triple {4128#false} assume !false; {4128#false} is VALID [2018-11-23 11:58:29,978 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:29,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:29,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 14 [2018-11-23 11:58:29,998 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-11-23 11:58:29,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:29,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 11:58:30,051 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-23 11:58:30,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 11:58:30,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 11:58:30,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:58:30,052 INFO L87 Difference]: Start difference. First operand 70 states and 97 transitions. Second operand 14 states. [2018-11-23 11:58:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:30,893 INFO L93 Difference]: Finished difference Result 94 states and 129 transitions. [2018-11-23 11:58:30,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 11:58:30,893 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 48 [2018-11-23 11:58:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:58:30,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 129 transitions. [2018-11-23 11:58:30,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:58:30,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 129 transitions. [2018-11-23 11:58:30,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 129 transitions. [2018-11-23 11:58:31,844 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:31,846 INFO L225 Difference]: With dead ends: 94 [2018-11-23 11:58:31,846 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 11:58:31,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 11:58:31,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 11:58:31,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-11-23 11:58:31,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:31,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand 74 states. [2018-11-23 11:58:31,982 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand 74 states. [2018-11-23 11:58:31,982 INFO L87 Difference]: Start difference. First operand 77 states. Second operand 74 states. [2018-11-23 11:58:31,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:31,985 INFO L93 Difference]: Finished difference Result 77 states and 108 transitions. [2018-11-23 11:58:31,985 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 108 transitions. [2018-11-23 11:58:31,986 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:31,986 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:31,986 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 77 states. [2018-11-23 11:58:31,986 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 77 states. [2018-11-23 11:58:31,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:31,989 INFO L93 Difference]: Finished difference Result 77 states and 108 transitions. [2018-11-23 11:58:31,989 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 108 transitions. [2018-11-23 11:58:31,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:31,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:31,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:31,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:31,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 11:58:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2018-11-23 11:58:31,992 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 48 [2018-11-23 11:58:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:31,992 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2018-11-23 11:58:31,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 11:58:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2018-11-23 11:58:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-23 11:58:31,993 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:31,993 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:31,993 INFO L423 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:31,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:31,994 INFO L82 PathProgramCache]: Analyzing trace with hash 2071779740, now seen corresponding path program 12 times [2018-11-23 11:58:31,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:31,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:31,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:31,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:33,754 INFO L256 TraceCheckUtils]: 0: Hoare triple {4655#true} call ULTIMATE.init(); {4655#true} is VALID [2018-11-23 11:58:33,755 INFO L273 TraceCheckUtils]: 1: Hoare triple {4655#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4655#true} is VALID [2018-11-23 11:58:33,755 INFO L273 TraceCheckUtils]: 2: Hoare triple {4655#true} assume true; {4655#true} is VALID [2018-11-23 11:58:33,755 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4655#true} {4655#true} #88#return; {4655#true} is VALID [2018-11-23 11:58:33,756 INFO L256 TraceCheckUtils]: 4: Hoare triple {4655#true} call #t~ret13 := main(); {4655#true} is VALID [2018-11-23 11:58:33,756 INFO L273 TraceCheckUtils]: 5: Hoare triple {4655#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {4655#true} is VALID [2018-11-23 11:58:33,756 INFO L273 TraceCheckUtils]: 6: Hoare triple {4655#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {4655#true} is VALID [2018-11-23 11:58:33,756 INFO L273 TraceCheckUtils]: 7: Hoare triple {4655#true} ~i~0 := 2; {4657#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:33,757 INFO L273 TraceCheckUtils]: 8: Hoare triple {4657#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4657#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:33,757 INFO L273 TraceCheckUtils]: 9: Hoare triple {4657#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4657#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:33,758 INFO L273 TraceCheckUtils]: 10: Hoare triple {4657#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4658#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:33,758 INFO L273 TraceCheckUtils]: 11: Hoare triple {4658#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4658#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:33,758 INFO L273 TraceCheckUtils]: 12: Hoare triple {4658#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4658#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:33,759 INFO L273 TraceCheckUtils]: 13: Hoare triple {4658#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4659#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:33,759 INFO L273 TraceCheckUtils]: 14: Hoare triple {4659#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4659#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:33,760 INFO L273 TraceCheckUtils]: 15: Hoare triple {4659#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4659#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:33,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {4659#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4660#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:33,761 INFO L273 TraceCheckUtils]: 17: Hoare triple {4660#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4660#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:33,762 INFO L273 TraceCheckUtils]: 18: Hoare triple {4660#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4660#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:33,762 INFO L273 TraceCheckUtils]: 19: Hoare triple {4660#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4661#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:33,763 INFO L273 TraceCheckUtils]: 20: Hoare triple {4661#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4661#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:33,780 INFO L273 TraceCheckUtils]: 21: Hoare triple {4661#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4661#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:33,789 INFO L273 TraceCheckUtils]: 22: Hoare triple {4661#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4662#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:33,804 INFO L273 TraceCheckUtils]: 23: Hoare triple {4662#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4662#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:33,813 INFO L273 TraceCheckUtils]: 24: Hoare triple {4662#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4662#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:33,826 INFO L273 TraceCheckUtils]: 25: Hoare triple {4662#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4663#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:33,835 INFO L273 TraceCheckUtils]: 26: Hoare triple {4663#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4663#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:33,840 INFO L273 TraceCheckUtils]: 27: Hoare triple {4663#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4663#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:33,857 INFO L273 TraceCheckUtils]: 28: Hoare triple {4663#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4664#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:33,866 INFO L273 TraceCheckUtils]: 29: Hoare triple {4664#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4664#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:33,876 INFO L273 TraceCheckUtils]: 30: Hoare triple {4664#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4664#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:33,877 INFO L273 TraceCheckUtils]: 31: Hoare triple {4664#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4665#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:33,881 INFO L273 TraceCheckUtils]: 32: Hoare triple {4665#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4665#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:33,881 INFO L273 TraceCheckUtils]: 33: Hoare triple {4665#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4665#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:33,883 INFO L273 TraceCheckUtils]: 34: Hoare triple {4665#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4666#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:33,883 INFO L273 TraceCheckUtils]: 35: Hoare triple {4666#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4666#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:33,883 INFO L273 TraceCheckUtils]: 36: Hoare triple {4666#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4666#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:33,884 INFO L273 TraceCheckUtils]: 37: Hoare triple {4666#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4667#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:33,884 INFO L273 TraceCheckUtils]: 38: Hoare triple {4667#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4667#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:33,884 INFO L273 TraceCheckUtils]: 39: Hoare triple {4667#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4667#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:33,885 INFO L273 TraceCheckUtils]: 40: Hoare triple {4667#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4668#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:33,885 INFO L273 TraceCheckUtils]: 41: Hoare triple {4668#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4668#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:33,886 INFO L273 TraceCheckUtils]: 42: Hoare triple {4668#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4668#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:33,886 INFO L273 TraceCheckUtils]: 43: Hoare triple {4668#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4669#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:33,887 INFO L273 TraceCheckUtils]: 44: Hoare triple {4669#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4656#false} is VALID [2018-11-23 11:58:33,887 INFO L273 TraceCheckUtils]: 45: Hoare triple {4656#false} havoc ~x~0;~x~0 := 0; {4656#false} is VALID [2018-11-23 11:58:33,887 INFO L273 TraceCheckUtils]: 46: Hoare triple {4656#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {4656#false} is VALID [2018-11-23 11:58:33,887 INFO L256 TraceCheckUtils]: 47: Hoare triple {4656#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {4656#false} is VALID [2018-11-23 11:58:33,888 INFO L273 TraceCheckUtils]: 48: Hoare triple {4656#false} ~cond := #in~cond; {4656#false} is VALID [2018-11-23 11:58:33,888 INFO L273 TraceCheckUtils]: 49: Hoare triple {4656#false} assume 0 == ~cond; {4656#false} is VALID [2018-11-23 11:58:33,888 INFO L273 TraceCheckUtils]: 50: Hoare triple {4656#false} assume !false; {4656#false} is VALID [2018-11-23 11:58:33,891 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:33,891 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:33,891 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-23 11:58:33,906 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:58:33,943 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2018-11-23 11:58:33,944 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:33,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:33,959 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:34,072 INFO L256 TraceCheckUtils]: 0: Hoare triple {4655#true} call ULTIMATE.init(); {4655#true} is VALID [2018-11-23 11:58:34,073 INFO L273 TraceCheckUtils]: 1: Hoare triple {4655#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {4655#true} is VALID [2018-11-23 11:58:34,073 INFO L273 TraceCheckUtils]: 2: Hoare triple {4655#true} assume true; {4655#true} is VALID [2018-11-23 11:58:34,073 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4655#true} {4655#true} #88#return; {4655#true} is VALID [2018-11-23 11:58:34,074 INFO L256 TraceCheckUtils]: 4: Hoare triple {4655#true} call #t~ret13 := main(); {4655#true} is VALID [2018-11-23 11:58:34,074 INFO L273 TraceCheckUtils]: 5: Hoare triple {4655#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {4655#true} is VALID [2018-11-23 11:58:34,074 INFO L273 TraceCheckUtils]: 6: Hoare triple {4655#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {4655#true} is VALID [2018-11-23 11:58:34,075 INFO L273 TraceCheckUtils]: 7: Hoare triple {4655#true} ~i~0 := 2; {4657#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:34,075 INFO L273 TraceCheckUtils]: 8: Hoare triple {4657#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4657#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:34,076 INFO L273 TraceCheckUtils]: 9: Hoare triple {4657#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4657#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:34,076 INFO L273 TraceCheckUtils]: 10: Hoare triple {4657#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4658#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:34,077 INFO L273 TraceCheckUtils]: 11: Hoare triple {4658#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4658#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:34,077 INFO L273 TraceCheckUtils]: 12: Hoare triple {4658#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4658#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:34,077 INFO L273 TraceCheckUtils]: 13: Hoare triple {4658#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4659#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:34,078 INFO L273 TraceCheckUtils]: 14: Hoare triple {4659#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4659#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:34,078 INFO L273 TraceCheckUtils]: 15: Hoare triple {4659#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4659#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:34,079 INFO L273 TraceCheckUtils]: 16: Hoare triple {4659#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4660#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:34,079 INFO L273 TraceCheckUtils]: 17: Hoare triple {4660#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4660#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:34,080 INFO L273 TraceCheckUtils]: 18: Hoare triple {4660#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4660#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:34,081 INFO L273 TraceCheckUtils]: 19: Hoare triple {4660#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4661#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:34,081 INFO L273 TraceCheckUtils]: 20: Hoare triple {4661#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4661#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:34,082 INFO L273 TraceCheckUtils]: 21: Hoare triple {4661#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4661#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:34,083 INFO L273 TraceCheckUtils]: 22: Hoare triple {4661#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4662#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:34,083 INFO L273 TraceCheckUtils]: 23: Hoare triple {4662#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4662#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:34,084 INFO L273 TraceCheckUtils]: 24: Hoare triple {4662#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4662#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:34,084 INFO L273 TraceCheckUtils]: 25: Hoare triple {4662#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4663#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:34,085 INFO L273 TraceCheckUtils]: 26: Hoare triple {4663#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4663#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:34,086 INFO L273 TraceCheckUtils]: 27: Hoare triple {4663#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4663#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:34,086 INFO L273 TraceCheckUtils]: 28: Hoare triple {4663#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4664#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:34,087 INFO L273 TraceCheckUtils]: 29: Hoare triple {4664#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4664#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:34,087 INFO L273 TraceCheckUtils]: 30: Hoare triple {4664#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4664#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:34,088 INFO L273 TraceCheckUtils]: 31: Hoare triple {4664#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4665#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:34,089 INFO L273 TraceCheckUtils]: 32: Hoare triple {4665#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4665#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:34,089 INFO L273 TraceCheckUtils]: 33: Hoare triple {4665#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4665#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:34,090 INFO L273 TraceCheckUtils]: 34: Hoare triple {4665#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4666#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:34,090 INFO L273 TraceCheckUtils]: 35: Hoare triple {4666#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4666#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:34,091 INFO L273 TraceCheckUtils]: 36: Hoare triple {4666#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4666#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:34,092 INFO L273 TraceCheckUtils]: 37: Hoare triple {4666#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4667#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:34,092 INFO L273 TraceCheckUtils]: 38: Hoare triple {4667#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4667#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:34,093 INFO L273 TraceCheckUtils]: 39: Hoare triple {4667#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4667#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:34,094 INFO L273 TraceCheckUtils]: 40: Hoare triple {4667#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4668#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:34,094 INFO L273 TraceCheckUtils]: 41: Hoare triple {4668#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {4668#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:34,095 INFO L273 TraceCheckUtils]: 42: Hoare triple {4668#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {4668#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:34,095 INFO L273 TraceCheckUtils]: 43: Hoare triple {4668#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {4669#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:34,096 INFO L273 TraceCheckUtils]: 44: Hoare triple {4669#(<= main_~i~0 14)} assume !(~i~0 < 100000); {4656#false} is VALID [2018-11-23 11:58:34,096 INFO L273 TraceCheckUtils]: 45: Hoare triple {4656#false} havoc ~x~0;~x~0 := 0; {4656#false} is VALID [2018-11-23 11:58:34,097 INFO L273 TraceCheckUtils]: 46: Hoare triple {4656#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {4656#false} is VALID [2018-11-23 11:58:34,097 INFO L256 TraceCheckUtils]: 47: Hoare triple {4656#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {4656#false} is VALID [2018-11-23 11:58:34,097 INFO L273 TraceCheckUtils]: 48: Hoare triple {4656#false} ~cond := #in~cond; {4656#false} is VALID [2018-11-23 11:58:34,097 INFO L273 TraceCheckUtils]: 49: Hoare triple {4656#false} assume 0 == ~cond; {4656#false} is VALID [2018-11-23 11:58:34,097 INFO L273 TraceCheckUtils]: 50: Hoare triple {4656#false} assume !false; {4656#false} is VALID [2018-11-23 11:58:34,100 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:34,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:34,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 15 [2018-11-23 11:58:34,120 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-11-23 11:58:34,120 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:34,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2018-11-23 11:58:34,169 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:34,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 11:58:34,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 11:58:34,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:58:34,170 INFO L87 Difference]: Start difference. First operand 74 states and 103 transitions. Second operand 15 states. [2018-11-23 11:58:34,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:34,687 INFO L93 Difference]: Finished difference Result 98 states and 135 transitions. [2018-11-23 11:58:34,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 11:58:34,687 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 51 [2018-11-23 11:58:34,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:34,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:58:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2018-11-23 11:58:34,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 11:58:34,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 135 transitions. [2018-11-23 11:58:34,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 135 transitions. [2018-11-23 11:58:35,157 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:35,159 INFO L225 Difference]: With dead ends: 98 [2018-11-23 11:58:35,160 INFO L226 Difference]: Without dead ends: 81 [2018-11-23 11:58:35,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-11-23 11:58:35,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-11-23 11:58:35,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2018-11-23 11:58:35,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:35,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand 78 states. [2018-11-23 11:58:35,178 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand 78 states. [2018-11-23 11:58:35,178 INFO L87 Difference]: Start difference. First operand 81 states. Second operand 78 states. [2018-11-23 11:58:35,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:35,180 INFO L93 Difference]: Finished difference Result 81 states and 114 transitions. [2018-11-23 11:58:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2018-11-23 11:58:35,180 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:35,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:35,181 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand 81 states. [2018-11-23 11:58:35,181 INFO L87 Difference]: Start difference. First operand 78 states. Second operand 81 states. [2018-11-23 11:58:35,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:35,182 INFO L93 Difference]: Finished difference Result 81 states and 114 transitions. [2018-11-23 11:58:35,183 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 114 transitions. [2018-11-23 11:58:35,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:35,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:35,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:35,183 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-23 11:58:35,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2018-11-23 11:58:35,185 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 51 [2018-11-23 11:58:35,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:35,186 INFO L480 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2018-11-23 11:58:35,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 11:58:35,186 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2018-11-23 11:58:35,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 11:58:35,187 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:35,187 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:35,187 INFO L423 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:35,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:35,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1934994559, now seen corresponding path program 13 times [2018-11-23 11:58:35,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:35,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:35,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:35,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:35,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:35,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:36,222 INFO L256 TraceCheckUtils]: 0: Hoare triple {5211#true} call ULTIMATE.init(); {5211#true} is VALID [2018-11-23 11:58:36,222 INFO L273 TraceCheckUtils]: 1: Hoare triple {5211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5211#true} is VALID [2018-11-23 11:58:36,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {5211#true} assume true; {5211#true} is VALID [2018-11-23 11:58:36,223 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5211#true} {5211#true} #88#return; {5211#true} is VALID [2018-11-23 11:58:36,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {5211#true} call #t~ret13 := main(); {5211#true} is VALID [2018-11-23 11:58:36,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {5211#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {5211#true} is VALID [2018-11-23 11:58:36,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {5211#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {5211#true} is VALID [2018-11-23 11:58:36,223 INFO L273 TraceCheckUtils]: 7: Hoare triple {5211#true} ~i~0 := 2; {5213#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:36,224 INFO L273 TraceCheckUtils]: 8: Hoare triple {5213#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5213#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:36,224 INFO L273 TraceCheckUtils]: 9: Hoare triple {5213#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5213#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:36,225 INFO L273 TraceCheckUtils]: 10: Hoare triple {5213#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5214#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:36,225 INFO L273 TraceCheckUtils]: 11: Hoare triple {5214#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5214#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:36,225 INFO L273 TraceCheckUtils]: 12: Hoare triple {5214#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5214#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:36,226 INFO L273 TraceCheckUtils]: 13: Hoare triple {5214#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5215#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:36,227 INFO L273 TraceCheckUtils]: 14: Hoare triple {5215#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5215#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:36,227 INFO L273 TraceCheckUtils]: 15: Hoare triple {5215#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5215#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:36,228 INFO L273 TraceCheckUtils]: 16: Hoare triple {5215#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5216#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:36,229 INFO L273 TraceCheckUtils]: 17: Hoare triple {5216#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5216#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:36,229 INFO L273 TraceCheckUtils]: 18: Hoare triple {5216#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5216#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:36,230 INFO L273 TraceCheckUtils]: 19: Hoare triple {5216#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5217#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:36,231 INFO L273 TraceCheckUtils]: 20: Hoare triple {5217#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5217#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:36,231 INFO L273 TraceCheckUtils]: 21: Hoare triple {5217#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5217#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:36,232 INFO L273 TraceCheckUtils]: 22: Hoare triple {5217#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5218#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:36,232 INFO L273 TraceCheckUtils]: 23: Hoare triple {5218#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5218#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:36,233 INFO L273 TraceCheckUtils]: 24: Hoare triple {5218#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5218#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:36,234 INFO L273 TraceCheckUtils]: 25: Hoare triple {5218#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5219#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:36,234 INFO L273 TraceCheckUtils]: 26: Hoare triple {5219#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5219#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:36,235 INFO L273 TraceCheckUtils]: 27: Hoare triple {5219#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5219#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:36,236 INFO L273 TraceCheckUtils]: 28: Hoare triple {5219#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5220#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:36,236 INFO L273 TraceCheckUtils]: 29: Hoare triple {5220#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5220#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:36,237 INFO L273 TraceCheckUtils]: 30: Hoare triple {5220#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5220#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:36,237 INFO L273 TraceCheckUtils]: 31: Hoare triple {5220#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5221#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:36,238 INFO L273 TraceCheckUtils]: 32: Hoare triple {5221#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5221#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:36,239 INFO L273 TraceCheckUtils]: 33: Hoare triple {5221#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5221#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:36,239 INFO L273 TraceCheckUtils]: 34: Hoare triple {5221#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5222#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:36,240 INFO L273 TraceCheckUtils]: 35: Hoare triple {5222#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5222#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:36,240 INFO L273 TraceCheckUtils]: 36: Hoare triple {5222#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5222#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:36,241 INFO L273 TraceCheckUtils]: 37: Hoare triple {5222#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5223#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:36,242 INFO L273 TraceCheckUtils]: 38: Hoare triple {5223#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5223#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:36,242 INFO L273 TraceCheckUtils]: 39: Hoare triple {5223#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5223#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:36,243 INFO L273 TraceCheckUtils]: 40: Hoare triple {5223#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5224#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:36,244 INFO L273 TraceCheckUtils]: 41: Hoare triple {5224#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5224#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:36,244 INFO L273 TraceCheckUtils]: 42: Hoare triple {5224#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5224#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:36,245 INFO L273 TraceCheckUtils]: 43: Hoare triple {5224#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5225#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:36,246 INFO L273 TraceCheckUtils]: 44: Hoare triple {5225#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5225#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:36,246 INFO L273 TraceCheckUtils]: 45: Hoare triple {5225#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5225#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:36,247 INFO L273 TraceCheckUtils]: 46: Hoare triple {5225#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5226#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:36,248 INFO L273 TraceCheckUtils]: 47: Hoare triple {5226#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5212#false} is VALID [2018-11-23 11:58:36,248 INFO L273 TraceCheckUtils]: 48: Hoare triple {5212#false} havoc ~x~0;~x~0 := 0; {5212#false} is VALID [2018-11-23 11:58:36,248 INFO L273 TraceCheckUtils]: 49: Hoare triple {5212#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {5212#false} is VALID [2018-11-23 11:58:36,248 INFO L256 TraceCheckUtils]: 50: Hoare triple {5212#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {5212#false} is VALID [2018-11-23 11:58:36,248 INFO L273 TraceCheckUtils]: 51: Hoare triple {5212#false} ~cond := #in~cond; {5212#false} is VALID [2018-11-23 11:58:36,249 INFO L273 TraceCheckUtils]: 52: Hoare triple {5212#false} assume 0 == ~cond; {5212#false} is VALID [2018-11-23 11:58:36,249 INFO L273 TraceCheckUtils]: 53: Hoare triple {5212#false} assume !false; {5212#false} is VALID [2018-11-23 11:58:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:36,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:36,252 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-23 11:58:36,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:36,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:36,313 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:36,450 INFO L256 TraceCheckUtils]: 0: Hoare triple {5211#true} call ULTIMATE.init(); {5211#true} is VALID [2018-11-23 11:58:36,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {5211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5211#true} is VALID [2018-11-23 11:58:36,451 INFO L273 TraceCheckUtils]: 2: Hoare triple {5211#true} assume true; {5211#true} is VALID [2018-11-23 11:58:36,451 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5211#true} {5211#true} #88#return; {5211#true} is VALID [2018-11-23 11:58:36,451 INFO L256 TraceCheckUtils]: 4: Hoare triple {5211#true} call #t~ret13 := main(); {5211#true} is VALID [2018-11-23 11:58:36,452 INFO L273 TraceCheckUtils]: 5: Hoare triple {5211#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {5211#true} is VALID [2018-11-23 11:58:36,452 INFO L273 TraceCheckUtils]: 6: Hoare triple {5211#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {5211#true} is VALID [2018-11-23 11:58:36,452 INFO L273 TraceCheckUtils]: 7: Hoare triple {5211#true} ~i~0 := 2; {5213#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:36,455 INFO L273 TraceCheckUtils]: 8: Hoare triple {5213#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5213#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:36,456 INFO L273 TraceCheckUtils]: 9: Hoare triple {5213#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5213#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:36,456 INFO L273 TraceCheckUtils]: 10: Hoare triple {5213#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5214#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:36,457 INFO L273 TraceCheckUtils]: 11: Hoare triple {5214#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5214#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:36,457 INFO L273 TraceCheckUtils]: 12: Hoare triple {5214#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5214#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:36,457 INFO L273 TraceCheckUtils]: 13: Hoare triple {5214#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5215#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:36,458 INFO L273 TraceCheckUtils]: 14: Hoare triple {5215#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5215#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:36,458 INFO L273 TraceCheckUtils]: 15: Hoare triple {5215#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5215#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:36,459 INFO L273 TraceCheckUtils]: 16: Hoare triple {5215#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5216#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:36,459 INFO L273 TraceCheckUtils]: 17: Hoare triple {5216#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5216#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:36,460 INFO L273 TraceCheckUtils]: 18: Hoare triple {5216#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5216#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:36,460 INFO L273 TraceCheckUtils]: 19: Hoare triple {5216#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5217#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:36,461 INFO L273 TraceCheckUtils]: 20: Hoare triple {5217#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5217#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:36,461 INFO L273 TraceCheckUtils]: 21: Hoare triple {5217#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5217#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:36,462 INFO L273 TraceCheckUtils]: 22: Hoare triple {5217#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5218#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:36,463 INFO L273 TraceCheckUtils]: 23: Hoare triple {5218#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5218#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:36,463 INFO L273 TraceCheckUtils]: 24: Hoare triple {5218#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5218#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:36,464 INFO L273 TraceCheckUtils]: 25: Hoare triple {5218#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5219#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:36,464 INFO L273 TraceCheckUtils]: 26: Hoare triple {5219#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5219#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:36,465 INFO L273 TraceCheckUtils]: 27: Hoare triple {5219#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5219#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:36,465 INFO L273 TraceCheckUtils]: 28: Hoare triple {5219#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5220#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:36,466 INFO L273 TraceCheckUtils]: 29: Hoare triple {5220#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5220#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:36,466 INFO L273 TraceCheckUtils]: 30: Hoare triple {5220#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5220#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:36,467 INFO L273 TraceCheckUtils]: 31: Hoare triple {5220#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5221#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:36,468 INFO L273 TraceCheckUtils]: 32: Hoare triple {5221#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5221#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:36,468 INFO L273 TraceCheckUtils]: 33: Hoare triple {5221#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5221#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:36,469 INFO L273 TraceCheckUtils]: 34: Hoare triple {5221#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5222#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:36,469 INFO L273 TraceCheckUtils]: 35: Hoare triple {5222#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5222#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:36,470 INFO L273 TraceCheckUtils]: 36: Hoare triple {5222#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5222#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:36,471 INFO L273 TraceCheckUtils]: 37: Hoare triple {5222#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5223#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:36,471 INFO L273 TraceCheckUtils]: 38: Hoare triple {5223#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5223#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:36,472 INFO L273 TraceCheckUtils]: 39: Hoare triple {5223#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5223#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:36,472 INFO L273 TraceCheckUtils]: 40: Hoare triple {5223#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5224#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:36,473 INFO L273 TraceCheckUtils]: 41: Hoare triple {5224#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5224#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:36,473 INFO L273 TraceCheckUtils]: 42: Hoare triple {5224#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5224#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:36,474 INFO L273 TraceCheckUtils]: 43: Hoare triple {5224#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5225#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:36,474 INFO L273 TraceCheckUtils]: 44: Hoare triple {5225#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5225#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:36,475 INFO L273 TraceCheckUtils]: 45: Hoare triple {5225#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5225#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:36,476 INFO L273 TraceCheckUtils]: 46: Hoare triple {5225#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5226#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:36,476 INFO L273 TraceCheckUtils]: 47: Hoare triple {5226#(<= main_~i~0 15)} assume !(~i~0 < 100000); {5212#false} is VALID [2018-11-23 11:58:36,477 INFO L273 TraceCheckUtils]: 48: Hoare triple {5212#false} havoc ~x~0;~x~0 := 0; {5212#false} is VALID [2018-11-23 11:58:36,477 INFO L273 TraceCheckUtils]: 49: Hoare triple {5212#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {5212#false} is VALID [2018-11-23 11:58:36,477 INFO L256 TraceCheckUtils]: 50: Hoare triple {5212#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {5212#false} is VALID [2018-11-23 11:58:36,477 INFO L273 TraceCheckUtils]: 51: Hoare triple {5212#false} ~cond := #in~cond; {5212#false} is VALID [2018-11-23 11:58:36,477 INFO L273 TraceCheckUtils]: 52: Hoare triple {5212#false} assume 0 == ~cond; {5212#false} is VALID [2018-11-23 11:58:36,478 INFO L273 TraceCheckUtils]: 53: Hoare triple {5212#false} assume !false; {5212#false} is VALID [2018-11-23 11:58:36,480 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:36,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:36,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 16 [2018-11-23 11:58:36,499 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-11-23 11:58:36,499 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:36,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:58:36,547 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:36,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:58:36,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:58:36,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:58:36,548 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand 16 states. [2018-11-23 11:58:36,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:36,988 INFO L93 Difference]: Finished difference Result 102 states and 141 transitions. [2018-11-23 11:58:36,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:58:36,988 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 54 [2018-11-23 11:58:36,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:36,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:58:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 141 transitions. [2018-11-23 11:58:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:58:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 141 transitions. [2018-11-23 11:58:36,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 141 transitions. [2018-11-23 11:58:37,412 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:37,413 INFO L225 Difference]: With dead ends: 102 [2018-11-23 11:58:37,414 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 11:58:37,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:58:37,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 11:58:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 82. [2018-11-23 11:58:37,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:37,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 82 states. [2018-11-23 11:58:37,432 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 82 states. [2018-11-23 11:58:37,432 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 82 states. [2018-11-23 11:58:37,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:37,434 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2018-11-23 11:58:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2018-11-23 11:58:37,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:37,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:37,435 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 85 states. [2018-11-23 11:58:37,435 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 85 states. [2018-11-23 11:58:37,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:37,437 INFO L93 Difference]: Finished difference Result 85 states and 120 transitions. [2018-11-23 11:58:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 120 transitions. [2018-11-23 11:58:37,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:37,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:37,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:37,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-11-23 11:58:37,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 115 transitions. [2018-11-23 11:58:37,440 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 115 transitions. Word has length 54 [2018-11-23 11:58:37,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:37,441 INFO L480 AbstractCegarLoop]: Abstraction has 82 states and 115 transitions. [2018-11-23 11:58:37,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:58:37,441 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 115 transitions. [2018-11-23 11:58:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 11:58:37,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:37,442 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:37,442 INFO L423 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:37,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash -2017045636, now seen corresponding path program 14 times [2018-11-23 11:58:37,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:37,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:37,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:37,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:37,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:38,036 INFO L256 TraceCheckUtils]: 0: Hoare triple {5795#true} call ULTIMATE.init(); {5795#true} is VALID [2018-11-23 11:58:38,036 INFO L273 TraceCheckUtils]: 1: Hoare triple {5795#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5795#true} is VALID [2018-11-23 11:58:38,037 INFO L273 TraceCheckUtils]: 2: Hoare triple {5795#true} assume true; {5795#true} is VALID [2018-11-23 11:58:38,037 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5795#true} {5795#true} #88#return; {5795#true} is VALID [2018-11-23 11:58:38,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {5795#true} call #t~ret13 := main(); {5795#true} is VALID [2018-11-23 11:58:38,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {5795#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {5795#true} is VALID [2018-11-23 11:58:38,037 INFO L273 TraceCheckUtils]: 6: Hoare triple {5795#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {5795#true} is VALID [2018-11-23 11:58:38,038 INFO L273 TraceCheckUtils]: 7: Hoare triple {5795#true} ~i~0 := 2; {5797#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:38,038 INFO L273 TraceCheckUtils]: 8: Hoare triple {5797#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5797#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:38,039 INFO L273 TraceCheckUtils]: 9: Hoare triple {5797#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5797#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:38,039 INFO L273 TraceCheckUtils]: 10: Hoare triple {5797#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5798#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:38,040 INFO L273 TraceCheckUtils]: 11: Hoare triple {5798#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5798#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:38,040 INFO L273 TraceCheckUtils]: 12: Hoare triple {5798#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5798#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:38,040 INFO L273 TraceCheckUtils]: 13: Hoare triple {5798#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5799#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:38,041 INFO L273 TraceCheckUtils]: 14: Hoare triple {5799#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5799#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:38,041 INFO L273 TraceCheckUtils]: 15: Hoare triple {5799#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5799#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:38,042 INFO L273 TraceCheckUtils]: 16: Hoare triple {5799#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5800#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:38,042 INFO L273 TraceCheckUtils]: 17: Hoare triple {5800#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5800#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:38,043 INFO L273 TraceCheckUtils]: 18: Hoare triple {5800#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5800#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:38,044 INFO L273 TraceCheckUtils]: 19: Hoare triple {5800#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5801#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:38,044 INFO L273 TraceCheckUtils]: 20: Hoare triple {5801#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5801#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:38,045 INFO L273 TraceCheckUtils]: 21: Hoare triple {5801#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5801#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:38,046 INFO L273 TraceCheckUtils]: 22: Hoare triple {5801#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5802#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:38,046 INFO L273 TraceCheckUtils]: 23: Hoare triple {5802#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5802#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:38,047 INFO L273 TraceCheckUtils]: 24: Hoare triple {5802#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5802#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:38,047 INFO L273 TraceCheckUtils]: 25: Hoare triple {5802#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5803#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:38,048 INFO L273 TraceCheckUtils]: 26: Hoare triple {5803#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5803#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:38,049 INFO L273 TraceCheckUtils]: 27: Hoare triple {5803#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5803#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:38,049 INFO L273 TraceCheckUtils]: 28: Hoare triple {5803#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5804#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:38,050 INFO L273 TraceCheckUtils]: 29: Hoare triple {5804#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5804#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:38,050 INFO L273 TraceCheckUtils]: 30: Hoare triple {5804#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5804#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:38,051 INFO L273 TraceCheckUtils]: 31: Hoare triple {5804#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5805#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:38,052 INFO L273 TraceCheckUtils]: 32: Hoare triple {5805#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5805#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:38,052 INFO L273 TraceCheckUtils]: 33: Hoare triple {5805#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5805#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:38,053 INFO L273 TraceCheckUtils]: 34: Hoare triple {5805#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5806#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:38,054 INFO L273 TraceCheckUtils]: 35: Hoare triple {5806#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5806#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:38,054 INFO L273 TraceCheckUtils]: 36: Hoare triple {5806#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5806#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:38,055 INFO L273 TraceCheckUtils]: 37: Hoare triple {5806#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5807#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:38,055 INFO L273 TraceCheckUtils]: 38: Hoare triple {5807#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5807#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:38,056 INFO L273 TraceCheckUtils]: 39: Hoare triple {5807#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5807#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:38,057 INFO L273 TraceCheckUtils]: 40: Hoare triple {5807#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5808#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:38,057 INFO L273 TraceCheckUtils]: 41: Hoare triple {5808#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5808#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:38,058 INFO L273 TraceCheckUtils]: 42: Hoare triple {5808#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5808#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:38,059 INFO L273 TraceCheckUtils]: 43: Hoare triple {5808#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5809#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:38,059 INFO L273 TraceCheckUtils]: 44: Hoare triple {5809#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5809#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:38,060 INFO L273 TraceCheckUtils]: 45: Hoare triple {5809#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5809#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:38,060 INFO L273 TraceCheckUtils]: 46: Hoare triple {5809#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5810#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:38,061 INFO L273 TraceCheckUtils]: 47: Hoare triple {5810#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5810#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:38,062 INFO L273 TraceCheckUtils]: 48: Hoare triple {5810#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5810#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:38,062 INFO L273 TraceCheckUtils]: 49: Hoare triple {5810#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5811#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:38,063 INFO L273 TraceCheckUtils]: 50: Hoare triple {5811#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5796#false} is VALID [2018-11-23 11:58:38,063 INFO L273 TraceCheckUtils]: 51: Hoare triple {5796#false} havoc ~x~0;~x~0 := 0; {5796#false} is VALID [2018-11-23 11:58:38,064 INFO L273 TraceCheckUtils]: 52: Hoare triple {5796#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {5796#false} is VALID [2018-11-23 11:58:38,064 INFO L256 TraceCheckUtils]: 53: Hoare triple {5796#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {5796#false} is VALID [2018-11-23 11:58:38,064 INFO L273 TraceCheckUtils]: 54: Hoare triple {5796#false} ~cond := #in~cond; {5796#false} is VALID [2018-11-23 11:58:38,064 INFO L273 TraceCheckUtils]: 55: Hoare triple {5796#false} assume 0 == ~cond; {5796#false} is VALID [2018-11-23 11:58:38,064 INFO L273 TraceCheckUtils]: 56: Hoare triple {5796#false} assume !false; {5796#false} is VALID [2018-11-23 11:58:38,067 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:38,067 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:38,067 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-23 11:58:38,077 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:38,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:38,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:38,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:38,289 INFO L256 TraceCheckUtils]: 0: Hoare triple {5795#true} call ULTIMATE.init(); {5795#true} is VALID [2018-11-23 11:58:38,289 INFO L273 TraceCheckUtils]: 1: Hoare triple {5795#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {5795#true} is VALID [2018-11-23 11:58:38,289 INFO L273 TraceCheckUtils]: 2: Hoare triple {5795#true} assume true; {5795#true} is VALID [2018-11-23 11:58:38,290 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5795#true} {5795#true} #88#return; {5795#true} is VALID [2018-11-23 11:58:38,290 INFO L256 TraceCheckUtils]: 4: Hoare triple {5795#true} call #t~ret13 := main(); {5795#true} is VALID [2018-11-23 11:58:38,290 INFO L273 TraceCheckUtils]: 5: Hoare triple {5795#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {5795#true} is VALID [2018-11-23 11:58:38,290 INFO L273 TraceCheckUtils]: 6: Hoare triple {5795#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {5795#true} is VALID [2018-11-23 11:58:38,291 INFO L273 TraceCheckUtils]: 7: Hoare triple {5795#true} ~i~0 := 2; {5797#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:38,292 INFO L273 TraceCheckUtils]: 8: Hoare triple {5797#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5797#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:38,292 INFO L273 TraceCheckUtils]: 9: Hoare triple {5797#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5797#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:38,292 INFO L273 TraceCheckUtils]: 10: Hoare triple {5797#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5798#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:38,293 INFO L273 TraceCheckUtils]: 11: Hoare triple {5798#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5798#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:38,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {5798#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5798#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:38,294 INFO L273 TraceCheckUtils]: 13: Hoare triple {5798#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5799#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:38,294 INFO L273 TraceCheckUtils]: 14: Hoare triple {5799#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5799#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:38,295 INFO L273 TraceCheckUtils]: 15: Hoare triple {5799#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5799#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:38,296 INFO L273 TraceCheckUtils]: 16: Hoare triple {5799#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5800#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:38,296 INFO L273 TraceCheckUtils]: 17: Hoare triple {5800#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5800#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:38,297 INFO L273 TraceCheckUtils]: 18: Hoare triple {5800#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5800#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:38,297 INFO L273 TraceCheckUtils]: 19: Hoare triple {5800#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5801#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:38,298 INFO L273 TraceCheckUtils]: 20: Hoare triple {5801#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5801#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:38,299 INFO L273 TraceCheckUtils]: 21: Hoare triple {5801#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5801#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:38,299 INFO L273 TraceCheckUtils]: 22: Hoare triple {5801#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5802#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:38,300 INFO L273 TraceCheckUtils]: 23: Hoare triple {5802#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5802#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:38,301 INFO L273 TraceCheckUtils]: 24: Hoare triple {5802#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5802#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:38,301 INFO L273 TraceCheckUtils]: 25: Hoare triple {5802#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5803#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:38,302 INFO L273 TraceCheckUtils]: 26: Hoare triple {5803#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5803#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:38,302 INFO L273 TraceCheckUtils]: 27: Hoare triple {5803#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5803#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:38,303 INFO L273 TraceCheckUtils]: 28: Hoare triple {5803#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5804#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:38,304 INFO L273 TraceCheckUtils]: 29: Hoare triple {5804#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5804#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:38,304 INFO L273 TraceCheckUtils]: 30: Hoare triple {5804#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5804#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:38,305 INFO L273 TraceCheckUtils]: 31: Hoare triple {5804#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5805#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:38,306 INFO L273 TraceCheckUtils]: 32: Hoare triple {5805#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5805#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:38,306 INFO L273 TraceCheckUtils]: 33: Hoare triple {5805#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5805#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:38,307 INFO L273 TraceCheckUtils]: 34: Hoare triple {5805#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5806#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:38,308 INFO L273 TraceCheckUtils]: 35: Hoare triple {5806#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5806#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:38,308 INFO L273 TraceCheckUtils]: 36: Hoare triple {5806#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5806#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:38,309 INFO L273 TraceCheckUtils]: 37: Hoare triple {5806#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5807#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:38,310 INFO L273 TraceCheckUtils]: 38: Hoare triple {5807#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5807#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:38,310 INFO L273 TraceCheckUtils]: 39: Hoare triple {5807#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5807#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:38,311 INFO L273 TraceCheckUtils]: 40: Hoare triple {5807#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5808#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:38,311 INFO L273 TraceCheckUtils]: 41: Hoare triple {5808#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5808#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:38,312 INFO L273 TraceCheckUtils]: 42: Hoare triple {5808#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5808#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:38,313 INFO L273 TraceCheckUtils]: 43: Hoare triple {5808#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5809#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:38,313 INFO L273 TraceCheckUtils]: 44: Hoare triple {5809#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5809#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:38,314 INFO L273 TraceCheckUtils]: 45: Hoare triple {5809#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5809#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:38,315 INFO L273 TraceCheckUtils]: 46: Hoare triple {5809#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5810#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:38,315 INFO L273 TraceCheckUtils]: 47: Hoare triple {5810#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {5810#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:38,316 INFO L273 TraceCheckUtils]: 48: Hoare triple {5810#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {5810#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:38,316 INFO L273 TraceCheckUtils]: 49: Hoare triple {5810#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {5811#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:38,317 INFO L273 TraceCheckUtils]: 50: Hoare triple {5811#(<= main_~i~0 16)} assume !(~i~0 < 100000); {5796#false} is VALID [2018-11-23 11:58:38,317 INFO L273 TraceCheckUtils]: 51: Hoare triple {5796#false} havoc ~x~0;~x~0 := 0; {5796#false} is VALID [2018-11-23 11:58:38,318 INFO L273 TraceCheckUtils]: 52: Hoare triple {5796#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {5796#false} is VALID [2018-11-23 11:58:38,318 INFO L256 TraceCheckUtils]: 53: Hoare triple {5796#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {5796#false} is VALID [2018-11-23 11:58:38,318 INFO L273 TraceCheckUtils]: 54: Hoare triple {5796#false} ~cond := #in~cond; {5796#false} is VALID [2018-11-23 11:58:38,318 INFO L273 TraceCheckUtils]: 55: Hoare triple {5796#false} assume 0 == ~cond; {5796#false} is VALID [2018-11-23 11:58:38,318 INFO L273 TraceCheckUtils]: 56: Hoare triple {5796#false} assume !false; {5796#false} is VALID [2018-11-23 11:58:38,322 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:38,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:38,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 17 [2018-11-23 11:58:38,342 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-11-23 11:58:38,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:38,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:58:38,397 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-23 11:58:38,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:58:38,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:58:38,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:58:38,398 INFO L87 Difference]: Start difference. First operand 82 states and 115 transitions. Second operand 17 states. [2018-11-23 11:58:39,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:39,588 INFO L93 Difference]: Finished difference Result 106 states and 147 transitions. [2018-11-23 11:58:39,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 11:58:39,588 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 57 [2018-11-23 11:58:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:39,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:58:39,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 147 transitions. [2018-11-23 11:58:39,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:58:39,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 147 transitions. [2018-11-23 11:58:39,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 147 transitions. [2018-11-23 11:58:40,139 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-23 11:58:40,141 INFO L225 Difference]: With dead ends: 106 [2018-11-23 11:58:40,141 INFO L226 Difference]: Without dead ends: 89 [2018-11-23 11:58:40,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:58:40,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-11-23 11:58:40,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-11-23 11:58:40,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:40,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand 86 states. [2018-11-23 11:58:40,161 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand 86 states. [2018-11-23 11:58:40,161 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 86 states. [2018-11-23 11:58:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:40,165 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2018-11-23 11:58:40,165 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2018-11-23 11:58:40,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:40,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:40,165 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand 89 states. [2018-11-23 11:58:40,165 INFO L87 Difference]: Start difference. First operand 86 states. Second operand 89 states. [2018-11-23 11:58:40,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:40,168 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2018-11-23 11:58:40,168 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 126 transitions. [2018-11-23 11:58:40,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:40,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:40,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:40,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:40,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 11:58:40,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 121 transitions. [2018-11-23 11:58:40,173 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 121 transitions. Word has length 57 [2018-11-23 11:58:40,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:40,173 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 121 transitions. [2018-11-23 11:58:40,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:58:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 121 transitions. [2018-11-23 11:58:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-23 11:58:40,174 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:40,175 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:40,175 INFO L423 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:40,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1730678177, now seen corresponding path program 15 times [2018-11-23 11:58:40,175 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:40,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:40,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:40,176 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:40,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:40,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:40,760 INFO L256 TraceCheckUtils]: 0: Hoare triple {6407#true} call ULTIMATE.init(); {6407#true} is VALID [2018-11-23 11:58:40,760 INFO L273 TraceCheckUtils]: 1: Hoare triple {6407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6407#true} is VALID [2018-11-23 11:58:40,761 INFO L273 TraceCheckUtils]: 2: Hoare triple {6407#true} assume true; {6407#true} is VALID [2018-11-23 11:58:40,761 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6407#true} {6407#true} #88#return; {6407#true} is VALID [2018-11-23 11:58:40,761 INFO L256 TraceCheckUtils]: 4: Hoare triple {6407#true} call #t~ret13 := main(); {6407#true} is VALID [2018-11-23 11:58:40,761 INFO L273 TraceCheckUtils]: 5: Hoare triple {6407#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {6407#true} is VALID [2018-11-23 11:58:40,762 INFO L273 TraceCheckUtils]: 6: Hoare triple {6407#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {6407#true} is VALID [2018-11-23 11:58:40,762 INFO L273 TraceCheckUtils]: 7: Hoare triple {6407#true} ~i~0 := 2; {6409#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,763 INFO L273 TraceCheckUtils]: 8: Hoare triple {6409#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6409#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,764 INFO L273 TraceCheckUtils]: 9: Hoare triple {6409#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6409#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:40,765 INFO L273 TraceCheckUtils]: 10: Hoare triple {6409#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6410#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:40,765 INFO L273 TraceCheckUtils]: 11: Hoare triple {6410#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6410#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:40,765 INFO L273 TraceCheckUtils]: 12: Hoare triple {6410#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6410#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:40,766 INFO L273 TraceCheckUtils]: 13: Hoare triple {6410#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6411#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:40,766 INFO L273 TraceCheckUtils]: 14: Hoare triple {6411#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6411#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:40,767 INFO L273 TraceCheckUtils]: 15: Hoare triple {6411#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6411#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:40,768 INFO L273 TraceCheckUtils]: 16: Hoare triple {6411#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6412#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:40,769 INFO L273 TraceCheckUtils]: 17: Hoare triple {6412#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6412#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:40,769 INFO L273 TraceCheckUtils]: 18: Hoare triple {6412#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6412#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:40,770 INFO L273 TraceCheckUtils]: 19: Hoare triple {6412#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6413#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:40,771 INFO L273 TraceCheckUtils]: 20: Hoare triple {6413#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6413#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:40,772 INFO L273 TraceCheckUtils]: 21: Hoare triple {6413#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6413#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:40,773 INFO L273 TraceCheckUtils]: 22: Hoare triple {6413#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6414#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:40,773 INFO L273 TraceCheckUtils]: 23: Hoare triple {6414#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6414#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:40,774 INFO L273 TraceCheckUtils]: 24: Hoare triple {6414#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6414#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:40,775 INFO L273 TraceCheckUtils]: 25: Hoare triple {6414#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6415#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:40,775 INFO L273 TraceCheckUtils]: 26: Hoare triple {6415#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6415#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:40,776 INFO L273 TraceCheckUtils]: 27: Hoare triple {6415#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6415#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:40,777 INFO L273 TraceCheckUtils]: 28: Hoare triple {6415#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6416#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:40,778 INFO L273 TraceCheckUtils]: 29: Hoare triple {6416#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6416#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:40,778 INFO L273 TraceCheckUtils]: 30: Hoare triple {6416#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6416#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:40,779 INFO L273 TraceCheckUtils]: 31: Hoare triple {6416#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6417#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:40,780 INFO L273 TraceCheckUtils]: 32: Hoare triple {6417#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6417#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:40,780 INFO L273 TraceCheckUtils]: 33: Hoare triple {6417#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6417#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:40,781 INFO L273 TraceCheckUtils]: 34: Hoare triple {6417#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6418#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:40,782 INFO L273 TraceCheckUtils]: 35: Hoare triple {6418#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6418#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:40,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {6418#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6418#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:40,783 INFO L273 TraceCheckUtils]: 37: Hoare triple {6418#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6419#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:40,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {6419#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6419#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:40,785 INFO L273 TraceCheckUtils]: 39: Hoare triple {6419#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6419#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:40,786 INFO L273 TraceCheckUtils]: 40: Hoare triple {6419#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6420#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:40,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {6420#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6420#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:40,787 INFO L273 TraceCheckUtils]: 42: Hoare triple {6420#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6420#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:40,788 INFO L273 TraceCheckUtils]: 43: Hoare triple {6420#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6421#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:40,789 INFO L273 TraceCheckUtils]: 44: Hoare triple {6421#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6421#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:40,789 INFO L273 TraceCheckUtils]: 45: Hoare triple {6421#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6421#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:40,790 INFO L273 TraceCheckUtils]: 46: Hoare triple {6421#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6422#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:40,791 INFO L273 TraceCheckUtils]: 47: Hoare triple {6422#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6422#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:40,791 INFO L273 TraceCheckUtils]: 48: Hoare triple {6422#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6422#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:40,792 INFO L273 TraceCheckUtils]: 49: Hoare triple {6422#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6423#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:40,793 INFO L273 TraceCheckUtils]: 50: Hoare triple {6423#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6423#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:40,793 INFO L273 TraceCheckUtils]: 51: Hoare triple {6423#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6423#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:40,794 INFO L273 TraceCheckUtils]: 52: Hoare triple {6423#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6424#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:40,795 INFO L273 TraceCheckUtils]: 53: Hoare triple {6424#(<= main_~i~0 17)} assume !(~i~0 < 100000); {6408#false} is VALID [2018-11-23 11:58:40,796 INFO L273 TraceCheckUtils]: 54: Hoare triple {6408#false} havoc ~x~0;~x~0 := 0; {6408#false} is VALID [2018-11-23 11:58:40,796 INFO L273 TraceCheckUtils]: 55: Hoare triple {6408#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {6408#false} is VALID [2018-11-23 11:58:40,796 INFO L256 TraceCheckUtils]: 56: Hoare triple {6408#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {6408#false} is VALID [2018-11-23 11:58:40,796 INFO L273 TraceCheckUtils]: 57: Hoare triple {6408#false} ~cond := #in~cond; {6408#false} is VALID [2018-11-23 11:58:40,797 INFO L273 TraceCheckUtils]: 58: Hoare triple {6408#false} assume 0 == ~cond; {6408#false} is VALID [2018-11-23 11:58:40,797 INFO L273 TraceCheckUtils]: 59: Hoare triple {6408#false} assume !false; {6408#false} is VALID [2018-11-23 11:58:40,802 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:40,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:40,802 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-23 11:58:40,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:40,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2018-11-23 11:58:40,862 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:40,883 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:41,060 INFO L256 TraceCheckUtils]: 0: Hoare triple {6407#true} call ULTIMATE.init(); {6407#true} is VALID [2018-11-23 11:58:41,060 INFO L273 TraceCheckUtils]: 1: Hoare triple {6407#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {6407#true} is VALID [2018-11-23 11:58:41,061 INFO L273 TraceCheckUtils]: 2: Hoare triple {6407#true} assume true; {6407#true} is VALID [2018-11-23 11:58:41,061 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6407#true} {6407#true} #88#return; {6407#true} is VALID [2018-11-23 11:58:41,061 INFO L256 TraceCheckUtils]: 4: Hoare triple {6407#true} call #t~ret13 := main(); {6407#true} is VALID [2018-11-23 11:58:41,062 INFO L273 TraceCheckUtils]: 5: Hoare triple {6407#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {6407#true} is VALID [2018-11-23 11:58:41,062 INFO L273 TraceCheckUtils]: 6: Hoare triple {6407#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {6407#true} is VALID [2018-11-23 11:58:41,063 INFO L273 TraceCheckUtils]: 7: Hoare triple {6407#true} ~i~0 := 2; {6409#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:41,063 INFO L273 TraceCheckUtils]: 8: Hoare triple {6409#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6409#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:41,064 INFO L273 TraceCheckUtils]: 9: Hoare triple {6409#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6409#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:41,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {6409#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6410#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:41,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {6410#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6410#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:41,066 INFO L273 TraceCheckUtils]: 12: Hoare triple {6410#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6410#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:41,066 INFO L273 TraceCheckUtils]: 13: Hoare triple {6410#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6411#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:41,067 INFO L273 TraceCheckUtils]: 14: Hoare triple {6411#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6411#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:41,067 INFO L273 TraceCheckUtils]: 15: Hoare triple {6411#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6411#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:41,068 INFO L273 TraceCheckUtils]: 16: Hoare triple {6411#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6412#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:41,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {6412#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6412#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:41,069 INFO L273 TraceCheckUtils]: 18: Hoare triple {6412#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6412#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:41,070 INFO L273 TraceCheckUtils]: 19: Hoare triple {6412#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6413#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:41,071 INFO L273 TraceCheckUtils]: 20: Hoare triple {6413#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6413#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:41,071 INFO L273 TraceCheckUtils]: 21: Hoare triple {6413#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6413#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:41,072 INFO L273 TraceCheckUtils]: 22: Hoare triple {6413#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6414#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:41,073 INFO L273 TraceCheckUtils]: 23: Hoare triple {6414#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6414#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:41,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {6414#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6414#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:41,075 INFO L273 TraceCheckUtils]: 25: Hoare triple {6414#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6415#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:41,075 INFO L273 TraceCheckUtils]: 26: Hoare triple {6415#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6415#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:41,076 INFO L273 TraceCheckUtils]: 27: Hoare triple {6415#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6415#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:41,077 INFO L273 TraceCheckUtils]: 28: Hoare triple {6415#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6416#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:41,077 INFO L273 TraceCheckUtils]: 29: Hoare triple {6416#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6416#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:41,078 INFO L273 TraceCheckUtils]: 30: Hoare triple {6416#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6416#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:41,079 INFO L273 TraceCheckUtils]: 31: Hoare triple {6416#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6417#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:41,080 INFO L273 TraceCheckUtils]: 32: Hoare triple {6417#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6417#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:41,080 INFO L273 TraceCheckUtils]: 33: Hoare triple {6417#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6417#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:41,081 INFO L273 TraceCheckUtils]: 34: Hoare triple {6417#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6418#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:41,082 INFO L273 TraceCheckUtils]: 35: Hoare triple {6418#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6418#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:41,082 INFO L273 TraceCheckUtils]: 36: Hoare triple {6418#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6418#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:41,083 INFO L273 TraceCheckUtils]: 37: Hoare triple {6418#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6419#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:41,084 INFO L273 TraceCheckUtils]: 38: Hoare triple {6419#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6419#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:41,085 INFO L273 TraceCheckUtils]: 39: Hoare triple {6419#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6419#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:41,085 INFO L273 TraceCheckUtils]: 40: Hoare triple {6419#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6420#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:41,086 INFO L273 TraceCheckUtils]: 41: Hoare triple {6420#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6420#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:41,087 INFO L273 TraceCheckUtils]: 42: Hoare triple {6420#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6420#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:41,087 INFO L273 TraceCheckUtils]: 43: Hoare triple {6420#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6421#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:41,088 INFO L273 TraceCheckUtils]: 44: Hoare triple {6421#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6421#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:41,089 INFO L273 TraceCheckUtils]: 45: Hoare triple {6421#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6421#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:41,090 INFO L273 TraceCheckUtils]: 46: Hoare triple {6421#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6422#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:41,090 INFO L273 TraceCheckUtils]: 47: Hoare triple {6422#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6422#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:41,091 INFO L273 TraceCheckUtils]: 48: Hoare triple {6422#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6422#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:41,092 INFO L273 TraceCheckUtils]: 49: Hoare triple {6422#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6423#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:41,092 INFO L273 TraceCheckUtils]: 50: Hoare triple {6423#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {6423#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:41,093 INFO L273 TraceCheckUtils]: 51: Hoare triple {6423#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {6423#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:41,094 INFO L273 TraceCheckUtils]: 52: Hoare triple {6423#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {6424#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:41,095 INFO L273 TraceCheckUtils]: 53: Hoare triple {6424#(<= main_~i~0 17)} assume !(~i~0 < 100000); {6408#false} is VALID [2018-11-23 11:58:41,095 INFO L273 TraceCheckUtils]: 54: Hoare triple {6408#false} havoc ~x~0;~x~0 := 0; {6408#false} is VALID [2018-11-23 11:58:41,095 INFO L273 TraceCheckUtils]: 55: Hoare triple {6408#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {6408#false} is VALID [2018-11-23 11:58:41,096 INFO L256 TraceCheckUtils]: 56: Hoare triple {6408#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {6408#false} is VALID [2018-11-23 11:58:41,096 INFO L273 TraceCheckUtils]: 57: Hoare triple {6408#false} ~cond := #in~cond; {6408#false} is VALID [2018-11-23 11:58:41,096 INFO L273 TraceCheckUtils]: 58: Hoare triple {6408#false} assume 0 == ~cond; {6408#false} is VALID [2018-11-23 11:58:41,096 INFO L273 TraceCheckUtils]: 59: Hoare triple {6408#false} assume !false; {6408#false} is VALID [2018-11-23 11:58:41,101 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:41,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:41,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 18 [2018-11-23 11:58:41,121 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-11-23 11:58:41,121 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:41,121 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2018-11-23 11:58:41,189 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-23 11:58:41,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 11:58:41,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 11:58:41,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:58:41,190 INFO L87 Difference]: Start difference. First operand 86 states and 121 transitions. Second operand 18 states. [2018-11-23 11:58:41,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:41,900 INFO L93 Difference]: Finished difference Result 110 states and 153 transitions. [2018-11-23 11:58:41,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 11:58:41,901 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 60 [2018-11-23 11:58:41,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:41,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:58:41,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 153 transitions. [2018-11-23 11:58:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:58:41,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 153 transitions. [2018-11-23 11:58:41,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 153 transitions. [2018-11-23 11:58:42,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:42,427 INFO L225 Difference]: With dead ends: 110 [2018-11-23 11:58:42,427 INFO L226 Difference]: Without dead ends: 93 [2018-11-23 11:58:42,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 11:58:42,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-23 11:58:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2018-11-23 11:58:42,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:42,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand 90 states. [2018-11-23 11:58:42,502 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand 90 states. [2018-11-23 11:58:42,502 INFO L87 Difference]: Start difference. First operand 93 states. Second operand 90 states. [2018-11-23 11:58:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:42,505 INFO L93 Difference]: Finished difference Result 93 states and 132 transitions. [2018-11-23 11:58:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2018-11-23 11:58:42,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:42,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:42,506 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 93 states. [2018-11-23 11:58:42,506 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 93 states. [2018-11-23 11:58:42,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:42,510 INFO L93 Difference]: Finished difference Result 93 states and 132 transitions. [2018-11-23 11:58:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 132 transitions. [2018-11-23 11:58:42,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:42,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:42,511 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:42,511 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:42,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 11:58:42,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 127 transitions. [2018-11-23 11:58:42,516 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 127 transitions. Word has length 60 [2018-11-23 11:58:42,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:42,516 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 127 transitions. [2018-11-23 11:58:42,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 11:58:42,516 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 127 transitions. [2018-11-23 11:58:42,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-11-23 11:58:42,517 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:42,517 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:42,517 INFO L423 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:42,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:42,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1799035556, now seen corresponding path program 16 times [2018-11-23 11:58:42,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:42,518 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:42,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:42,519 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:42,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:42,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:43,296 INFO L256 TraceCheckUtils]: 0: Hoare triple {7047#true} call ULTIMATE.init(); {7047#true} is VALID [2018-11-23 11:58:43,297 INFO L273 TraceCheckUtils]: 1: Hoare triple {7047#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7047#true} is VALID [2018-11-23 11:58:43,297 INFO L273 TraceCheckUtils]: 2: Hoare triple {7047#true} assume true; {7047#true} is VALID [2018-11-23 11:58:43,297 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7047#true} {7047#true} #88#return; {7047#true} is VALID [2018-11-23 11:58:43,297 INFO L256 TraceCheckUtils]: 4: Hoare triple {7047#true} call #t~ret13 := main(); {7047#true} is VALID [2018-11-23 11:58:43,298 INFO L273 TraceCheckUtils]: 5: Hoare triple {7047#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {7047#true} is VALID [2018-11-23 11:58:43,298 INFO L273 TraceCheckUtils]: 6: Hoare triple {7047#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {7047#true} is VALID [2018-11-23 11:58:43,299 INFO L273 TraceCheckUtils]: 7: Hoare triple {7047#true} ~i~0 := 2; {7049#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:43,299 INFO L273 TraceCheckUtils]: 8: Hoare triple {7049#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7049#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:43,299 INFO L273 TraceCheckUtils]: 9: Hoare triple {7049#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7049#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:43,300 INFO L273 TraceCheckUtils]: 10: Hoare triple {7049#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7050#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:43,300 INFO L273 TraceCheckUtils]: 11: Hoare triple {7050#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7050#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:43,301 INFO L273 TraceCheckUtils]: 12: Hoare triple {7050#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7050#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:43,301 INFO L273 TraceCheckUtils]: 13: Hoare triple {7050#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7051#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:43,301 INFO L273 TraceCheckUtils]: 14: Hoare triple {7051#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7051#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:43,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {7051#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7051#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:43,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {7051#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7052#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:43,303 INFO L273 TraceCheckUtils]: 17: Hoare triple {7052#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7052#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:43,303 INFO L273 TraceCheckUtils]: 18: Hoare triple {7052#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7052#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:43,304 INFO L273 TraceCheckUtils]: 19: Hoare triple {7052#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7053#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:43,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {7053#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7053#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:43,305 INFO L273 TraceCheckUtils]: 21: Hoare triple {7053#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7053#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:43,306 INFO L273 TraceCheckUtils]: 22: Hoare triple {7053#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7054#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:43,306 INFO L273 TraceCheckUtils]: 23: Hoare triple {7054#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7054#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:43,307 INFO L273 TraceCheckUtils]: 24: Hoare triple {7054#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7054#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:43,307 INFO L273 TraceCheckUtils]: 25: Hoare triple {7054#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7055#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:43,308 INFO L273 TraceCheckUtils]: 26: Hoare triple {7055#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7055#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:43,309 INFO L273 TraceCheckUtils]: 27: Hoare triple {7055#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7055#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:43,309 INFO L273 TraceCheckUtils]: 28: Hoare triple {7055#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7056#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:43,310 INFO L273 TraceCheckUtils]: 29: Hoare triple {7056#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7056#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:43,310 INFO L273 TraceCheckUtils]: 30: Hoare triple {7056#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7056#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:43,311 INFO L273 TraceCheckUtils]: 31: Hoare triple {7056#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7057#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:43,312 INFO L273 TraceCheckUtils]: 32: Hoare triple {7057#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7057#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:43,312 INFO L273 TraceCheckUtils]: 33: Hoare triple {7057#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7057#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:43,313 INFO L273 TraceCheckUtils]: 34: Hoare triple {7057#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7058#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:43,313 INFO L273 TraceCheckUtils]: 35: Hoare triple {7058#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7058#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:43,314 INFO L273 TraceCheckUtils]: 36: Hoare triple {7058#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7058#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:43,315 INFO L273 TraceCheckUtils]: 37: Hoare triple {7058#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7059#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:43,315 INFO L273 TraceCheckUtils]: 38: Hoare triple {7059#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7059#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:43,316 INFO L273 TraceCheckUtils]: 39: Hoare triple {7059#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7059#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:43,317 INFO L273 TraceCheckUtils]: 40: Hoare triple {7059#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7060#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:43,317 INFO L273 TraceCheckUtils]: 41: Hoare triple {7060#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7060#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:43,318 INFO L273 TraceCheckUtils]: 42: Hoare triple {7060#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7060#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:43,318 INFO L273 TraceCheckUtils]: 43: Hoare triple {7060#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7061#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:43,319 INFO L273 TraceCheckUtils]: 44: Hoare triple {7061#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7061#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:43,320 INFO L273 TraceCheckUtils]: 45: Hoare triple {7061#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7061#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:43,320 INFO L273 TraceCheckUtils]: 46: Hoare triple {7061#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7062#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:43,321 INFO L273 TraceCheckUtils]: 47: Hoare triple {7062#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7062#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:43,321 INFO L273 TraceCheckUtils]: 48: Hoare triple {7062#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7062#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:43,322 INFO L273 TraceCheckUtils]: 49: Hoare triple {7062#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7063#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:43,323 INFO L273 TraceCheckUtils]: 50: Hoare triple {7063#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7063#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:43,323 INFO L273 TraceCheckUtils]: 51: Hoare triple {7063#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7063#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:43,324 INFO L273 TraceCheckUtils]: 52: Hoare triple {7063#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7064#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:43,324 INFO L273 TraceCheckUtils]: 53: Hoare triple {7064#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7064#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:43,325 INFO L273 TraceCheckUtils]: 54: Hoare triple {7064#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7064#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:43,326 INFO L273 TraceCheckUtils]: 55: Hoare triple {7064#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7065#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:43,326 INFO L273 TraceCheckUtils]: 56: Hoare triple {7065#(<= main_~i~0 18)} assume !(~i~0 < 100000); {7048#false} is VALID [2018-11-23 11:58:43,327 INFO L273 TraceCheckUtils]: 57: Hoare triple {7048#false} havoc ~x~0;~x~0 := 0; {7048#false} is VALID [2018-11-23 11:58:43,327 INFO L273 TraceCheckUtils]: 58: Hoare triple {7048#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {7048#false} is VALID [2018-11-23 11:58:43,327 INFO L256 TraceCheckUtils]: 59: Hoare triple {7048#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {7048#false} is VALID [2018-11-23 11:58:43,327 INFO L273 TraceCheckUtils]: 60: Hoare triple {7048#false} ~cond := #in~cond; {7048#false} is VALID [2018-11-23 11:58:43,328 INFO L273 TraceCheckUtils]: 61: Hoare triple {7048#false} assume 0 == ~cond; {7048#false} is VALID [2018-11-23 11:58:43,328 INFO L273 TraceCheckUtils]: 62: Hoare triple {7048#false} assume !false; {7048#false} is VALID [2018-11-23 11:58:43,331 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:43,332 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:43,332 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-23 11:58:43,341 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:43,378 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:43,378 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:43,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:43,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:43,596 INFO L256 TraceCheckUtils]: 0: Hoare triple {7047#true} call ULTIMATE.init(); {7047#true} is VALID [2018-11-23 11:58:43,597 INFO L273 TraceCheckUtils]: 1: Hoare triple {7047#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7047#true} is VALID [2018-11-23 11:58:43,597 INFO L273 TraceCheckUtils]: 2: Hoare triple {7047#true} assume true; {7047#true} is VALID [2018-11-23 11:58:43,597 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7047#true} {7047#true} #88#return; {7047#true} is VALID [2018-11-23 11:58:43,597 INFO L256 TraceCheckUtils]: 4: Hoare triple {7047#true} call #t~ret13 := main(); {7047#true} is VALID [2018-11-23 11:58:43,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {7047#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {7047#true} is VALID [2018-11-23 11:58:43,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {7047#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {7047#true} is VALID [2018-11-23 11:58:43,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {7047#true} ~i~0 := 2; {7049#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:43,598 INFO L273 TraceCheckUtils]: 8: Hoare triple {7049#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7049#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:43,598 INFO L273 TraceCheckUtils]: 9: Hoare triple {7049#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7049#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:43,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {7049#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7050#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:43,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {7050#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7050#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:43,599 INFO L273 TraceCheckUtils]: 12: Hoare triple {7050#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7050#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:43,600 INFO L273 TraceCheckUtils]: 13: Hoare triple {7050#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7051#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:43,600 INFO L273 TraceCheckUtils]: 14: Hoare triple {7051#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7051#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:43,600 INFO L273 TraceCheckUtils]: 15: Hoare triple {7051#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7051#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:43,601 INFO L273 TraceCheckUtils]: 16: Hoare triple {7051#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7052#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:43,602 INFO L273 TraceCheckUtils]: 17: Hoare triple {7052#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7052#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:43,602 INFO L273 TraceCheckUtils]: 18: Hoare triple {7052#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7052#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:43,603 INFO L273 TraceCheckUtils]: 19: Hoare triple {7052#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7053#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:43,603 INFO L273 TraceCheckUtils]: 20: Hoare triple {7053#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7053#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:43,604 INFO L273 TraceCheckUtils]: 21: Hoare triple {7053#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7053#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:43,605 INFO L273 TraceCheckUtils]: 22: Hoare triple {7053#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7054#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:43,605 INFO L273 TraceCheckUtils]: 23: Hoare triple {7054#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7054#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:43,606 INFO L273 TraceCheckUtils]: 24: Hoare triple {7054#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7054#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:43,607 INFO L273 TraceCheckUtils]: 25: Hoare triple {7054#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7055#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:43,608 INFO L273 TraceCheckUtils]: 26: Hoare triple {7055#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7055#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:43,608 INFO L273 TraceCheckUtils]: 27: Hoare triple {7055#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7055#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:43,609 INFO L273 TraceCheckUtils]: 28: Hoare triple {7055#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7056#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:43,610 INFO L273 TraceCheckUtils]: 29: Hoare triple {7056#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7056#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:43,610 INFO L273 TraceCheckUtils]: 30: Hoare triple {7056#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7056#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:43,611 INFO L273 TraceCheckUtils]: 31: Hoare triple {7056#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7057#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:43,612 INFO L273 TraceCheckUtils]: 32: Hoare triple {7057#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7057#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:43,612 INFO L273 TraceCheckUtils]: 33: Hoare triple {7057#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7057#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:43,613 INFO L273 TraceCheckUtils]: 34: Hoare triple {7057#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7058#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:43,613 INFO L273 TraceCheckUtils]: 35: Hoare triple {7058#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7058#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:43,614 INFO L273 TraceCheckUtils]: 36: Hoare triple {7058#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7058#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:43,615 INFO L273 TraceCheckUtils]: 37: Hoare triple {7058#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7059#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:43,615 INFO L273 TraceCheckUtils]: 38: Hoare triple {7059#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7059#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:43,616 INFO L273 TraceCheckUtils]: 39: Hoare triple {7059#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7059#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:43,616 INFO L273 TraceCheckUtils]: 40: Hoare triple {7059#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7060#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:43,617 INFO L273 TraceCheckUtils]: 41: Hoare triple {7060#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7060#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:43,618 INFO L273 TraceCheckUtils]: 42: Hoare triple {7060#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7060#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:43,618 INFO L273 TraceCheckUtils]: 43: Hoare triple {7060#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7061#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:43,619 INFO L273 TraceCheckUtils]: 44: Hoare triple {7061#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7061#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:43,619 INFO L273 TraceCheckUtils]: 45: Hoare triple {7061#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7061#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:43,620 INFO L273 TraceCheckUtils]: 46: Hoare triple {7061#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7062#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:43,621 INFO L273 TraceCheckUtils]: 47: Hoare triple {7062#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7062#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:43,621 INFO L273 TraceCheckUtils]: 48: Hoare triple {7062#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7062#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:43,622 INFO L273 TraceCheckUtils]: 49: Hoare triple {7062#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7063#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:43,622 INFO L273 TraceCheckUtils]: 50: Hoare triple {7063#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7063#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:43,623 INFO L273 TraceCheckUtils]: 51: Hoare triple {7063#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7063#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:43,624 INFO L273 TraceCheckUtils]: 52: Hoare triple {7063#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7064#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:43,624 INFO L273 TraceCheckUtils]: 53: Hoare triple {7064#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7064#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:43,625 INFO L273 TraceCheckUtils]: 54: Hoare triple {7064#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7064#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:43,626 INFO L273 TraceCheckUtils]: 55: Hoare triple {7064#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7065#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:43,626 INFO L273 TraceCheckUtils]: 56: Hoare triple {7065#(<= main_~i~0 18)} assume !(~i~0 < 100000); {7048#false} is VALID [2018-11-23 11:58:43,626 INFO L273 TraceCheckUtils]: 57: Hoare triple {7048#false} havoc ~x~0;~x~0 := 0; {7048#false} is VALID [2018-11-23 11:58:43,627 INFO L273 TraceCheckUtils]: 58: Hoare triple {7048#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {7048#false} is VALID [2018-11-23 11:58:43,627 INFO L256 TraceCheckUtils]: 59: Hoare triple {7048#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {7048#false} is VALID [2018-11-23 11:58:43,627 INFO L273 TraceCheckUtils]: 60: Hoare triple {7048#false} ~cond := #in~cond; {7048#false} is VALID [2018-11-23 11:58:43,627 INFO L273 TraceCheckUtils]: 61: Hoare triple {7048#false} assume 0 == ~cond; {7048#false} is VALID [2018-11-23 11:58:43,628 INFO L273 TraceCheckUtils]: 62: Hoare triple {7048#false} assume !false; {7048#false} is VALID [2018-11-23 11:58:43,631 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:43,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:43,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 19 [2018-11-23 11:58:43,652 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-11-23 11:58:43,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:43,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states. [2018-11-23 11:58:43,717 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:43,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 11:58:43,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 11:58:43,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:58:43,718 INFO L87 Difference]: Start difference. First operand 90 states and 127 transitions. Second operand 19 states. [2018-11-23 11:58:44,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:44,375 INFO L93 Difference]: Finished difference Result 114 states and 159 transitions. [2018-11-23 11:58:44,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 11:58:44,376 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 63 [2018-11-23 11:58:44,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:44,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:58:44,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions. [2018-11-23 11:58:44,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 11:58:44,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 159 transitions. [2018-11-23 11:58:44,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 159 transitions. [2018-11-23 11:58:44,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:44,527 INFO L225 Difference]: With dead ends: 114 [2018-11-23 11:58:44,528 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 11:58:44,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-11-23 11:58:44,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 11:58:44,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2018-11-23 11:58:44,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:44,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand 94 states. [2018-11-23 11:58:44,610 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand 94 states. [2018-11-23 11:58:44,611 INFO L87 Difference]: Start difference. First operand 97 states. Second operand 94 states. [2018-11-23 11:58:44,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:44,614 INFO L93 Difference]: Finished difference Result 97 states and 138 transitions. [2018-11-23 11:58:44,614 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2018-11-23 11:58:44,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:44,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:44,615 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 97 states. [2018-11-23 11:58:44,615 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 97 states. [2018-11-23 11:58:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:44,617 INFO L93 Difference]: Finished difference Result 97 states and 138 transitions. [2018-11-23 11:58:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2018-11-23 11:58:44,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:44,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:44,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:44,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:44,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 11:58:44,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 133 transitions. [2018-11-23 11:58:44,620 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 133 transitions. Word has length 63 [2018-11-23 11:58:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:44,620 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 133 transitions. [2018-11-23 11:58:44,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 11:58:44,620 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 133 transitions. [2018-11-23 11:58:44,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-11-23 11:58:44,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:44,621 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:44,622 INFO L423 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:44,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:44,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1816547391, now seen corresponding path program 17 times [2018-11-23 11:58:44,622 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:44,622 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:44,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:44,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:44,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:45,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {7715#true} call ULTIMATE.init(); {7715#true} is VALID [2018-11-23 11:58:45,575 INFO L273 TraceCheckUtils]: 1: Hoare triple {7715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7715#true} is VALID [2018-11-23 11:58:45,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2018-11-23 11:58:45,575 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7715#true} #88#return; {7715#true} is VALID [2018-11-23 11:58:45,575 INFO L256 TraceCheckUtils]: 4: Hoare triple {7715#true} call #t~ret13 := main(); {7715#true} is VALID [2018-11-23 11:58:45,575 INFO L273 TraceCheckUtils]: 5: Hoare triple {7715#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {7715#true} is VALID [2018-11-23 11:58:45,576 INFO L273 TraceCheckUtils]: 6: Hoare triple {7715#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {7715#true} is VALID [2018-11-23 11:58:45,576 INFO L273 TraceCheckUtils]: 7: Hoare triple {7715#true} ~i~0 := 2; {7717#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {7717#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7717#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,577 INFO L273 TraceCheckUtils]: 9: Hoare triple {7717#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7717#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {7717#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7718#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,578 INFO L273 TraceCheckUtils]: 11: Hoare triple {7718#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7718#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,578 INFO L273 TraceCheckUtils]: 12: Hoare triple {7718#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7718#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,579 INFO L273 TraceCheckUtils]: 13: Hoare triple {7718#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7719#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,579 INFO L273 TraceCheckUtils]: 14: Hoare triple {7719#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7719#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,580 INFO L273 TraceCheckUtils]: 15: Hoare triple {7719#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7719#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,580 INFO L273 TraceCheckUtils]: 16: Hoare triple {7719#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7720#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,581 INFO L273 TraceCheckUtils]: 17: Hoare triple {7720#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7720#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,581 INFO L273 TraceCheckUtils]: 18: Hoare triple {7720#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7720#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,582 INFO L273 TraceCheckUtils]: 19: Hoare triple {7720#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7721#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,583 INFO L273 TraceCheckUtils]: 20: Hoare triple {7721#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7721#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,583 INFO L273 TraceCheckUtils]: 21: Hoare triple {7721#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7721#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,584 INFO L273 TraceCheckUtils]: 22: Hoare triple {7721#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7722#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:45,585 INFO L273 TraceCheckUtils]: 23: Hoare triple {7722#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7722#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:45,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {7722#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7722#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:45,586 INFO L273 TraceCheckUtils]: 25: Hoare triple {7722#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7723#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:45,586 INFO L273 TraceCheckUtils]: 26: Hoare triple {7723#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7723#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:45,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {7723#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7723#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:45,588 INFO L273 TraceCheckUtils]: 28: Hoare triple {7723#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7724#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:45,588 INFO L273 TraceCheckUtils]: 29: Hoare triple {7724#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7724#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:45,589 INFO L273 TraceCheckUtils]: 30: Hoare triple {7724#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7724#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:45,589 INFO L273 TraceCheckUtils]: 31: Hoare triple {7724#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7725#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:45,590 INFO L273 TraceCheckUtils]: 32: Hoare triple {7725#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7725#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:45,590 INFO L273 TraceCheckUtils]: 33: Hoare triple {7725#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7725#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:45,591 INFO L273 TraceCheckUtils]: 34: Hoare triple {7725#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7726#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:45,592 INFO L273 TraceCheckUtils]: 35: Hoare triple {7726#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7726#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:45,592 INFO L273 TraceCheckUtils]: 36: Hoare triple {7726#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7726#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:45,593 INFO L273 TraceCheckUtils]: 37: Hoare triple {7726#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7727#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:45,593 INFO L273 TraceCheckUtils]: 38: Hoare triple {7727#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7727#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:45,594 INFO L273 TraceCheckUtils]: 39: Hoare triple {7727#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7727#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:45,595 INFO L273 TraceCheckUtils]: 40: Hoare triple {7727#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7728#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:45,595 INFO L273 TraceCheckUtils]: 41: Hoare triple {7728#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7728#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:45,596 INFO L273 TraceCheckUtils]: 42: Hoare triple {7728#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7728#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:45,596 INFO L273 TraceCheckUtils]: 43: Hoare triple {7728#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7729#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:45,597 INFO L273 TraceCheckUtils]: 44: Hoare triple {7729#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7729#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:45,597 INFO L273 TraceCheckUtils]: 45: Hoare triple {7729#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7729#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:45,598 INFO L273 TraceCheckUtils]: 46: Hoare triple {7729#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7730#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:45,599 INFO L273 TraceCheckUtils]: 47: Hoare triple {7730#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7730#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:45,618 INFO L273 TraceCheckUtils]: 48: Hoare triple {7730#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7730#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:45,619 INFO L273 TraceCheckUtils]: 49: Hoare triple {7730#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7731#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:45,619 INFO L273 TraceCheckUtils]: 50: Hoare triple {7731#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7731#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:45,619 INFO L273 TraceCheckUtils]: 51: Hoare triple {7731#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7731#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:45,620 INFO L273 TraceCheckUtils]: 52: Hoare triple {7731#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7732#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:45,620 INFO L273 TraceCheckUtils]: 53: Hoare triple {7732#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7732#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:45,620 INFO L273 TraceCheckUtils]: 54: Hoare triple {7732#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7732#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:45,621 INFO L273 TraceCheckUtils]: 55: Hoare triple {7732#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7733#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:45,621 INFO L273 TraceCheckUtils]: 56: Hoare triple {7733#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7733#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:45,621 INFO L273 TraceCheckUtils]: 57: Hoare triple {7733#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7733#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:45,622 INFO L273 TraceCheckUtils]: 58: Hoare triple {7733#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7734#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:45,622 INFO L273 TraceCheckUtils]: 59: Hoare triple {7734#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7716#false} is VALID [2018-11-23 11:58:45,622 INFO L273 TraceCheckUtils]: 60: Hoare triple {7716#false} havoc ~x~0;~x~0 := 0; {7716#false} is VALID [2018-11-23 11:58:45,623 INFO L273 TraceCheckUtils]: 61: Hoare triple {7716#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {7716#false} is VALID [2018-11-23 11:58:45,623 INFO L256 TraceCheckUtils]: 62: Hoare triple {7716#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {7716#false} is VALID [2018-11-23 11:58:45,623 INFO L273 TraceCheckUtils]: 63: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2018-11-23 11:58:45,623 INFO L273 TraceCheckUtils]: 64: Hoare triple {7716#false} assume 0 == ~cond; {7716#false} is VALID [2018-11-23 11:58:45,623 INFO L273 TraceCheckUtils]: 65: Hoare triple {7716#false} assume !false; {7716#false} is VALID [2018-11-23 11:58:45,627 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:45,627 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:45,627 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-23 11:58:45,638 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:58:45,681 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2018-11-23 11:58:45,681 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:45,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:45,701 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:45,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {7715#true} call ULTIMATE.init(); {7715#true} is VALID [2018-11-23 11:58:45,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {7715#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {7715#true} is VALID [2018-11-23 11:58:45,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {7715#true} assume true; {7715#true} is VALID [2018-11-23 11:58:45,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7715#true} {7715#true} #88#return; {7715#true} is VALID [2018-11-23 11:58:45,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {7715#true} call #t~ret13 := main(); {7715#true} is VALID [2018-11-23 11:58:45,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {7715#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {7715#true} is VALID [2018-11-23 11:58:45,933 INFO L273 TraceCheckUtils]: 6: Hoare triple {7715#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {7715#true} is VALID [2018-11-23 11:58:45,933 INFO L273 TraceCheckUtils]: 7: Hoare triple {7715#true} ~i~0 := 2; {7717#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {7717#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7717#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {7717#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7717#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:45,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {7717#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7718#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,935 INFO L273 TraceCheckUtils]: 11: Hoare triple {7718#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7718#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {7718#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7718#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:45,936 INFO L273 TraceCheckUtils]: 13: Hoare triple {7718#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7719#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,936 INFO L273 TraceCheckUtils]: 14: Hoare triple {7719#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7719#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {7719#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7719#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:45,937 INFO L273 TraceCheckUtils]: 16: Hoare triple {7719#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7720#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {7720#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7720#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,938 INFO L273 TraceCheckUtils]: 18: Hoare triple {7720#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7720#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:45,939 INFO L273 TraceCheckUtils]: 19: Hoare triple {7720#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7721#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,939 INFO L273 TraceCheckUtils]: 20: Hoare triple {7721#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7721#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,940 INFO L273 TraceCheckUtils]: 21: Hoare triple {7721#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7721#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:45,941 INFO L273 TraceCheckUtils]: 22: Hoare triple {7721#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7722#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:45,941 INFO L273 TraceCheckUtils]: 23: Hoare triple {7722#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7722#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:45,941 INFO L273 TraceCheckUtils]: 24: Hoare triple {7722#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7722#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:45,942 INFO L273 TraceCheckUtils]: 25: Hoare triple {7722#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7723#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:45,943 INFO L273 TraceCheckUtils]: 26: Hoare triple {7723#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7723#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:45,943 INFO L273 TraceCheckUtils]: 27: Hoare triple {7723#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7723#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:45,944 INFO L273 TraceCheckUtils]: 28: Hoare triple {7723#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7724#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:45,944 INFO L273 TraceCheckUtils]: 29: Hoare triple {7724#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7724#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:45,945 INFO L273 TraceCheckUtils]: 30: Hoare triple {7724#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7724#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:45,948 INFO L273 TraceCheckUtils]: 31: Hoare triple {7724#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7725#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:45,948 INFO L273 TraceCheckUtils]: 32: Hoare triple {7725#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7725#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:45,949 INFO L273 TraceCheckUtils]: 33: Hoare triple {7725#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7725#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:45,949 INFO L273 TraceCheckUtils]: 34: Hoare triple {7725#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7726#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:45,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {7726#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7726#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:45,950 INFO L273 TraceCheckUtils]: 36: Hoare triple {7726#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7726#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:45,950 INFO L273 TraceCheckUtils]: 37: Hoare triple {7726#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7727#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:45,951 INFO L273 TraceCheckUtils]: 38: Hoare triple {7727#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7727#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:45,951 INFO L273 TraceCheckUtils]: 39: Hoare triple {7727#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7727#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:45,952 INFO L273 TraceCheckUtils]: 40: Hoare triple {7727#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7728#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:45,952 INFO L273 TraceCheckUtils]: 41: Hoare triple {7728#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7728#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:45,953 INFO L273 TraceCheckUtils]: 42: Hoare triple {7728#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7728#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:45,953 INFO L273 TraceCheckUtils]: 43: Hoare triple {7728#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7729#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:45,954 INFO L273 TraceCheckUtils]: 44: Hoare triple {7729#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7729#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:45,954 INFO L273 TraceCheckUtils]: 45: Hoare triple {7729#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7729#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:45,955 INFO L273 TraceCheckUtils]: 46: Hoare triple {7729#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7730#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:45,956 INFO L273 TraceCheckUtils]: 47: Hoare triple {7730#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7730#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:45,956 INFO L273 TraceCheckUtils]: 48: Hoare triple {7730#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7730#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:45,957 INFO L273 TraceCheckUtils]: 49: Hoare triple {7730#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7731#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:45,957 INFO L273 TraceCheckUtils]: 50: Hoare triple {7731#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7731#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:45,958 INFO L273 TraceCheckUtils]: 51: Hoare triple {7731#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7731#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:45,959 INFO L273 TraceCheckUtils]: 52: Hoare triple {7731#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7732#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:45,959 INFO L273 TraceCheckUtils]: 53: Hoare triple {7732#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7732#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:45,960 INFO L273 TraceCheckUtils]: 54: Hoare triple {7732#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7732#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:45,960 INFO L273 TraceCheckUtils]: 55: Hoare triple {7732#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7733#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:45,961 INFO L273 TraceCheckUtils]: 56: Hoare triple {7733#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {7733#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:45,961 INFO L273 TraceCheckUtils]: 57: Hoare triple {7733#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {7733#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:45,962 INFO L273 TraceCheckUtils]: 58: Hoare triple {7733#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {7734#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:45,963 INFO L273 TraceCheckUtils]: 59: Hoare triple {7734#(<= main_~i~0 19)} assume !(~i~0 < 100000); {7716#false} is VALID [2018-11-23 11:58:45,963 INFO L273 TraceCheckUtils]: 60: Hoare triple {7716#false} havoc ~x~0;~x~0 := 0; {7716#false} is VALID [2018-11-23 11:58:45,963 INFO L273 TraceCheckUtils]: 61: Hoare triple {7716#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {7716#false} is VALID [2018-11-23 11:58:45,963 INFO L256 TraceCheckUtils]: 62: Hoare triple {7716#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {7716#false} is VALID [2018-11-23 11:58:45,963 INFO L273 TraceCheckUtils]: 63: Hoare triple {7716#false} ~cond := #in~cond; {7716#false} is VALID [2018-11-23 11:58:45,964 INFO L273 TraceCheckUtils]: 64: Hoare triple {7716#false} assume 0 == ~cond; {7716#false} is VALID [2018-11-23 11:58:45,964 INFO L273 TraceCheckUtils]: 65: Hoare triple {7716#false} assume !false; {7716#false} is VALID [2018-11-23 11:58:45,967 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:45,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:45,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 20 [2018-11-23 11:58:45,986 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2018-11-23 11:58:45,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:45,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2018-11-23 11:58:46,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:46,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 11:58:46,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 11:58:46,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:58:46,052 INFO L87 Difference]: Start difference. First operand 94 states and 133 transitions. Second operand 20 states. [2018-11-23 11:58:46,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:46,713 INFO L93 Difference]: Finished difference Result 118 states and 165 transitions. [2018-11-23 11:58:46,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 11:58:46,713 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2018-11-23 11:58:46,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:46,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:46,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 165 transitions. [2018-11-23 11:58:46,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 11:58:46,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 165 transitions. [2018-11-23 11:58:46,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 165 transitions. [2018-11-23 11:58:46,987 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:46,989 INFO L225 Difference]: With dead ends: 118 [2018-11-23 11:58:46,989 INFO L226 Difference]: Without dead ends: 101 [2018-11-23 11:58:46,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:58:46,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-11-23 11:58:47,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-11-23 11:58:47,011 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:47,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand 98 states. [2018-11-23 11:58:47,011 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand 98 states. [2018-11-23 11:58:47,011 INFO L87 Difference]: Start difference. First operand 101 states. Second operand 98 states. [2018-11-23 11:58:47,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:47,014 INFO L93 Difference]: Finished difference Result 101 states and 144 transitions. [2018-11-23 11:58:47,014 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2018-11-23 11:58:47,014 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:47,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:47,014 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 101 states. [2018-11-23 11:58:47,015 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 101 states. [2018-11-23 11:58:47,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:47,017 INFO L93 Difference]: Finished difference Result 101 states and 144 transitions. [2018-11-23 11:58:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 144 transitions. [2018-11-23 11:58:47,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:47,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:47,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:47,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:47,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-11-23 11:58:47,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 139 transitions. [2018-11-23 11:58:47,020 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 139 transitions. Word has length 66 [2018-11-23 11:58:47,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:47,020 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 139 transitions. [2018-11-23 11:58:47,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 11:58:47,021 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 139 transitions. [2018-11-23 11:58:47,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 11:58:47,022 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:47,022 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:47,022 INFO L423 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:47,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:47,022 INFO L82 PathProgramCache]: Analyzing trace with hash 474386236, now seen corresponding path program 18 times [2018-11-23 11:58:47,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:47,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:47,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:47,024 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:47,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:47,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:48,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {8411#true} call ULTIMATE.init(); {8411#true} is VALID [2018-11-23 11:58:48,467 INFO L273 TraceCheckUtils]: 1: Hoare triple {8411#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8411#true} is VALID [2018-11-23 11:58:48,467 INFO L273 TraceCheckUtils]: 2: Hoare triple {8411#true} assume true; {8411#true} is VALID [2018-11-23 11:58:48,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8411#true} {8411#true} #88#return; {8411#true} is VALID [2018-11-23 11:58:48,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {8411#true} call #t~ret13 := main(); {8411#true} is VALID [2018-11-23 11:58:48,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {8411#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {8411#true} is VALID [2018-11-23 11:58:48,468 INFO L273 TraceCheckUtils]: 6: Hoare triple {8411#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {8411#true} is VALID [2018-11-23 11:58:48,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {8411#true} ~i~0 := 2; {8413#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,469 INFO L273 TraceCheckUtils]: 8: Hoare triple {8413#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8413#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,470 INFO L273 TraceCheckUtils]: 9: Hoare triple {8413#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8413#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,470 INFO L273 TraceCheckUtils]: 10: Hoare triple {8413#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8414#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {8414#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8414#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {8414#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8414#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,471 INFO L273 TraceCheckUtils]: 13: Hoare triple {8414#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8415#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:48,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {8415#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8415#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:48,472 INFO L273 TraceCheckUtils]: 15: Hoare triple {8415#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8415#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:48,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {8415#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8416#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:48,473 INFO L273 TraceCheckUtils]: 17: Hoare triple {8416#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8416#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:48,474 INFO L273 TraceCheckUtils]: 18: Hoare triple {8416#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8416#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:48,474 INFO L273 TraceCheckUtils]: 19: Hoare triple {8416#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8417#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:48,475 INFO L273 TraceCheckUtils]: 20: Hoare triple {8417#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8417#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:48,475 INFO L273 TraceCheckUtils]: 21: Hoare triple {8417#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8417#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:48,476 INFO L273 TraceCheckUtils]: 22: Hoare triple {8417#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8418#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:48,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {8418#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8418#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:48,477 INFO L273 TraceCheckUtils]: 24: Hoare triple {8418#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8418#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:48,478 INFO L273 TraceCheckUtils]: 25: Hoare triple {8418#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8419#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:48,478 INFO L273 TraceCheckUtils]: 26: Hoare triple {8419#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8419#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:48,479 INFO L273 TraceCheckUtils]: 27: Hoare triple {8419#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8419#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:48,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {8419#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8420#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:48,480 INFO L273 TraceCheckUtils]: 29: Hoare triple {8420#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8420#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:48,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {8420#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8420#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:48,481 INFO L273 TraceCheckUtils]: 31: Hoare triple {8420#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8421#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:48,482 INFO L273 TraceCheckUtils]: 32: Hoare triple {8421#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8421#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:48,482 INFO L273 TraceCheckUtils]: 33: Hoare triple {8421#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8421#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:48,483 INFO L273 TraceCheckUtils]: 34: Hoare triple {8421#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8422#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:48,484 INFO L273 TraceCheckUtils]: 35: Hoare triple {8422#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8422#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:48,484 INFO L273 TraceCheckUtils]: 36: Hoare triple {8422#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8422#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:48,485 INFO L273 TraceCheckUtils]: 37: Hoare triple {8422#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8423#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:48,485 INFO L273 TraceCheckUtils]: 38: Hoare triple {8423#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8423#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:48,486 INFO L273 TraceCheckUtils]: 39: Hoare triple {8423#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8423#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:48,487 INFO L273 TraceCheckUtils]: 40: Hoare triple {8423#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8424#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:48,487 INFO L273 TraceCheckUtils]: 41: Hoare triple {8424#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8424#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:48,488 INFO L273 TraceCheckUtils]: 42: Hoare triple {8424#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8424#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:48,488 INFO L273 TraceCheckUtils]: 43: Hoare triple {8424#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8425#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:48,489 INFO L273 TraceCheckUtils]: 44: Hoare triple {8425#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8425#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:48,489 INFO L273 TraceCheckUtils]: 45: Hoare triple {8425#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8425#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:48,490 INFO L273 TraceCheckUtils]: 46: Hoare triple {8425#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8426#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:48,491 INFO L273 TraceCheckUtils]: 47: Hoare triple {8426#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8426#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:48,491 INFO L273 TraceCheckUtils]: 48: Hoare triple {8426#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8426#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:48,492 INFO L273 TraceCheckUtils]: 49: Hoare triple {8426#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8427#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:48,492 INFO L273 TraceCheckUtils]: 50: Hoare triple {8427#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8427#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:48,493 INFO L273 TraceCheckUtils]: 51: Hoare triple {8427#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8427#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:48,494 INFO L273 TraceCheckUtils]: 52: Hoare triple {8427#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8428#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:48,494 INFO L273 TraceCheckUtils]: 53: Hoare triple {8428#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8428#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:48,495 INFO L273 TraceCheckUtils]: 54: Hoare triple {8428#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8428#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:48,496 INFO L273 TraceCheckUtils]: 55: Hoare triple {8428#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8429#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:48,496 INFO L273 TraceCheckUtils]: 56: Hoare triple {8429#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8429#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:48,497 INFO L273 TraceCheckUtils]: 57: Hoare triple {8429#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8429#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:48,497 INFO L273 TraceCheckUtils]: 58: Hoare triple {8429#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8430#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:48,498 INFO L273 TraceCheckUtils]: 59: Hoare triple {8430#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8430#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:48,498 INFO L273 TraceCheckUtils]: 60: Hoare triple {8430#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8430#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:48,499 INFO L273 TraceCheckUtils]: 61: Hoare triple {8430#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8431#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:48,500 INFO L273 TraceCheckUtils]: 62: Hoare triple {8431#(<= main_~i~0 20)} assume !(~i~0 < 100000); {8412#false} is VALID [2018-11-23 11:58:48,500 INFO L273 TraceCheckUtils]: 63: Hoare triple {8412#false} havoc ~x~0;~x~0 := 0; {8412#false} is VALID [2018-11-23 11:58:48,500 INFO L273 TraceCheckUtils]: 64: Hoare triple {8412#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {8412#false} is VALID [2018-11-23 11:58:48,500 INFO L256 TraceCheckUtils]: 65: Hoare triple {8412#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {8412#false} is VALID [2018-11-23 11:58:48,501 INFO L273 TraceCheckUtils]: 66: Hoare triple {8412#false} ~cond := #in~cond; {8412#false} is VALID [2018-11-23 11:58:48,501 INFO L273 TraceCheckUtils]: 67: Hoare triple {8412#false} assume 0 == ~cond; {8412#false} is VALID [2018-11-23 11:58:48,501 INFO L273 TraceCheckUtils]: 68: Hoare triple {8412#false} assume !false; {8412#false} is VALID [2018-11-23 11:58:48,506 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:48,506 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:48,507 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-23 11:58:48,523 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:58:48,603 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2018-11-23 11:58:48,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:48,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:48,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {8411#true} call ULTIMATE.init(); {8411#true} is VALID [2018-11-23 11:58:48,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {8411#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {8411#true} is VALID [2018-11-23 11:58:48,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {8411#true} assume true; {8411#true} is VALID [2018-11-23 11:58:48,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {8411#true} {8411#true} #88#return; {8411#true} is VALID [2018-11-23 11:58:48,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {8411#true} call #t~ret13 := main(); {8411#true} is VALID [2018-11-23 11:58:48,851 INFO L273 TraceCheckUtils]: 5: Hoare triple {8411#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {8411#true} is VALID [2018-11-23 11:58:48,851 INFO L273 TraceCheckUtils]: 6: Hoare triple {8411#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {8411#true} is VALID [2018-11-23 11:58:48,866 INFO L273 TraceCheckUtils]: 7: Hoare triple {8411#true} ~i~0 := 2; {8413#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,875 INFO L273 TraceCheckUtils]: 8: Hoare triple {8413#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8413#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,889 INFO L273 TraceCheckUtils]: 9: Hoare triple {8413#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8413#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:48,898 INFO L273 TraceCheckUtils]: 10: Hoare triple {8413#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8414#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,912 INFO L273 TraceCheckUtils]: 11: Hoare triple {8414#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8414#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,920 INFO L273 TraceCheckUtils]: 12: Hoare triple {8414#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8414#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:48,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {8414#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8415#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:48,927 INFO L273 TraceCheckUtils]: 14: Hoare triple {8415#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8415#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:48,932 INFO L273 TraceCheckUtils]: 15: Hoare triple {8415#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8415#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:48,932 INFO L273 TraceCheckUtils]: 16: Hoare triple {8415#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8416#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:48,933 INFO L273 TraceCheckUtils]: 17: Hoare triple {8416#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8416#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:48,933 INFO L273 TraceCheckUtils]: 18: Hoare triple {8416#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8416#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:48,933 INFO L273 TraceCheckUtils]: 19: Hoare triple {8416#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8417#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:48,934 INFO L273 TraceCheckUtils]: 20: Hoare triple {8417#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8417#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:48,934 INFO L273 TraceCheckUtils]: 21: Hoare triple {8417#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8417#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:48,934 INFO L273 TraceCheckUtils]: 22: Hoare triple {8417#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8418#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:48,935 INFO L273 TraceCheckUtils]: 23: Hoare triple {8418#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8418#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:48,935 INFO L273 TraceCheckUtils]: 24: Hoare triple {8418#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8418#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:48,936 INFO L273 TraceCheckUtils]: 25: Hoare triple {8418#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8419#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:48,936 INFO L273 TraceCheckUtils]: 26: Hoare triple {8419#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8419#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:48,937 INFO L273 TraceCheckUtils]: 27: Hoare triple {8419#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8419#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:48,937 INFO L273 TraceCheckUtils]: 28: Hoare triple {8419#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8420#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:48,938 INFO L273 TraceCheckUtils]: 29: Hoare triple {8420#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8420#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:48,938 INFO L273 TraceCheckUtils]: 30: Hoare triple {8420#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8420#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:48,939 INFO L273 TraceCheckUtils]: 31: Hoare triple {8420#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8421#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:48,940 INFO L273 TraceCheckUtils]: 32: Hoare triple {8421#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8421#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:48,940 INFO L273 TraceCheckUtils]: 33: Hoare triple {8421#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8421#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:48,941 INFO L273 TraceCheckUtils]: 34: Hoare triple {8421#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8422#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:48,941 INFO L273 TraceCheckUtils]: 35: Hoare triple {8422#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8422#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:48,942 INFO L273 TraceCheckUtils]: 36: Hoare triple {8422#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8422#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:48,942 INFO L273 TraceCheckUtils]: 37: Hoare triple {8422#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8423#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:48,943 INFO L273 TraceCheckUtils]: 38: Hoare triple {8423#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8423#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:48,943 INFO L273 TraceCheckUtils]: 39: Hoare triple {8423#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8423#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:48,944 INFO L273 TraceCheckUtils]: 40: Hoare triple {8423#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8424#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:48,945 INFO L273 TraceCheckUtils]: 41: Hoare triple {8424#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8424#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:48,945 INFO L273 TraceCheckUtils]: 42: Hoare triple {8424#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8424#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:48,946 INFO L273 TraceCheckUtils]: 43: Hoare triple {8424#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8425#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:48,946 INFO L273 TraceCheckUtils]: 44: Hoare triple {8425#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8425#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:48,947 INFO L273 TraceCheckUtils]: 45: Hoare triple {8425#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8425#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:48,948 INFO L273 TraceCheckUtils]: 46: Hoare triple {8425#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8426#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:48,948 INFO L273 TraceCheckUtils]: 47: Hoare triple {8426#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8426#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:48,949 INFO L273 TraceCheckUtils]: 48: Hoare triple {8426#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8426#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:48,949 INFO L273 TraceCheckUtils]: 49: Hoare triple {8426#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8427#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:48,950 INFO L273 TraceCheckUtils]: 50: Hoare triple {8427#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8427#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:48,950 INFO L273 TraceCheckUtils]: 51: Hoare triple {8427#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8427#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:48,951 INFO L273 TraceCheckUtils]: 52: Hoare triple {8427#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8428#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:48,952 INFO L273 TraceCheckUtils]: 53: Hoare triple {8428#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8428#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:48,952 INFO L273 TraceCheckUtils]: 54: Hoare triple {8428#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8428#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:48,953 INFO L273 TraceCheckUtils]: 55: Hoare triple {8428#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8429#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:48,953 INFO L273 TraceCheckUtils]: 56: Hoare triple {8429#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8429#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:48,954 INFO L273 TraceCheckUtils]: 57: Hoare triple {8429#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8429#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:48,955 INFO L273 TraceCheckUtils]: 58: Hoare triple {8429#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8430#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:48,955 INFO L273 TraceCheckUtils]: 59: Hoare triple {8430#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {8430#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:48,956 INFO L273 TraceCheckUtils]: 60: Hoare triple {8430#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {8430#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:48,956 INFO L273 TraceCheckUtils]: 61: Hoare triple {8430#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {8431#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:48,957 INFO L273 TraceCheckUtils]: 62: Hoare triple {8431#(<= main_~i~0 20)} assume !(~i~0 < 100000); {8412#false} is VALID [2018-11-23 11:58:48,957 INFO L273 TraceCheckUtils]: 63: Hoare triple {8412#false} havoc ~x~0;~x~0 := 0; {8412#false} is VALID [2018-11-23 11:58:48,958 INFO L273 TraceCheckUtils]: 64: Hoare triple {8412#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {8412#false} is VALID [2018-11-23 11:58:48,958 INFO L256 TraceCheckUtils]: 65: Hoare triple {8412#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {8412#false} is VALID [2018-11-23 11:58:48,958 INFO L273 TraceCheckUtils]: 66: Hoare triple {8412#false} ~cond := #in~cond; {8412#false} is VALID [2018-11-23 11:58:48,958 INFO L273 TraceCheckUtils]: 67: Hoare triple {8412#false} assume 0 == ~cond; {8412#false} is VALID [2018-11-23 11:58:48,958 INFO L273 TraceCheckUtils]: 68: Hoare triple {8412#false} assume !false; {8412#false} is VALID [2018-11-23 11:58:48,963 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:48,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:48,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 21 [2018-11-23 11:58:48,982 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-11-23 11:58:48,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:48,982 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2018-11-23 11:58:49,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:49,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 11:58:49,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 11:58:49,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:58:49,053 INFO L87 Difference]: Start difference. First operand 98 states and 139 transitions. Second operand 21 states. [2018-11-23 11:58:49,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:49,688 INFO L93 Difference]: Finished difference Result 122 states and 171 transitions. [2018-11-23 11:58:49,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 11:58:49,688 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-11-23 11:58:49,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:49,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:58:49,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 171 transitions. [2018-11-23 11:58:49,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 11:58:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 171 transitions. [2018-11-23 11:58:49,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 171 transitions. [2018-11-23 11:58:49,914 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:49,917 INFO L225 Difference]: With dead ends: 122 [2018-11-23 11:58:49,917 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 11:58:49,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-11-23 11:58:49,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 11:58:49,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2018-11-23 11:58:49,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:49,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand 102 states. [2018-11-23 11:58:49,936 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand 102 states. [2018-11-23 11:58:49,936 INFO L87 Difference]: Start difference. First operand 105 states. Second operand 102 states. [2018-11-23 11:58:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:49,938 INFO L93 Difference]: Finished difference Result 105 states and 150 transitions. [2018-11-23 11:58:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2018-11-23 11:58:49,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:49,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:49,939 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand 105 states. [2018-11-23 11:58:49,939 INFO L87 Difference]: Start difference. First operand 102 states. Second operand 105 states. [2018-11-23 11:58:49,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:49,941 INFO L93 Difference]: Finished difference Result 105 states and 150 transitions. [2018-11-23 11:58:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2018-11-23 11:58:49,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:49,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:49,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:49,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:49,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-11-23 11:58:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 145 transitions. [2018-11-23 11:58:49,944 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 145 transitions. Word has length 69 [2018-11-23 11:58:49,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:49,944 INFO L480 AbstractCegarLoop]: Abstraction has 102 states and 145 transitions. [2018-11-23 11:58:49,944 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 11:58:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 145 transitions. [2018-11-23 11:58:49,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 11:58:49,945 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:49,946 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:49,946 INFO L423 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:49,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:49,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1647232543, now seen corresponding path program 19 times [2018-11-23 11:58:49,946 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:49,946 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:49,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:49,947 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:49,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:49,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:50,392 INFO L256 TraceCheckUtils]: 0: Hoare triple {9135#true} call ULTIMATE.init(); {9135#true} is VALID [2018-11-23 11:58:50,392 INFO L273 TraceCheckUtils]: 1: Hoare triple {9135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9135#true} is VALID [2018-11-23 11:58:50,392 INFO L273 TraceCheckUtils]: 2: Hoare triple {9135#true} assume true; {9135#true} is VALID [2018-11-23 11:58:50,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9135#true} {9135#true} #88#return; {9135#true} is VALID [2018-11-23 11:58:50,393 INFO L256 TraceCheckUtils]: 4: Hoare triple {9135#true} call #t~ret13 := main(); {9135#true} is VALID [2018-11-23 11:58:50,393 INFO L273 TraceCheckUtils]: 5: Hoare triple {9135#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {9135#true} is VALID [2018-11-23 11:58:50,393 INFO L273 TraceCheckUtils]: 6: Hoare triple {9135#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {9135#true} is VALID [2018-11-23 11:58:50,394 INFO L273 TraceCheckUtils]: 7: Hoare triple {9135#true} ~i~0 := 2; {9137#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,394 INFO L273 TraceCheckUtils]: 8: Hoare triple {9137#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9137#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,395 INFO L273 TraceCheckUtils]: 9: Hoare triple {9137#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9137#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,396 INFO L273 TraceCheckUtils]: 10: Hoare triple {9137#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9138#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,396 INFO L273 TraceCheckUtils]: 11: Hoare triple {9138#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9138#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,397 INFO L273 TraceCheckUtils]: 12: Hoare triple {9138#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9138#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,397 INFO L273 TraceCheckUtils]: 13: Hoare triple {9138#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9139#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,398 INFO L273 TraceCheckUtils]: 14: Hoare triple {9139#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9139#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,398 INFO L273 TraceCheckUtils]: 15: Hoare triple {9139#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9139#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,399 INFO L273 TraceCheckUtils]: 16: Hoare triple {9139#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9140#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,400 INFO L273 TraceCheckUtils]: 17: Hoare triple {9140#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9140#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {9140#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9140#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {9140#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9141#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,401 INFO L273 TraceCheckUtils]: 20: Hoare triple {9141#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9141#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {9141#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9141#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,403 INFO L273 TraceCheckUtils]: 22: Hoare triple {9141#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9142#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,403 INFO L273 TraceCheckUtils]: 23: Hoare triple {9142#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9142#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,404 INFO L273 TraceCheckUtils]: 24: Hoare triple {9142#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9142#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,405 INFO L273 TraceCheckUtils]: 25: Hoare triple {9142#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9143#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,405 INFO L273 TraceCheckUtils]: 26: Hoare triple {9143#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9143#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,405 INFO L273 TraceCheckUtils]: 27: Hoare triple {9143#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9143#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,406 INFO L273 TraceCheckUtils]: 28: Hoare triple {9143#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {9144#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9144#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {9144#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9144#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,408 INFO L273 TraceCheckUtils]: 31: Hoare triple {9144#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9145#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,408 INFO L273 TraceCheckUtils]: 32: Hoare triple {9145#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9145#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,409 INFO L273 TraceCheckUtils]: 33: Hoare triple {9145#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9145#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,410 INFO L273 TraceCheckUtils]: 34: Hoare triple {9145#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9146#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:50,410 INFO L273 TraceCheckUtils]: 35: Hoare triple {9146#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9146#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:50,411 INFO L273 TraceCheckUtils]: 36: Hoare triple {9146#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9146#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:50,411 INFO L273 TraceCheckUtils]: 37: Hoare triple {9146#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9147#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:50,412 INFO L273 TraceCheckUtils]: 38: Hoare triple {9147#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9147#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:50,412 INFO L273 TraceCheckUtils]: 39: Hoare triple {9147#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9147#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:50,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {9147#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9148#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:50,414 INFO L273 TraceCheckUtils]: 41: Hoare triple {9148#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9148#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:50,414 INFO L273 TraceCheckUtils]: 42: Hoare triple {9148#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9148#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:50,415 INFO L273 TraceCheckUtils]: 43: Hoare triple {9148#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9149#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:50,416 INFO L273 TraceCheckUtils]: 44: Hoare triple {9149#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9149#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:50,416 INFO L273 TraceCheckUtils]: 45: Hoare triple {9149#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9149#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:50,417 INFO L273 TraceCheckUtils]: 46: Hoare triple {9149#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9150#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:50,417 INFO L273 TraceCheckUtils]: 47: Hoare triple {9150#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9150#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:50,418 INFO L273 TraceCheckUtils]: 48: Hoare triple {9150#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9150#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:50,419 INFO L273 TraceCheckUtils]: 49: Hoare triple {9150#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9151#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:50,419 INFO L273 TraceCheckUtils]: 50: Hoare triple {9151#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9151#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:50,420 INFO L273 TraceCheckUtils]: 51: Hoare triple {9151#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9151#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:50,420 INFO L273 TraceCheckUtils]: 52: Hoare triple {9151#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9152#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:50,421 INFO L273 TraceCheckUtils]: 53: Hoare triple {9152#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9152#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:50,421 INFO L273 TraceCheckUtils]: 54: Hoare triple {9152#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9152#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:50,422 INFO L273 TraceCheckUtils]: 55: Hoare triple {9152#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9153#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:50,423 INFO L273 TraceCheckUtils]: 56: Hoare triple {9153#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9153#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:50,423 INFO L273 TraceCheckUtils]: 57: Hoare triple {9153#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9153#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:50,424 INFO L273 TraceCheckUtils]: 58: Hoare triple {9153#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9154#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:50,424 INFO L273 TraceCheckUtils]: 59: Hoare triple {9154#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9154#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:50,425 INFO L273 TraceCheckUtils]: 60: Hoare triple {9154#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9154#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:50,426 INFO L273 TraceCheckUtils]: 61: Hoare triple {9154#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9155#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:50,426 INFO L273 TraceCheckUtils]: 62: Hoare triple {9155#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9155#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:50,427 INFO L273 TraceCheckUtils]: 63: Hoare triple {9155#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9155#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:50,427 INFO L273 TraceCheckUtils]: 64: Hoare triple {9155#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9156#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:50,428 INFO L273 TraceCheckUtils]: 65: Hoare triple {9156#(<= main_~i~0 21)} assume !(~i~0 < 100000); {9136#false} is VALID [2018-11-23 11:58:50,428 INFO L273 TraceCheckUtils]: 66: Hoare triple {9136#false} havoc ~x~0;~x~0 := 0; {9136#false} is VALID [2018-11-23 11:58:50,428 INFO L273 TraceCheckUtils]: 67: Hoare triple {9136#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {9136#false} is VALID [2018-11-23 11:58:50,429 INFO L256 TraceCheckUtils]: 68: Hoare triple {9136#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {9136#false} is VALID [2018-11-23 11:58:50,429 INFO L273 TraceCheckUtils]: 69: Hoare triple {9136#false} ~cond := #in~cond; {9136#false} is VALID [2018-11-23 11:58:50,429 INFO L273 TraceCheckUtils]: 70: Hoare triple {9136#false} assume 0 == ~cond; {9136#false} is VALID [2018-11-23 11:58:50,429 INFO L273 TraceCheckUtils]: 71: Hoare triple {9136#false} assume !false; {9136#false} is VALID [2018-11-23 11:58:50,433 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:50,433 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:50,433 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-23 11:58:50,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:50,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:50,667 INFO L256 TraceCheckUtils]: 0: Hoare triple {9135#true} call ULTIMATE.init(); {9135#true} is VALID [2018-11-23 11:58:50,668 INFO L273 TraceCheckUtils]: 1: Hoare triple {9135#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9135#true} is VALID [2018-11-23 11:58:50,668 INFO L273 TraceCheckUtils]: 2: Hoare triple {9135#true} assume true; {9135#true} is VALID [2018-11-23 11:58:50,668 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9135#true} {9135#true} #88#return; {9135#true} is VALID [2018-11-23 11:58:50,668 INFO L256 TraceCheckUtils]: 4: Hoare triple {9135#true} call #t~ret13 := main(); {9135#true} is VALID [2018-11-23 11:58:50,669 INFO L273 TraceCheckUtils]: 5: Hoare triple {9135#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {9135#true} is VALID [2018-11-23 11:58:50,669 INFO L273 TraceCheckUtils]: 6: Hoare triple {9135#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {9135#true} is VALID [2018-11-23 11:58:50,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {9135#true} ~i~0 := 2; {9137#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {9137#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9137#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,681 INFO L273 TraceCheckUtils]: 9: Hoare triple {9137#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9137#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:50,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {9137#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9138#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,682 INFO L273 TraceCheckUtils]: 11: Hoare triple {9138#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9138#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,682 INFO L273 TraceCheckUtils]: 12: Hoare triple {9138#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9138#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:50,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {9138#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9139#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,683 INFO L273 TraceCheckUtils]: 14: Hoare triple {9139#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9139#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,683 INFO L273 TraceCheckUtils]: 15: Hoare triple {9139#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9139#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:50,683 INFO L273 TraceCheckUtils]: 16: Hoare triple {9139#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9140#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,684 INFO L273 TraceCheckUtils]: 17: Hoare triple {9140#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9140#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,684 INFO L273 TraceCheckUtils]: 18: Hoare triple {9140#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9140#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:50,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {9140#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9141#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {9141#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9141#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,686 INFO L273 TraceCheckUtils]: 21: Hoare triple {9141#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9141#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:50,687 INFO L273 TraceCheckUtils]: 22: Hoare triple {9141#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9142#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,687 INFO L273 TraceCheckUtils]: 23: Hoare triple {9142#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9142#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,688 INFO L273 TraceCheckUtils]: 24: Hoare triple {9142#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9142#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:50,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {9142#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9143#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {9143#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9143#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,689 INFO L273 TraceCheckUtils]: 27: Hoare triple {9143#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9143#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:50,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {9143#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9144#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,691 INFO L273 TraceCheckUtils]: 29: Hoare triple {9144#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9144#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {9144#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9144#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:50,692 INFO L273 TraceCheckUtils]: 31: Hoare triple {9144#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9145#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {9145#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9145#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,693 INFO L273 TraceCheckUtils]: 33: Hoare triple {9145#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9145#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:50,694 INFO L273 TraceCheckUtils]: 34: Hoare triple {9145#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9146#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:50,694 INFO L273 TraceCheckUtils]: 35: Hoare triple {9146#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9146#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:50,695 INFO L273 TraceCheckUtils]: 36: Hoare triple {9146#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9146#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:50,695 INFO L273 TraceCheckUtils]: 37: Hoare triple {9146#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9147#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:50,696 INFO L273 TraceCheckUtils]: 38: Hoare triple {9147#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9147#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:50,696 INFO L273 TraceCheckUtils]: 39: Hoare triple {9147#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9147#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:50,697 INFO L273 TraceCheckUtils]: 40: Hoare triple {9147#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9148#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:50,698 INFO L273 TraceCheckUtils]: 41: Hoare triple {9148#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9148#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:50,698 INFO L273 TraceCheckUtils]: 42: Hoare triple {9148#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9148#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:50,699 INFO L273 TraceCheckUtils]: 43: Hoare triple {9148#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9149#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:50,700 INFO L273 TraceCheckUtils]: 44: Hoare triple {9149#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9149#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:50,700 INFO L273 TraceCheckUtils]: 45: Hoare triple {9149#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9149#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:50,701 INFO L273 TraceCheckUtils]: 46: Hoare triple {9149#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9150#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:50,701 INFO L273 TraceCheckUtils]: 47: Hoare triple {9150#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9150#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:50,702 INFO L273 TraceCheckUtils]: 48: Hoare triple {9150#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9150#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:50,703 INFO L273 TraceCheckUtils]: 49: Hoare triple {9150#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9151#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:50,703 INFO L273 TraceCheckUtils]: 50: Hoare triple {9151#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9151#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:50,704 INFO L273 TraceCheckUtils]: 51: Hoare triple {9151#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9151#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:50,704 INFO L273 TraceCheckUtils]: 52: Hoare triple {9151#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9152#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:50,705 INFO L273 TraceCheckUtils]: 53: Hoare triple {9152#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9152#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:50,705 INFO L273 TraceCheckUtils]: 54: Hoare triple {9152#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9152#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:50,706 INFO L273 TraceCheckUtils]: 55: Hoare triple {9152#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9153#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:50,707 INFO L273 TraceCheckUtils]: 56: Hoare triple {9153#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9153#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:50,707 INFO L273 TraceCheckUtils]: 57: Hoare triple {9153#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9153#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:50,708 INFO L273 TraceCheckUtils]: 58: Hoare triple {9153#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9154#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:50,708 INFO L273 TraceCheckUtils]: 59: Hoare triple {9154#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9154#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:50,709 INFO L273 TraceCheckUtils]: 60: Hoare triple {9154#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9154#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:50,710 INFO L273 TraceCheckUtils]: 61: Hoare triple {9154#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9155#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:50,710 INFO L273 TraceCheckUtils]: 62: Hoare triple {9155#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9155#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:50,711 INFO L273 TraceCheckUtils]: 63: Hoare triple {9155#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9155#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:50,711 INFO L273 TraceCheckUtils]: 64: Hoare triple {9155#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9156#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:50,712 INFO L273 TraceCheckUtils]: 65: Hoare triple {9156#(<= main_~i~0 21)} assume !(~i~0 < 100000); {9136#false} is VALID [2018-11-23 11:58:50,712 INFO L273 TraceCheckUtils]: 66: Hoare triple {9136#false} havoc ~x~0;~x~0 := 0; {9136#false} is VALID [2018-11-23 11:58:50,713 INFO L273 TraceCheckUtils]: 67: Hoare triple {9136#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {9136#false} is VALID [2018-11-23 11:58:50,713 INFO L256 TraceCheckUtils]: 68: Hoare triple {9136#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {9136#false} is VALID [2018-11-23 11:58:50,713 INFO L273 TraceCheckUtils]: 69: Hoare triple {9136#false} ~cond := #in~cond; {9136#false} is VALID [2018-11-23 11:58:50,713 INFO L273 TraceCheckUtils]: 70: Hoare triple {9136#false} assume 0 == ~cond; {9136#false} is VALID [2018-11-23 11:58:50,713 INFO L273 TraceCheckUtils]: 71: Hoare triple {9136#false} assume !false; {9136#false} is VALID [2018-11-23 11:58:50,718 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:50,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:50,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 22 [2018-11-23 11:58:50,737 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-11-23 11:58:50,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:50,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2018-11-23 11:58:50,809 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-23 11:58:50,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 11:58:50,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 11:58:50,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:58:50,810 INFO L87 Difference]: Start difference. First operand 102 states and 145 transitions. Second operand 22 states. [2018-11-23 11:58:51,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:51,253 INFO L93 Difference]: Finished difference Result 126 states and 177 transitions. [2018-11-23 11:58:51,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 11:58:51,253 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 72 [2018-11-23 11:58:51,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:51,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:58:51,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 177 transitions. [2018-11-23 11:58:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-23 11:58:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 177 transitions. [2018-11-23 11:58:51,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 177 transitions. [2018-11-23 11:58:51,425 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-23 11:58:51,428 INFO L225 Difference]: With dead ends: 126 [2018-11-23 11:58:51,428 INFO L226 Difference]: Without dead ends: 109 [2018-11-23 11:58:51,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:58:51,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-11-23 11:58:51,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-11-23 11:58:51,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:51,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand 106 states. [2018-11-23 11:58:51,452 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 106 states. [2018-11-23 11:58:51,452 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 106 states. [2018-11-23 11:58:51,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:51,454 INFO L93 Difference]: Finished difference Result 109 states and 156 transitions. [2018-11-23 11:58:51,454 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2018-11-23 11:58:51,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:51,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:51,455 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand 109 states. [2018-11-23 11:58:51,455 INFO L87 Difference]: Start difference. First operand 106 states. Second operand 109 states. [2018-11-23 11:58:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:51,457 INFO L93 Difference]: Finished difference Result 109 states and 156 transitions. [2018-11-23 11:58:51,457 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 156 transitions. [2018-11-23 11:58:51,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:51,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:51,458 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:51,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:51,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 11:58:51,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 151 transitions. [2018-11-23 11:58:51,460 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 151 transitions. Word has length 72 [2018-11-23 11:58:51,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:51,460 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 151 transitions. [2018-11-23 11:58:51,460 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 11:58:51,460 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 151 transitions. [2018-11-23 11:58:51,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-11-23 11:58:51,461 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:51,461 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:51,461 INFO L423 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:51,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:51,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2053549796, now seen corresponding path program 20 times [2018-11-23 11:58:51,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:51,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:51,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:51,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:58:51,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:51,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:51,843 INFO L256 TraceCheckUtils]: 0: Hoare triple {9887#true} call ULTIMATE.init(); {9887#true} is VALID [2018-11-23 11:58:51,844 INFO L273 TraceCheckUtils]: 1: Hoare triple {9887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9887#true} is VALID [2018-11-23 11:58:51,844 INFO L273 TraceCheckUtils]: 2: Hoare triple {9887#true} assume true; {9887#true} is VALID [2018-11-23 11:58:51,844 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9887#true} {9887#true} #88#return; {9887#true} is VALID [2018-11-23 11:58:51,844 INFO L256 TraceCheckUtils]: 4: Hoare triple {9887#true} call #t~ret13 := main(); {9887#true} is VALID [2018-11-23 11:58:51,844 INFO L273 TraceCheckUtils]: 5: Hoare triple {9887#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {9887#true} is VALID [2018-11-23 11:58:51,845 INFO L273 TraceCheckUtils]: 6: Hoare triple {9887#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {9887#true} is VALID [2018-11-23 11:58:51,845 INFO L273 TraceCheckUtils]: 7: Hoare triple {9887#true} ~i~0 := 2; {9889#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:51,846 INFO L273 TraceCheckUtils]: 8: Hoare triple {9889#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9889#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:51,846 INFO L273 TraceCheckUtils]: 9: Hoare triple {9889#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9889#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:51,847 INFO L273 TraceCheckUtils]: 10: Hoare triple {9889#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9890#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:51,847 INFO L273 TraceCheckUtils]: 11: Hoare triple {9890#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9890#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:51,847 INFO L273 TraceCheckUtils]: 12: Hoare triple {9890#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9890#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:51,848 INFO L273 TraceCheckUtils]: 13: Hoare triple {9890#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9891#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:51,848 INFO L273 TraceCheckUtils]: 14: Hoare triple {9891#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9891#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:51,849 INFO L273 TraceCheckUtils]: 15: Hoare triple {9891#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9891#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:51,849 INFO L273 TraceCheckUtils]: 16: Hoare triple {9891#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9892#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:51,850 INFO L273 TraceCheckUtils]: 17: Hoare triple {9892#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9892#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:51,850 INFO L273 TraceCheckUtils]: 18: Hoare triple {9892#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9892#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:51,851 INFO L273 TraceCheckUtils]: 19: Hoare triple {9892#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9893#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:51,852 INFO L273 TraceCheckUtils]: 20: Hoare triple {9893#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9893#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:51,852 INFO L273 TraceCheckUtils]: 21: Hoare triple {9893#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9893#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:51,853 INFO L273 TraceCheckUtils]: 22: Hoare triple {9893#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9894#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:51,853 INFO L273 TraceCheckUtils]: 23: Hoare triple {9894#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9894#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:51,854 INFO L273 TraceCheckUtils]: 24: Hoare triple {9894#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9894#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:51,855 INFO L273 TraceCheckUtils]: 25: Hoare triple {9894#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9895#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:51,855 INFO L273 TraceCheckUtils]: 26: Hoare triple {9895#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9895#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:51,856 INFO L273 TraceCheckUtils]: 27: Hoare triple {9895#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9895#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:51,856 INFO L273 TraceCheckUtils]: 28: Hoare triple {9895#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9896#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:51,857 INFO L273 TraceCheckUtils]: 29: Hoare triple {9896#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9896#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:51,857 INFO L273 TraceCheckUtils]: 30: Hoare triple {9896#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9896#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:51,858 INFO L273 TraceCheckUtils]: 31: Hoare triple {9896#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9897#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:51,859 INFO L273 TraceCheckUtils]: 32: Hoare triple {9897#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9897#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:51,859 INFO L273 TraceCheckUtils]: 33: Hoare triple {9897#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9897#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:51,860 INFO L273 TraceCheckUtils]: 34: Hoare triple {9897#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9898#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:51,860 INFO L273 TraceCheckUtils]: 35: Hoare triple {9898#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9898#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:51,861 INFO L273 TraceCheckUtils]: 36: Hoare triple {9898#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9898#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:51,862 INFO L273 TraceCheckUtils]: 37: Hoare triple {9898#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9899#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:51,862 INFO L273 TraceCheckUtils]: 38: Hoare triple {9899#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9899#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:51,863 INFO L273 TraceCheckUtils]: 39: Hoare triple {9899#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9899#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:51,863 INFO L273 TraceCheckUtils]: 40: Hoare triple {9899#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9900#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:51,864 INFO L273 TraceCheckUtils]: 41: Hoare triple {9900#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9900#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:51,865 INFO L273 TraceCheckUtils]: 42: Hoare triple {9900#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9900#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:51,865 INFO L273 TraceCheckUtils]: 43: Hoare triple {9900#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9901#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:51,866 INFO L273 TraceCheckUtils]: 44: Hoare triple {9901#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9901#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:51,866 INFO L273 TraceCheckUtils]: 45: Hoare triple {9901#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9901#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:51,867 INFO L273 TraceCheckUtils]: 46: Hoare triple {9901#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9902#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:51,868 INFO L273 TraceCheckUtils]: 47: Hoare triple {9902#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9902#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:51,868 INFO L273 TraceCheckUtils]: 48: Hoare triple {9902#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9902#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:51,869 INFO L273 TraceCheckUtils]: 49: Hoare triple {9902#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9903#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:51,869 INFO L273 TraceCheckUtils]: 50: Hoare triple {9903#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9903#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:51,870 INFO L273 TraceCheckUtils]: 51: Hoare triple {9903#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9903#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:51,871 INFO L273 TraceCheckUtils]: 52: Hoare triple {9903#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9904#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:51,871 INFO L273 TraceCheckUtils]: 53: Hoare triple {9904#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9904#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:51,872 INFO L273 TraceCheckUtils]: 54: Hoare triple {9904#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9904#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:51,872 INFO L273 TraceCheckUtils]: 55: Hoare triple {9904#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9905#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:51,873 INFO L273 TraceCheckUtils]: 56: Hoare triple {9905#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9905#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:51,873 INFO L273 TraceCheckUtils]: 57: Hoare triple {9905#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9905#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:51,874 INFO L273 TraceCheckUtils]: 58: Hoare triple {9905#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9906#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:51,875 INFO L273 TraceCheckUtils]: 59: Hoare triple {9906#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9906#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:51,875 INFO L273 TraceCheckUtils]: 60: Hoare triple {9906#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9906#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:51,876 INFO L273 TraceCheckUtils]: 61: Hoare triple {9906#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9907#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:51,876 INFO L273 TraceCheckUtils]: 62: Hoare triple {9907#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9907#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:51,877 INFO L273 TraceCheckUtils]: 63: Hoare triple {9907#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9907#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:51,878 INFO L273 TraceCheckUtils]: 64: Hoare triple {9907#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9908#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:51,878 INFO L273 TraceCheckUtils]: 65: Hoare triple {9908#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9908#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:51,879 INFO L273 TraceCheckUtils]: 66: Hoare triple {9908#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9908#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:51,880 INFO L273 TraceCheckUtils]: 67: Hoare triple {9908#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9909#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:51,880 INFO L273 TraceCheckUtils]: 68: Hoare triple {9909#(<= main_~i~0 22)} assume !(~i~0 < 100000); {9888#false} is VALID [2018-11-23 11:58:51,880 INFO L273 TraceCheckUtils]: 69: Hoare triple {9888#false} havoc ~x~0;~x~0 := 0; {9888#false} is VALID [2018-11-23 11:58:51,881 INFO L273 TraceCheckUtils]: 70: Hoare triple {9888#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {9888#false} is VALID [2018-11-23 11:58:51,881 INFO L256 TraceCheckUtils]: 71: Hoare triple {9888#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {9888#false} is VALID [2018-11-23 11:58:51,881 INFO L273 TraceCheckUtils]: 72: Hoare triple {9888#false} ~cond := #in~cond; {9888#false} is VALID [2018-11-23 11:58:51,881 INFO L273 TraceCheckUtils]: 73: Hoare triple {9888#false} assume 0 == ~cond; {9888#false} is VALID [2018-11-23 11:58:51,881 INFO L273 TraceCheckUtils]: 74: Hoare triple {9888#false} assume !false; {9888#false} is VALID [2018-11-23 11:58:51,885 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:51,885 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:51,886 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-23 11:58:51,894 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:58:51,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:58:51,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:51,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:51,957 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:52,130 INFO L256 TraceCheckUtils]: 0: Hoare triple {9887#true} call ULTIMATE.init(); {9887#true} is VALID [2018-11-23 11:58:52,131 INFO L273 TraceCheckUtils]: 1: Hoare triple {9887#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {9887#true} is VALID [2018-11-23 11:58:52,131 INFO L273 TraceCheckUtils]: 2: Hoare triple {9887#true} assume true; {9887#true} is VALID [2018-11-23 11:58:52,131 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9887#true} {9887#true} #88#return; {9887#true} is VALID [2018-11-23 11:58:52,131 INFO L256 TraceCheckUtils]: 4: Hoare triple {9887#true} call #t~ret13 := main(); {9887#true} is VALID [2018-11-23 11:58:52,131 INFO L273 TraceCheckUtils]: 5: Hoare triple {9887#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {9887#true} is VALID [2018-11-23 11:58:52,132 INFO L273 TraceCheckUtils]: 6: Hoare triple {9887#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {9887#true} is VALID [2018-11-23 11:58:52,132 INFO L273 TraceCheckUtils]: 7: Hoare triple {9887#true} ~i~0 := 2; {9889#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,133 INFO L273 TraceCheckUtils]: 8: Hoare triple {9889#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9889#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,133 INFO L273 TraceCheckUtils]: 9: Hoare triple {9889#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9889#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:52,134 INFO L273 TraceCheckUtils]: 10: Hoare triple {9889#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9890#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,134 INFO L273 TraceCheckUtils]: 11: Hoare triple {9890#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9890#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {9890#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9890#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:52,135 INFO L273 TraceCheckUtils]: 13: Hoare triple {9890#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9891#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,135 INFO L273 TraceCheckUtils]: 14: Hoare triple {9891#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9891#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {9891#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9891#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:52,136 INFO L273 TraceCheckUtils]: 16: Hoare triple {9891#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9892#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,137 INFO L273 TraceCheckUtils]: 17: Hoare triple {9892#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9892#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,137 INFO L273 TraceCheckUtils]: 18: Hoare triple {9892#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9892#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:52,138 INFO L273 TraceCheckUtils]: 19: Hoare triple {9892#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9893#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:52,139 INFO L273 TraceCheckUtils]: 20: Hoare triple {9893#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9893#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:52,139 INFO L273 TraceCheckUtils]: 21: Hoare triple {9893#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9893#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:52,140 INFO L273 TraceCheckUtils]: 22: Hoare triple {9893#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9894#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:52,140 INFO L273 TraceCheckUtils]: 23: Hoare triple {9894#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9894#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:52,141 INFO L273 TraceCheckUtils]: 24: Hoare triple {9894#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9894#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:52,142 INFO L273 TraceCheckUtils]: 25: Hoare triple {9894#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9895#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:52,142 INFO L273 TraceCheckUtils]: 26: Hoare triple {9895#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9895#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:52,143 INFO L273 TraceCheckUtils]: 27: Hoare triple {9895#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9895#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:52,143 INFO L273 TraceCheckUtils]: 28: Hoare triple {9895#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9896#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:52,144 INFO L273 TraceCheckUtils]: 29: Hoare triple {9896#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9896#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:52,144 INFO L273 TraceCheckUtils]: 30: Hoare triple {9896#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9896#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:52,145 INFO L273 TraceCheckUtils]: 31: Hoare triple {9896#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9897#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:52,146 INFO L273 TraceCheckUtils]: 32: Hoare triple {9897#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9897#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:52,146 INFO L273 TraceCheckUtils]: 33: Hoare triple {9897#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9897#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:52,147 INFO L273 TraceCheckUtils]: 34: Hoare triple {9897#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9898#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:52,148 INFO L273 TraceCheckUtils]: 35: Hoare triple {9898#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9898#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:52,148 INFO L273 TraceCheckUtils]: 36: Hoare triple {9898#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9898#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:52,149 INFO L273 TraceCheckUtils]: 37: Hoare triple {9898#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9899#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:52,149 INFO L273 TraceCheckUtils]: 38: Hoare triple {9899#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9899#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:52,150 INFO L273 TraceCheckUtils]: 39: Hoare triple {9899#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9899#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:52,151 INFO L273 TraceCheckUtils]: 40: Hoare triple {9899#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9900#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:52,151 INFO L273 TraceCheckUtils]: 41: Hoare triple {9900#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9900#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:52,152 INFO L273 TraceCheckUtils]: 42: Hoare triple {9900#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9900#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:52,152 INFO L273 TraceCheckUtils]: 43: Hoare triple {9900#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9901#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:52,153 INFO L273 TraceCheckUtils]: 44: Hoare triple {9901#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9901#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:52,153 INFO L273 TraceCheckUtils]: 45: Hoare triple {9901#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9901#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:52,154 INFO L273 TraceCheckUtils]: 46: Hoare triple {9901#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9902#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:52,155 INFO L273 TraceCheckUtils]: 47: Hoare triple {9902#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9902#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:52,155 INFO L273 TraceCheckUtils]: 48: Hoare triple {9902#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9902#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:52,156 INFO L273 TraceCheckUtils]: 49: Hoare triple {9902#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9903#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:52,156 INFO L273 TraceCheckUtils]: 50: Hoare triple {9903#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9903#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:52,157 INFO L273 TraceCheckUtils]: 51: Hoare triple {9903#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9903#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:52,158 INFO L273 TraceCheckUtils]: 52: Hoare triple {9903#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9904#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:52,158 INFO L273 TraceCheckUtils]: 53: Hoare triple {9904#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9904#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:52,159 INFO L273 TraceCheckUtils]: 54: Hoare triple {9904#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9904#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:52,159 INFO L273 TraceCheckUtils]: 55: Hoare triple {9904#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9905#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:52,160 INFO L273 TraceCheckUtils]: 56: Hoare triple {9905#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9905#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:52,160 INFO L273 TraceCheckUtils]: 57: Hoare triple {9905#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9905#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:52,161 INFO L273 TraceCheckUtils]: 58: Hoare triple {9905#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9906#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:52,162 INFO L273 TraceCheckUtils]: 59: Hoare triple {9906#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9906#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:52,162 INFO L273 TraceCheckUtils]: 60: Hoare triple {9906#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9906#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:52,163 INFO L273 TraceCheckUtils]: 61: Hoare triple {9906#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9907#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:52,164 INFO L273 TraceCheckUtils]: 62: Hoare triple {9907#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9907#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:52,164 INFO L273 TraceCheckUtils]: 63: Hoare triple {9907#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9907#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:52,165 INFO L273 TraceCheckUtils]: 64: Hoare triple {9907#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9908#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:52,165 INFO L273 TraceCheckUtils]: 65: Hoare triple {9908#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {9908#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:52,166 INFO L273 TraceCheckUtils]: 66: Hoare triple {9908#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {9908#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:52,167 INFO L273 TraceCheckUtils]: 67: Hoare triple {9908#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {9909#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:52,167 INFO L273 TraceCheckUtils]: 68: Hoare triple {9909#(<= main_~i~0 22)} assume !(~i~0 < 100000); {9888#false} is VALID [2018-11-23 11:58:52,167 INFO L273 TraceCheckUtils]: 69: Hoare triple {9888#false} havoc ~x~0;~x~0 := 0; {9888#false} is VALID [2018-11-23 11:58:52,168 INFO L273 TraceCheckUtils]: 70: Hoare triple {9888#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {9888#false} is VALID [2018-11-23 11:58:52,168 INFO L256 TraceCheckUtils]: 71: Hoare triple {9888#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {9888#false} is VALID [2018-11-23 11:58:52,168 INFO L273 TraceCheckUtils]: 72: Hoare triple {9888#false} ~cond := #in~cond; {9888#false} is VALID [2018-11-23 11:58:52,168 INFO L273 TraceCheckUtils]: 73: Hoare triple {9888#false} assume 0 == ~cond; {9888#false} is VALID [2018-11-23 11:58:52,168 INFO L273 TraceCheckUtils]: 74: Hoare triple {9888#false} assume !false; {9888#false} is VALID [2018-11-23 11:58:52,173 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:52,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:52,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2018-11-23 11:58:52,193 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 75 [2018-11-23 11:58:52,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:52,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states. [2018-11-23 11:58:52,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:52,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-23 11:58:52,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-23 11:58:52,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:58:52,269 INFO L87 Difference]: Start difference. First operand 106 states and 151 transitions. Second operand 23 states. [2018-11-23 11:58:53,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:53,200 INFO L93 Difference]: Finished difference Result 130 states and 183 transitions. [2018-11-23 11:58:53,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-11-23 11:58:53,200 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 75 [2018-11-23 11:58:53,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:53,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:58:53,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 183 transitions. [2018-11-23 11:58:53,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:58:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 183 transitions. [2018-11-23 11:58:53,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 183 transitions. [2018-11-23 11:58:53,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:53,378 INFO L225 Difference]: With dead ends: 130 [2018-11-23 11:58:53,378 INFO L226 Difference]: Without dead ends: 113 [2018-11-23 11:58:53,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-11-23 11:58:53,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-23 11:58:53,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2018-11-23 11:58:53,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:53,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand 110 states. [2018-11-23 11:58:53,401 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 110 states. [2018-11-23 11:58:53,401 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 110 states. [2018-11-23 11:58:53,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:53,402 INFO L93 Difference]: Finished difference Result 113 states and 162 transitions. [2018-11-23 11:58:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2018-11-23 11:58:53,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:53,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:53,403 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 113 states. [2018-11-23 11:58:53,403 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 113 states. [2018-11-23 11:58:53,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:53,405 INFO L93 Difference]: Finished difference Result 113 states and 162 transitions. [2018-11-23 11:58:53,405 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 162 transitions. [2018-11-23 11:58:53,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:53,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:53,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:53,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:53,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-23 11:58:53,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 157 transitions. [2018-11-23 11:58:53,408 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 157 transitions. Word has length 75 [2018-11-23 11:58:53,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:53,408 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 157 transitions. [2018-11-23 11:58:53,409 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-23 11:58:53,409 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 157 transitions. [2018-11-23 11:58:53,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-11-23 11:58:53,409 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:53,410 INFO L402 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:53,410 INFO L423 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:53,410 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:53,410 INFO L82 PathProgramCache]: Analyzing trace with hash 861973505, now seen corresponding path program 21 times [2018-11-23 11:58:53,410 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:53,411 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:53,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:53,411 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:53,411 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:53,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:53,838 INFO L256 TraceCheckUtils]: 0: Hoare triple {10667#true} call ULTIMATE.init(); {10667#true} is VALID [2018-11-23 11:58:53,839 INFO L273 TraceCheckUtils]: 1: Hoare triple {10667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10667#true} is VALID [2018-11-23 11:58:53,839 INFO L273 TraceCheckUtils]: 2: Hoare triple {10667#true} assume true; {10667#true} is VALID [2018-11-23 11:58:53,839 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10667#true} {10667#true} #88#return; {10667#true} is VALID [2018-11-23 11:58:53,839 INFO L256 TraceCheckUtils]: 4: Hoare triple {10667#true} call #t~ret13 := main(); {10667#true} is VALID [2018-11-23 11:58:53,840 INFO L273 TraceCheckUtils]: 5: Hoare triple {10667#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {10667#true} is VALID [2018-11-23 11:58:53,840 INFO L273 TraceCheckUtils]: 6: Hoare triple {10667#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {10667#true} is VALID [2018-11-23 11:58:53,840 INFO L273 TraceCheckUtils]: 7: Hoare triple {10667#true} ~i~0 := 2; {10669#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:53,841 INFO L273 TraceCheckUtils]: 8: Hoare triple {10669#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10669#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:53,841 INFO L273 TraceCheckUtils]: 9: Hoare triple {10669#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10669#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:53,842 INFO L273 TraceCheckUtils]: 10: Hoare triple {10669#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10670#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:53,842 INFO L273 TraceCheckUtils]: 11: Hoare triple {10670#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10670#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:53,842 INFO L273 TraceCheckUtils]: 12: Hoare triple {10670#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10670#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:53,843 INFO L273 TraceCheckUtils]: 13: Hoare triple {10670#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10671#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:53,843 INFO L273 TraceCheckUtils]: 14: Hoare triple {10671#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10671#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:53,843 INFO L273 TraceCheckUtils]: 15: Hoare triple {10671#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10671#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:53,844 INFO L273 TraceCheckUtils]: 16: Hoare triple {10671#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10672#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:53,844 INFO L273 TraceCheckUtils]: 17: Hoare triple {10672#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10672#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:53,845 INFO L273 TraceCheckUtils]: 18: Hoare triple {10672#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10672#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:53,845 INFO L273 TraceCheckUtils]: 19: Hoare triple {10672#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10673#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:53,846 INFO L273 TraceCheckUtils]: 20: Hoare triple {10673#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10673#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:53,846 INFO L273 TraceCheckUtils]: 21: Hoare triple {10673#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10673#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:53,847 INFO L273 TraceCheckUtils]: 22: Hoare triple {10673#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10674#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:53,848 INFO L273 TraceCheckUtils]: 23: Hoare triple {10674#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10674#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:53,848 INFO L273 TraceCheckUtils]: 24: Hoare triple {10674#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10674#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:53,849 INFO L273 TraceCheckUtils]: 25: Hoare triple {10674#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10675#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:53,850 INFO L273 TraceCheckUtils]: 26: Hoare triple {10675#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10675#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:53,850 INFO L273 TraceCheckUtils]: 27: Hoare triple {10675#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10675#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:53,851 INFO L273 TraceCheckUtils]: 28: Hoare triple {10675#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10676#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:53,851 INFO L273 TraceCheckUtils]: 29: Hoare triple {10676#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10676#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:53,852 INFO L273 TraceCheckUtils]: 30: Hoare triple {10676#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10676#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:53,853 INFO L273 TraceCheckUtils]: 31: Hoare triple {10676#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10677#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:53,853 INFO L273 TraceCheckUtils]: 32: Hoare triple {10677#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10677#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:53,854 INFO L273 TraceCheckUtils]: 33: Hoare triple {10677#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10677#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:53,854 INFO L273 TraceCheckUtils]: 34: Hoare triple {10677#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10678#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:53,855 INFO L273 TraceCheckUtils]: 35: Hoare triple {10678#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10678#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:53,855 INFO L273 TraceCheckUtils]: 36: Hoare triple {10678#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10678#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:53,856 INFO L273 TraceCheckUtils]: 37: Hoare triple {10678#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10679#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:53,857 INFO L273 TraceCheckUtils]: 38: Hoare triple {10679#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10679#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:53,857 INFO L273 TraceCheckUtils]: 39: Hoare triple {10679#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10679#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:53,858 INFO L273 TraceCheckUtils]: 40: Hoare triple {10679#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10680#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:53,858 INFO L273 TraceCheckUtils]: 41: Hoare triple {10680#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10680#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:53,859 INFO L273 TraceCheckUtils]: 42: Hoare triple {10680#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10680#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:53,860 INFO L273 TraceCheckUtils]: 43: Hoare triple {10680#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10681#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:53,860 INFO L273 TraceCheckUtils]: 44: Hoare triple {10681#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10681#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:53,861 INFO L273 TraceCheckUtils]: 45: Hoare triple {10681#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10681#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:53,861 INFO L273 TraceCheckUtils]: 46: Hoare triple {10681#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10682#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:53,862 INFO L273 TraceCheckUtils]: 47: Hoare triple {10682#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10682#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:53,862 INFO L273 TraceCheckUtils]: 48: Hoare triple {10682#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10682#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:53,863 INFO L273 TraceCheckUtils]: 49: Hoare triple {10682#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10683#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:53,864 INFO L273 TraceCheckUtils]: 50: Hoare triple {10683#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10683#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:53,864 INFO L273 TraceCheckUtils]: 51: Hoare triple {10683#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10683#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:53,865 INFO L273 TraceCheckUtils]: 52: Hoare triple {10683#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10684#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:53,865 INFO L273 TraceCheckUtils]: 53: Hoare triple {10684#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10684#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:53,866 INFO L273 TraceCheckUtils]: 54: Hoare triple {10684#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10684#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:53,867 INFO L273 TraceCheckUtils]: 55: Hoare triple {10684#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10685#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:53,867 INFO L273 TraceCheckUtils]: 56: Hoare triple {10685#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10685#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:53,868 INFO L273 TraceCheckUtils]: 57: Hoare triple {10685#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10685#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:53,868 INFO L273 TraceCheckUtils]: 58: Hoare triple {10685#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10686#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:53,869 INFO L273 TraceCheckUtils]: 59: Hoare triple {10686#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10686#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:53,869 INFO L273 TraceCheckUtils]: 60: Hoare triple {10686#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10686#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:53,870 INFO L273 TraceCheckUtils]: 61: Hoare triple {10686#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10687#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:53,871 INFO L273 TraceCheckUtils]: 62: Hoare triple {10687#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10687#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:53,871 INFO L273 TraceCheckUtils]: 63: Hoare triple {10687#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10687#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:53,872 INFO L273 TraceCheckUtils]: 64: Hoare triple {10687#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10688#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:53,873 INFO L273 TraceCheckUtils]: 65: Hoare triple {10688#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10688#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:53,873 INFO L273 TraceCheckUtils]: 66: Hoare triple {10688#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10688#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:53,874 INFO L273 TraceCheckUtils]: 67: Hoare triple {10688#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10689#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:53,874 INFO L273 TraceCheckUtils]: 68: Hoare triple {10689#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10689#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:53,875 INFO L273 TraceCheckUtils]: 69: Hoare triple {10689#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10689#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:53,876 INFO L273 TraceCheckUtils]: 70: Hoare triple {10689#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10690#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:53,876 INFO L273 TraceCheckUtils]: 71: Hoare triple {10690#(<= main_~i~0 23)} assume !(~i~0 < 100000); {10668#false} is VALID [2018-11-23 11:58:53,877 INFO L273 TraceCheckUtils]: 72: Hoare triple {10668#false} havoc ~x~0;~x~0 := 0; {10668#false} is VALID [2018-11-23 11:58:53,877 INFO L273 TraceCheckUtils]: 73: Hoare triple {10668#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {10668#false} is VALID [2018-11-23 11:58:53,877 INFO L256 TraceCheckUtils]: 74: Hoare triple {10668#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {10668#false} is VALID [2018-11-23 11:58:53,877 INFO L273 TraceCheckUtils]: 75: Hoare triple {10668#false} ~cond := #in~cond; {10668#false} is VALID [2018-11-23 11:58:53,877 INFO L273 TraceCheckUtils]: 76: Hoare triple {10668#false} assume 0 == ~cond; {10668#false} is VALID [2018-11-23 11:58:53,878 INFO L273 TraceCheckUtils]: 77: Hoare triple {10668#false} assume !false; {10668#false} is VALID [2018-11-23 11:58:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:53,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:53,882 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-23 11:58:53,897 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:58:53,958 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 22 check-sat command(s) [2018-11-23 11:58:53,958 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:53,981 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:54,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {10667#true} call ULTIMATE.init(); {10667#true} is VALID [2018-11-23 11:58:54,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {10667#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {10667#true} is VALID [2018-11-23 11:58:54,149 INFO L273 TraceCheckUtils]: 2: Hoare triple {10667#true} assume true; {10667#true} is VALID [2018-11-23 11:58:54,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10667#true} {10667#true} #88#return; {10667#true} is VALID [2018-11-23 11:58:54,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {10667#true} call #t~ret13 := main(); {10667#true} is VALID [2018-11-23 11:58:54,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {10667#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {10667#true} is VALID [2018-11-23 11:58:54,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {10667#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {10667#true} is VALID [2018-11-23 11:58:54,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {10667#true} ~i~0 := 2; {10669#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:54,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {10669#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10669#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:54,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {10669#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10669#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:54,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {10669#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10670#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:54,152 INFO L273 TraceCheckUtils]: 11: Hoare triple {10670#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10670#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:54,152 INFO L273 TraceCheckUtils]: 12: Hoare triple {10670#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10670#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:54,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {10670#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10671#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:54,153 INFO L273 TraceCheckUtils]: 14: Hoare triple {10671#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10671#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:54,153 INFO L273 TraceCheckUtils]: 15: Hoare triple {10671#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10671#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:54,154 INFO L273 TraceCheckUtils]: 16: Hoare triple {10671#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10672#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:54,155 INFO L273 TraceCheckUtils]: 17: Hoare triple {10672#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10672#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:54,155 INFO L273 TraceCheckUtils]: 18: Hoare triple {10672#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10672#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:54,156 INFO L273 TraceCheckUtils]: 19: Hoare triple {10672#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10673#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:54,156 INFO L273 TraceCheckUtils]: 20: Hoare triple {10673#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10673#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:54,157 INFO L273 TraceCheckUtils]: 21: Hoare triple {10673#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10673#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:54,158 INFO L273 TraceCheckUtils]: 22: Hoare triple {10673#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10674#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,158 INFO L273 TraceCheckUtils]: 23: Hoare triple {10674#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10674#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {10674#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10674#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:54,159 INFO L273 TraceCheckUtils]: 25: Hoare triple {10674#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10675#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,160 INFO L273 TraceCheckUtils]: 26: Hoare triple {10675#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10675#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,161 INFO L273 TraceCheckUtils]: 27: Hoare triple {10675#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10675#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:54,161 INFO L273 TraceCheckUtils]: 28: Hoare triple {10675#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10676#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,162 INFO L273 TraceCheckUtils]: 29: Hoare triple {10676#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10676#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {10676#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10676#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:54,163 INFO L273 TraceCheckUtils]: 31: Hoare triple {10676#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10677#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,164 INFO L273 TraceCheckUtils]: 32: Hoare triple {10677#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10677#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,164 INFO L273 TraceCheckUtils]: 33: Hoare triple {10677#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10677#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:54,165 INFO L273 TraceCheckUtils]: 34: Hoare triple {10677#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10678#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,165 INFO L273 TraceCheckUtils]: 35: Hoare triple {10678#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10678#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,166 INFO L273 TraceCheckUtils]: 36: Hoare triple {10678#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10678#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:54,167 INFO L273 TraceCheckUtils]: 37: Hoare triple {10678#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10679#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:54,167 INFO L273 TraceCheckUtils]: 38: Hoare triple {10679#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10679#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:54,168 INFO L273 TraceCheckUtils]: 39: Hoare triple {10679#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10679#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:54,168 INFO L273 TraceCheckUtils]: 40: Hoare triple {10679#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10680#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:54,169 INFO L273 TraceCheckUtils]: 41: Hoare triple {10680#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10680#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:54,169 INFO L273 TraceCheckUtils]: 42: Hoare triple {10680#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10680#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:54,170 INFO L273 TraceCheckUtils]: 43: Hoare triple {10680#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10681#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:54,171 INFO L273 TraceCheckUtils]: 44: Hoare triple {10681#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10681#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:54,171 INFO L273 TraceCheckUtils]: 45: Hoare triple {10681#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10681#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:54,172 INFO L273 TraceCheckUtils]: 46: Hoare triple {10681#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10682#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:54,172 INFO L273 TraceCheckUtils]: 47: Hoare triple {10682#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10682#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:54,173 INFO L273 TraceCheckUtils]: 48: Hoare triple {10682#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10682#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:54,174 INFO L273 TraceCheckUtils]: 49: Hoare triple {10682#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10683#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:54,174 INFO L273 TraceCheckUtils]: 50: Hoare triple {10683#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10683#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:54,175 INFO L273 TraceCheckUtils]: 51: Hoare triple {10683#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10683#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:54,175 INFO L273 TraceCheckUtils]: 52: Hoare triple {10683#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10684#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:54,176 INFO L273 TraceCheckUtils]: 53: Hoare triple {10684#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10684#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:54,177 INFO L273 TraceCheckUtils]: 54: Hoare triple {10684#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10684#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:54,177 INFO L273 TraceCheckUtils]: 55: Hoare triple {10684#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10685#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:54,178 INFO L273 TraceCheckUtils]: 56: Hoare triple {10685#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10685#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:54,178 INFO L273 TraceCheckUtils]: 57: Hoare triple {10685#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10685#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:54,179 INFO L273 TraceCheckUtils]: 58: Hoare triple {10685#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10686#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:54,180 INFO L273 TraceCheckUtils]: 59: Hoare triple {10686#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10686#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:54,180 INFO L273 TraceCheckUtils]: 60: Hoare triple {10686#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10686#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:54,181 INFO L273 TraceCheckUtils]: 61: Hoare triple {10686#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10687#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:54,181 INFO L273 TraceCheckUtils]: 62: Hoare triple {10687#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10687#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:54,182 INFO L273 TraceCheckUtils]: 63: Hoare triple {10687#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10687#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:54,183 INFO L273 TraceCheckUtils]: 64: Hoare triple {10687#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10688#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:54,183 INFO L273 TraceCheckUtils]: 65: Hoare triple {10688#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10688#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:54,184 INFO L273 TraceCheckUtils]: 66: Hoare triple {10688#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10688#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:54,184 INFO L273 TraceCheckUtils]: 67: Hoare triple {10688#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10689#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:54,185 INFO L273 TraceCheckUtils]: 68: Hoare triple {10689#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {10689#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:54,185 INFO L273 TraceCheckUtils]: 69: Hoare triple {10689#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {10689#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:54,186 INFO L273 TraceCheckUtils]: 70: Hoare triple {10689#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {10690#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:54,187 INFO L273 TraceCheckUtils]: 71: Hoare triple {10690#(<= main_~i~0 23)} assume !(~i~0 < 100000); {10668#false} is VALID [2018-11-23 11:58:54,187 INFO L273 TraceCheckUtils]: 72: Hoare triple {10668#false} havoc ~x~0;~x~0 := 0; {10668#false} is VALID [2018-11-23 11:58:54,187 INFO L273 TraceCheckUtils]: 73: Hoare triple {10668#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {10668#false} is VALID [2018-11-23 11:58:54,187 INFO L256 TraceCheckUtils]: 74: Hoare triple {10668#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {10668#false} is VALID [2018-11-23 11:58:54,188 INFO L273 TraceCheckUtils]: 75: Hoare triple {10668#false} ~cond := #in~cond; {10668#false} is VALID [2018-11-23 11:58:54,188 INFO L273 TraceCheckUtils]: 76: Hoare triple {10668#false} assume 0 == ~cond; {10668#false} is VALID [2018-11-23 11:58:54,188 INFO L273 TraceCheckUtils]: 77: Hoare triple {10668#false} assume !false; {10668#false} is VALID [2018-11-23 11:58:54,193 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:54,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:54,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 24 [2018-11-23 11:58:54,212 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 78 [2018-11-23 11:58:54,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:54,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 11:58:54,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:54,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 11:58:54,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 11:58:54,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:58:54,305 INFO L87 Difference]: Start difference. First operand 110 states and 157 transitions. Second operand 24 states. [2018-11-23 11:58:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,397 INFO L93 Difference]: Finished difference Result 134 states and 189 transitions. [2018-11-23 11:58:55,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 11:58:55,397 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 78 [2018-11-23 11:58:55,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:58:55,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 189 transitions. [2018-11-23 11:58:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:58:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 189 transitions. [2018-11-23 11:58:55,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 189 transitions. [2018-11-23 11:58:55,645 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:55,649 INFO L225 Difference]: With dead ends: 134 [2018-11-23 11:58:55,650 INFO L226 Difference]: Without dead ends: 117 [2018-11-23 11:58:55,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 11:58:55,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-11-23 11:58:55,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 114. [2018-11-23 11:58:55,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:55,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand 114 states. [2018-11-23 11:58:55,706 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand 114 states. [2018-11-23 11:58:55,707 INFO L87 Difference]: Start difference. First operand 117 states. Second operand 114 states. [2018-11-23 11:58:55,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,711 INFO L93 Difference]: Finished difference Result 117 states and 168 transitions. [2018-11-23 11:58:55,712 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 168 transitions. [2018-11-23 11:58:55,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:55,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:55,712 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 117 states. [2018-11-23 11:58:55,712 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 117 states. [2018-11-23 11:58:55,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:55,715 INFO L93 Difference]: Finished difference Result 117 states and 168 transitions. [2018-11-23 11:58:55,715 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 168 transitions. [2018-11-23 11:58:55,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:55,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:55,715 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:55,715 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:55,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 11:58:55,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2018-11-23 11:58:55,719 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 78 [2018-11-23 11:58:55,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:55,720 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2018-11-23 11:58:55,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 11:58:55,720 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2018-11-23 11:58:55,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 11:58:55,721 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:55,721 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:55,721 INFO L423 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:55,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:55,722 INFO L82 PathProgramCache]: Analyzing trace with hash 93006588, now seen corresponding path program 22 times [2018-11-23 11:58:55,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:55,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:55,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:55,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:55,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:56,467 INFO L256 TraceCheckUtils]: 0: Hoare triple {11475#true} call ULTIMATE.init(); {11475#true} is VALID [2018-11-23 11:58:56,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {11475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11475#true} is VALID [2018-11-23 11:58:56,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {11475#true} assume true; {11475#true} is VALID [2018-11-23 11:58:56,468 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11475#true} {11475#true} #88#return; {11475#true} is VALID [2018-11-23 11:58:56,468 INFO L256 TraceCheckUtils]: 4: Hoare triple {11475#true} call #t~ret13 := main(); {11475#true} is VALID [2018-11-23 11:58:56,468 INFO L273 TraceCheckUtils]: 5: Hoare triple {11475#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {11475#true} is VALID [2018-11-23 11:58:56,469 INFO L273 TraceCheckUtils]: 6: Hoare triple {11475#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {11475#true} is VALID [2018-11-23 11:58:56,469 INFO L273 TraceCheckUtils]: 7: Hoare triple {11475#true} ~i~0 := 2; {11477#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:56,470 INFO L273 TraceCheckUtils]: 8: Hoare triple {11477#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11477#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:56,470 INFO L273 TraceCheckUtils]: 9: Hoare triple {11477#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11477#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:56,471 INFO L273 TraceCheckUtils]: 10: Hoare triple {11477#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11478#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:56,471 INFO L273 TraceCheckUtils]: 11: Hoare triple {11478#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11478#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:56,471 INFO L273 TraceCheckUtils]: 12: Hoare triple {11478#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11478#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:56,472 INFO L273 TraceCheckUtils]: 13: Hoare triple {11478#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11479#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:56,472 INFO L273 TraceCheckUtils]: 14: Hoare triple {11479#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11479#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:56,473 INFO L273 TraceCheckUtils]: 15: Hoare triple {11479#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11479#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:56,473 INFO L273 TraceCheckUtils]: 16: Hoare triple {11479#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11480#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:56,474 INFO L273 TraceCheckUtils]: 17: Hoare triple {11480#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11480#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:56,474 INFO L273 TraceCheckUtils]: 18: Hoare triple {11480#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11480#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:56,475 INFO L273 TraceCheckUtils]: 19: Hoare triple {11480#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11481#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:56,476 INFO L273 TraceCheckUtils]: 20: Hoare triple {11481#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11481#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:56,476 INFO L273 TraceCheckUtils]: 21: Hoare triple {11481#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11481#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:56,477 INFO L273 TraceCheckUtils]: 22: Hoare triple {11481#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11482#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:56,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {11482#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11482#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:56,478 INFO L273 TraceCheckUtils]: 24: Hoare triple {11482#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11482#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:56,479 INFO L273 TraceCheckUtils]: 25: Hoare triple {11482#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11483#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:56,479 INFO L273 TraceCheckUtils]: 26: Hoare triple {11483#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11483#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:56,480 INFO L273 TraceCheckUtils]: 27: Hoare triple {11483#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11483#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:56,480 INFO L273 TraceCheckUtils]: 28: Hoare triple {11483#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11484#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:56,481 INFO L273 TraceCheckUtils]: 29: Hoare triple {11484#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11484#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:56,481 INFO L273 TraceCheckUtils]: 30: Hoare triple {11484#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11484#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:56,482 INFO L273 TraceCheckUtils]: 31: Hoare triple {11484#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11485#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:56,483 INFO L273 TraceCheckUtils]: 32: Hoare triple {11485#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11485#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:56,483 INFO L273 TraceCheckUtils]: 33: Hoare triple {11485#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11485#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:56,484 INFO L273 TraceCheckUtils]: 34: Hoare triple {11485#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11486#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:56,485 INFO L273 TraceCheckUtils]: 35: Hoare triple {11486#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11486#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:56,485 INFO L273 TraceCheckUtils]: 36: Hoare triple {11486#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11486#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:56,486 INFO L273 TraceCheckUtils]: 37: Hoare triple {11486#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11487#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:56,486 INFO L273 TraceCheckUtils]: 38: Hoare triple {11487#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11487#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:56,487 INFO L273 TraceCheckUtils]: 39: Hoare triple {11487#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11487#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:56,488 INFO L273 TraceCheckUtils]: 40: Hoare triple {11487#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11488#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:56,488 INFO L273 TraceCheckUtils]: 41: Hoare triple {11488#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11488#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:56,489 INFO L273 TraceCheckUtils]: 42: Hoare triple {11488#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11488#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:56,489 INFO L273 TraceCheckUtils]: 43: Hoare triple {11488#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11489#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:56,490 INFO L273 TraceCheckUtils]: 44: Hoare triple {11489#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11489#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:56,490 INFO L273 TraceCheckUtils]: 45: Hoare triple {11489#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11489#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:56,491 INFO L273 TraceCheckUtils]: 46: Hoare triple {11489#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11490#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:56,492 INFO L273 TraceCheckUtils]: 47: Hoare triple {11490#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11490#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:56,492 INFO L273 TraceCheckUtils]: 48: Hoare triple {11490#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11490#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:56,493 INFO L273 TraceCheckUtils]: 49: Hoare triple {11490#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11491#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:56,494 INFO L273 TraceCheckUtils]: 50: Hoare triple {11491#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11491#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:56,494 INFO L273 TraceCheckUtils]: 51: Hoare triple {11491#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11491#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:56,495 INFO L273 TraceCheckUtils]: 52: Hoare triple {11491#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11492#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:56,495 INFO L273 TraceCheckUtils]: 53: Hoare triple {11492#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11492#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:56,496 INFO L273 TraceCheckUtils]: 54: Hoare triple {11492#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11492#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:56,497 INFO L273 TraceCheckUtils]: 55: Hoare triple {11492#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11493#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:56,497 INFO L273 TraceCheckUtils]: 56: Hoare triple {11493#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11493#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:56,498 INFO L273 TraceCheckUtils]: 57: Hoare triple {11493#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11493#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:56,498 INFO L273 TraceCheckUtils]: 58: Hoare triple {11493#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11494#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:56,499 INFO L273 TraceCheckUtils]: 59: Hoare triple {11494#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11494#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:56,499 INFO L273 TraceCheckUtils]: 60: Hoare triple {11494#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11494#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:56,500 INFO L273 TraceCheckUtils]: 61: Hoare triple {11494#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11495#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:56,501 INFO L273 TraceCheckUtils]: 62: Hoare triple {11495#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11495#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:56,501 INFO L273 TraceCheckUtils]: 63: Hoare triple {11495#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11495#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:56,502 INFO L273 TraceCheckUtils]: 64: Hoare triple {11495#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11496#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:56,502 INFO L273 TraceCheckUtils]: 65: Hoare triple {11496#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11496#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:56,503 INFO L273 TraceCheckUtils]: 66: Hoare triple {11496#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11496#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:56,504 INFO L273 TraceCheckUtils]: 67: Hoare triple {11496#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11497#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:56,504 INFO L273 TraceCheckUtils]: 68: Hoare triple {11497#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11497#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:56,505 INFO L273 TraceCheckUtils]: 69: Hoare triple {11497#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11497#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:56,505 INFO L273 TraceCheckUtils]: 70: Hoare triple {11497#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11498#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:56,506 INFO L273 TraceCheckUtils]: 71: Hoare triple {11498#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11498#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:56,507 INFO L273 TraceCheckUtils]: 72: Hoare triple {11498#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11498#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:56,507 INFO L273 TraceCheckUtils]: 73: Hoare triple {11498#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11499#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:56,508 INFO L273 TraceCheckUtils]: 74: Hoare triple {11499#(<= main_~i~0 24)} assume !(~i~0 < 100000); {11476#false} is VALID [2018-11-23 11:58:56,508 INFO L273 TraceCheckUtils]: 75: Hoare triple {11476#false} havoc ~x~0;~x~0 := 0; {11476#false} is VALID [2018-11-23 11:58:56,508 INFO L273 TraceCheckUtils]: 76: Hoare triple {11476#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {11476#false} is VALID [2018-11-23 11:58:56,509 INFO L256 TraceCheckUtils]: 77: Hoare triple {11476#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {11476#false} is VALID [2018-11-23 11:58:56,509 INFO L273 TraceCheckUtils]: 78: Hoare triple {11476#false} ~cond := #in~cond; {11476#false} is VALID [2018-11-23 11:58:56,509 INFO L273 TraceCheckUtils]: 79: Hoare triple {11476#false} assume 0 == ~cond; {11476#false} is VALID [2018-11-23 11:58:56,509 INFO L273 TraceCheckUtils]: 80: Hoare triple {11476#false} assume !false; {11476#false} is VALID [2018-11-23 11:58:56,515 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:56,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:56,515 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-23 11:58:56,523 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:58:56,570 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:58:56,571 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:56,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:56,590 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:56,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {11475#true} call ULTIMATE.init(); {11475#true} is VALID [2018-11-23 11:58:56,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {11475#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {11475#true} is VALID [2018-11-23 11:58:56,820 INFO L273 TraceCheckUtils]: 2: Hoare triple {11475#true} assume true; {11475#true} is VALID [2018-11-23 11:58:56,820 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {11475#true} {11475#true} #88#return; {11475#true} is VALID [2018-11-23 11:58:56,820 INFO L256 TraceCheckUtils]: 4: Hoare triple {11475#true} call #t~ret13 := main(); {11475#true} is VALID [2018-11-23 11:58:56,821 INFO L273 TraceCheckUtils]: 5: Hoare triple {11475#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {11475#true} is VALID [2018-11-23 11:58:56,821 INFO L273 TraceCheckUtils]: 6: Hoare triple {11475#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {11475#true} is VALID [2018-11-23 11:58:56,821 INFO L273 TraceCheckUtils]: 7: Hoare triple {11475#true} ~i~0 := 2; {11477#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:56,822 INFO L273 TraceCheckUtils]: 8: Hoare triple {11477#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11477#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:56,822 INFO L273 TraceCheckUtils]: 9: Hoare triple {11477#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11477#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:56,823 INFO L273 TraceCheckUtils]: 10: Hoare triple {11477#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11478#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:56,823 INFO L273 TraceCheckUtils]: 11: Hoare triple {11478#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11478#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:56,823 INFO L273 TraceCheckUtils]: 12: Hoare triple {11478#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11478#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:56,824 INFO L273 TraceCheckUtils]: 13: Hoare triple {11478#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11479#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:56,824 INFO L273 TraceCheckUtils]: 14: Hoare triple {11479#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11479#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:56,825 INFO L273 TraceCheckUtils]: 15: Hoare triple {11479#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11479#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:56,825 INFO L273 TraceCheckUtils]: 16: Hoare triple {11479#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11480#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:56,826 INFO L273 TraceCheckUtils]: 17: Hoare triple {11480#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11480#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:56,826 INFO L273 TraceCheckUtils]: 18: Hoare triple {11480#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11480#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:56,827 INFO L273 TraceCheckUtils]: 19: Hoare triple {11480#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11481#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:56,828 INFO L273 TraceCheckUtils]: 20: Hoare triple {11481#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11481#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:56,828 INFO L273 TraceCheckUtils]: 21: Hoare triple {11481#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11481#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:56,829 INFO L273 TraceCheckUtils]: 22: Hoare triple {11481#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11482#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:56,830 INFO L273 TraceCheckUtils]: 23: Hoare triple {11482#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11482#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:56,830 INFO L273 TraceCheckUtils]: 24: Hoare triple {11482#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11482#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:56,831 INFO L273 TraceCheckUtils]: 25: Hoare triple {11482#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11483#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:56,831 INFO L273 TraceCheckUtils]: 26: Hoare triple {11483#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11483#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:56,832 INFO L273 TraceCheckUtils]: 27: Hoare triple {11483#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11483#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:56,833 INFO L273 TraceCheckUtils]: 28: Hoare triple {11483#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11484#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:56,833 INFO L273 TraceCheckUtils]: 29: Hoare triple {11484#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11484#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:56,834 INFO L273 TraceCheckUtils]: 30: Hoare triple {11484#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11484#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:56,834 INFO L273 TraceCheckUtils]: 31: Hoare triple {11484#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11485#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:56,835 INFO L273 TraceCheckUtils]: 32: Hoare triple {11485#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11485#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:56,835 INFO L273 TraceCheckUtils]: 33: Hoare triple {11485#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11485#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:56,836 INFO L273 TraceCheckUtils]: 34: Hoare triple {11485#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11486#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:56,837 INFO L273 TraceCheckUtils]: 35: Hoare triple {11486#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11486#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:56,837 INFO L273 TraceCheckUtils]: 36: Hoare triple {11486#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11486#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:56,838 INFO L273 TraceCheckUtils]: 37: Hoare triple {11486#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11487#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:56,838 INFO L273 TraceCheckUtils]: 38: Hoare triple {11487#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11487#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:56,839 INFO L273 TraceCheckUtils]: 39: Hoare triple {11487#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11487#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:56,840 INFO L273 TraceCheckUtils]: 40: Hoare triple {11487#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11488#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:56,840 INFO L273 TraceCheckUtils]: 41: Hoare triple {11488#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11488#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:56,841 INFO L273 TraceCheckUtils]: 42: Hoare triple {11488#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11488#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:56,841 INFO L273 TraceCheckUtils]: 43: Hoare triple {11488#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11489#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:56,842 INFO L273 TraceCheckUtils]: 44: Hoare triple {11489#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11489#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:56,842 INFO L273 TraceCheckUtils]: 45: Hoare triple {11489#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11489#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:56,843 INFO L273 TraceCheckUtils]: 46: Hoare triple {11489#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11490#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:56,844 INFO L273 TraceCheckUtils]: 47: Hoare triple {11490#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11490#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:56,844 INFO L273 TraceCheckUtils]: 48: Hoare triple {11490#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11490#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:56,845 INFO L273 TraceCheckUtils]: 49: Hoare triple {11490#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11491#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:56,845 INFO L273 TraceCheckUtils]: 50: Hoare triple {11491#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11491#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:56,846 INFO L273 TraceCheckUtils]: 51: Hoare triple {11491#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11491#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:56,847 INFO L273 TraceCheckUtils]: 52: Hoare triple {11491#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11492#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:56,847 INFO L273 TraceCheckUtils]: 53: Hoare triple {11492#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11492#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:56,848 INFO L273 TraceCheckUtils]: 54: Hoare triple {11492#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11492#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:56,849 INFO L273 TraceCheckUtils]: 55: Hoare triple {11492#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11493#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:56,849 INFO L273 TraceCheckUtils]: 56: Hoare triple {11493#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11493#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:56,850 INFO L273 TraceCheckUtils]: 57: Hoare triple {11493#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11493#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:56,850 INFO L273 TraceCheckUtils]: 58: Hoare triple {11493#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11494#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:56,851 INFO L273 TraceCheckUtils]: 59: Hoare triple {11494#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11494#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:56,851 INFO L273 TraceCheckUtils]: 60: Hoare triple {11494#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11494#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:56,852 INFO L273 TraceCheckUtils]: 61: Hoare triple {11494#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11495#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:56,853 INFO L273 TraceCheckUtils]: 62: Hoare triple {11495#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11495#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:56,853 INFO L273 TraceCheckUtils]: 63: Hoare triple {11495#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11495#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:56,854 INFO L273 TraceCheckUtils]: 64: Hoare triple {11495#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11496#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:56,854 INFO L273 TraceCheckUtils]: 65: Hoare triple {11496#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11496#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:56,855 INFO L273 TraceCheckUtils]: 66: Hoare triple {11496#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11496#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:56,856 INFO L273 TraceCheckUtils]: 67: Hoare triple {11496#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11497#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:56,856 INFO L273 TraceCheckUtils]: 68: Hoare triple {11497#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11497#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:56,857 INFO L273 TraceCheckUtils]: 69: Hoare triple {11497#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11497#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:56,857 INFO L273 TraceCheckUtils]: 70: Hoare triple {11497#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11498#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:56,858 INFO L273 TraceCheckUtils]: 71: Hoare triple {11498#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {11498#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:56,858 INFO L273 TraceCheckUtils]: 72: Hoare triple {11498#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {11498#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:56,859 INFO L273 TraceCheckUtils]: 73: Hoare triple {11498#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {11499#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:56,860 INFO L273 TraceCheckUtils]: 74: Hoare triple {11499#(<= main_~i~0 24)} assume !(~i~0 < 100000); {11476#false} is VALID [2018-11-23 11:58:56,860 INFO L273 TraceCheckUtils]: 75: Hoare triple {11476#false} havoc ~x~0;~x~0 := 0; {11476#false} is VALID [2018-11-23 11:58:56,860 INFO L273 TraceCheckUtils]: 76: Hoare triple {11476#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {11476#false} is VALID [2018-11-23 11:58:56,861 INFO L256 TraceCheckUtils]: 77: Hoare triple {11476#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {11476#false} is VALID [2018-11-23 11:58:56,861 INFO L273 TraceCheckUtils]: 78: Hoare triple {11476#false} ~cond := #in~cond; {11476#false} is VALID [2018-11-23 11:58:56,861 INFO L273 TraceCheckUtils]: 79: Hoare triple {11476#false} assume 0 == ~cond; {11476#false} is VALID [2018-11-23 11:58:56,861 INFO L273 TraceCheckUtils]: 80: Hoare triple {11476#false} assume !false; {11476#false} is VALID [2018-11-23 11:58:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:56,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:56,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 25 [2018-11-23 11:58:56,884 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2018-11-23 11:58:56,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:56,885 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states. [2018-11-23 11:58:57,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:57,418 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-11-23 11:58:57,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-11-23 11:58:57,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:58:57,419 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand 25 states. [2018-11-23 11:58:58,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:58,156 INFO L93 Difference]: Finished difference Result 138 states and 195 transitions. [2018-11-23 11:58:58,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-23 11:58:58,157 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 81 [2018-11-23 11:58:58,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:58:58,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:58:58,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 195 transitions. [2018-11-23 11:58:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-23 11:58:58,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 195 transitions. [2018-11-23 11:58:58,160 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 195 transitions. [2018-11-23 11:58:58,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:58:58,342 INFO L225 Difference]: With dead ends: 138 [2018-11-23 11:58:58,342 INFO L226 Difference]: Without dead ends: 121 [2018-11-23 11:58:58,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-11-23 11:58:58,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-11-23 11:58:58,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 118. [2018-11-23 11:58:58,366 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:58:58,366 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand 118 states. [2018-11-23 11:58:58,366 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand 118 states. [2018-11-23 11:58:58,366 INFO L87 Difference]: Start difference. First operand 121 states. Second operand 118 states. [2018-11-23 11:58:58,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:58,369 INFO L93 Difference]: Finished difference Result 121 states and 174 transitions. [2018-11-23 11:58:58,369 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2018-11-23 11:58:58,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:58,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:58,370 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 121 states. [2018-11-23 11:58:58,370 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 121 states. [2018-11-23 11:58:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:58:58,372 INFO L93 Difference]: Finished difference Result 121 states and 174 transitions. [2018-11-23 11:58:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 174 transitions. [2018-11-23 11:58:58,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:58:58,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:58:58,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:58:58,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:58:58,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-11-23 11:58:58,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 169 transitions. [2018-11-23 11:58:58,375 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 169 transitions. Word has length 81 [2018-11-23 11:58:58,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:58:58,375 INFO L480 AbstractCegarLoop]: Abstraction has 118 states and 169 transitions. [2018-11-23 11:58:58,375 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-11-23 11:58:58,375 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 169 transitions. [2018-11-23 11:58:58,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 11:58:58,376 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:58:58,376 INFO L402 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:58:58,376 INFO L423 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:58:58,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:58:58,377 INFO L82 PathProgramCache]: Analyzing trace with hash 1155139105, now seen corresponding path program 23 times [2018-11-23 11:58:58,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:58:58,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:58:58,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:58,378 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:58:58,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:58:58,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:59,006 INFO L256 TraceCheckUtils]: 0: Hoare triple {12311#true} call ULTIMATE.init(); {12311#true} is VALID [2018-11-23 11:58:59,006 INFO L273 TraceCheckUtils]: 1: Hoare triple {12311#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12311#true} is VALID [2018-11-23 11:58:59,006 INFO L273 TraceCheckUtils]: 2: Hoare triple {12311#true} assume true; {12311#true} is VALID [2018-11-23 11:58:59,007 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12311#true} {12311#true} #88#return; {12311#true} is VALID [2018-11-23 11:58:59,007 INFO L256 TraceCheckUtils]: 4: Hoare triple {12311#true} call #t~ret13 := main(); {12311#true} is VALID [2018-11-23 11:58:59,007 INFO L273 TraceCheckUtils]: 5: Hoare triple {12311#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {12311#true} is VALID [2018-11-23 11:58:59,007 INFO L273 TraceCheckUtils]: 6: Hoare triple {12311#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {12311#true} is VALID [2018-11-23 11:58:59,008 INFO L273 TraceCheckUtils]: 7: Hoare triple {12311#true} ~i~0 := 2; {12313#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:59,008 INFO L273 TraceCheckUtils]: 8: Hoare triple {12313#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12313#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:59,009 INFO L273 TraceCheckUtils]: 9: Hoare triple {12313#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12313#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:59,009 INFO L273 TraceCheckUtils]: 10: Hoare triple {12313#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12314#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:59,009 INFO L273 TraceCheckUtils]: 11: Hoare triple {12314#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12314#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:59,010 INFO L273 TraceCheckUtils]: 12: Hoare triple {12314#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12314#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:59,010 INFO L273 TraceCheckUtils]: 13: Hoare triple {12314#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12315#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:59,010 INFO L273 TraceCheckUtils]: 14: Hoare triple {12315#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12315#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:59,011 INFO L273 TraceCheckUtils]: 15: Hoare triple {12315#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12315#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:59,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {12315#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12316#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:59,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {12316#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12316#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:59,012 INFO L273 TraceCheckUtils]: 18: Hoare triple {12316#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12316#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:59,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {12316#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12317#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:59,013 INFO L273 TraceCheckUtils]: 20: Hoare triple {12317#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12317#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:59,013 INFO L273 TraceCheckUtils]: 21: Hoare triple {12317#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12317#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:59,014 INFO L273 TraceCheckUtils]: 22: Hoare triple {12317#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12318#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:59,014 INFO L273 TraceCheckUtils]: 23: Hoare triple {12318#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12318#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:59,015 INFO L273 TraceCheckUtils]: 24: Hoare triple {12318#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12318#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:59,015 INFO L273 TraceCheckUtils]: 25: Hoare triple {12318#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12319#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:59,016 INFO L273 TraceCheckUtils]: 26: Hoare triple {12319#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12319#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:59,016 INFO L273 TraceCheckUtils]: 27: Hoare triple {12319#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12319#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:59,017 INFO L273 TraceCheckUtils]: 28: Hoare triple {12319#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12320#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:59,018 INFO L273 TraceCheckUtils]: 29: Hoare triple {12320#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12320#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:59,018 INFO L273 TraceCheckUtils]: 30: Hoare triple {12320#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12320#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:59,019 INFO L273 TraceCheckUtils]: 31: Hoare triple {12320#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12321#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:59,019 INFO L273 TraceCheckUtils]: 32: Hoare triple {12321#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12321#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:59,020 INFO L273 TraceCheckUtils]: 33: Hoare triple {12321#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12321#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:59,021 INFO L273 TraceCheckUtils]: 34: Hoare triple {12321#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12322#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:59,021 INFO L273 TraceCheckUtils]: 35: Hoare triple {12322#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12322#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:59,022 INFO L273 TraceCheckUtils]: 36: Hoare triple {12322#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12322#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:59,023 INFO L273 TraceCheckUtils]: 37: Hoare triple {12322#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12323#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:59,023 INFO L273 TraceCheckUtils]: 38: Hoare triple {12323#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12323#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:59,024 INFO L273 TraceCheckUtils]: 39: Hoare triple {12323#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12323#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:59,024 INFO L273 TraceCheckUtils]: 40: Hoare triple {12323#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12324#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:59,025 INFO L273 TraceCheckUtils]: 41: Hoare triple {12324#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12324#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:59,025 INFO L273 TraceCheckUtils]: 42: Hoare triple {12324#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12324#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:59,026 INFO L273 TraceCheckUtils]: 43: Hoare triple {12324#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12325#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:59,027 INFO L273 TraceCheckUtils]: 44: Hoare triple {12325#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12325#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:59,027 INFO L273 TraceCheckUtils]: 45: Hoare triple {12325#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12325#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:59,028 INFO L273 TraceCheckUtils]: 46: Hoare triple {12325#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12326#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:59,028 INFO L273 TraceCheckUtils]: 47: Hoare triple {12326#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12326#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:59,029 INFO L273 TraceCheckUtils]: 48: Hoare triple {12326#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12326#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:59,030 INFO L273 TraceCheckUtils]: 49: Hoare triple {12326#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12327#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:59,030 INFO L273 TraceCheckUtils]: 50: Hoare triple {12327#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12327#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:59,031 INFO L273 TraceCheckUtils]: 51: Hoare triple {12327#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12327#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:59,031 INFO L273 TraceCheckUtils]: 52: Hoare triple {12327#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12328#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:59,032 INFO L273 TraceCheckUtils]: 53: Hoare triple {12328#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12328#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:59,032 INFO L273 TraceCheckUtils]: 54: Hoare triple {12328#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12328#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:59,033 INFO L273 TraceCheckUtils]: 55: Hoare triple {12328#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12329#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:59,034 INFO L273 TraceCheckUtils]: 56: Hoare triple {12329#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12329#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:59,034 INFO L273 TraceCheckUtils]: 57: Hoare triple {12329#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12329#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:59,035 INFO L273 TraceCheckUtils]: 58: Hoare triple {12329#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12330#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:59,035 INFO L273 TraceCheckUtils]: 59: Hoare triple {12330#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12330#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:59,036 INFO L273 TraceCheckUtils]: 60: Hoare triple {12330#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12330#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:59,037 INFO L273 TraceCheckUtils]: 61: Hoare triple {12330#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12331#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:59,037 INFO L273 TraceCheckUtils]: 62: Hoare triple {12331#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12331#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:59,038 INFO L273 TraceCheckUtils]: 63: Hoare triple {12331#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12331#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:59,038 INFO L273 TraceCheckUtils]: 64: Hoare triple {12331#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12332#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:59,039 INFO L273 TraceCheckUtils]: 65: Hoare triple {12332#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12332#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:59,040 INFO L273 TraceCheckUtils]: 66: Hoare triple {12332#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12332#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:59,040 INFO L273 TraceCheckUtils]: 67: Hoare triple {12332#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12333#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:59,041 INFO L273 TraceCheckUtils]: 68: Hoare triple {12333#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12333#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:59,041 INFO L273 TraceCheckUtils]: 69: Hoare triple {12333#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12333#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:59,042 INFO L273 TraceCheckUtils]: 70: Hoare triple {12333#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12334#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:59,043 INFO L273 TraceCheckUtils]: 71: Hoare triple {12334#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12334#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:59,043 INFO L273 TraceCheckUtils]: 72: Hoare triple {12334#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12334#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:59,044 INFO L273 TraceCheckUtils]: 73: Hoare triple {12334#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12335#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:59,044 INFO L273 TraceCheckUtils]: 74: Hoare triple {12335#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12335#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:59,045 INFO L273 TraceCheckUtils]: 75: Hoare triple {12335#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12335#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:59,046 INFO L273 TraceCheckUtils]: 76: Hoare triple {12335#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12336#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:59,046 INFO L273 TraceCheckUtils]: 77: Hoare triple {12336#(<= main_~i~0 25)} assume !(~i~0 < 100000); {12312#false} is VALID [2018-11-23 11:58:59,047 INFO L273 TraceCheckUtils]: 78: Hoare triple {12312#false} havoc ~x~0;~x~0 := 0; {12312#false} is VALID [2018-11-23 11:58:59,047 INFO L273 TraceCheckUtils]: 79: Hoare triple {12312#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {12312#false} is VALID [2018-11-23 11:58:59,047 INFO L256 TraceCheckUtils]: 80: Hoare triple {12312#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {12312#false} is VALID [2018-11-23 11:58:59,047 INFO L273 TraceCheckUtils]: 81: Hoare triple {12312#false} ~cond := #in~cond; {12312#false} is VALID [2018-11-23 11:58:59,047 INFO L273 TraceCheckUtils]: 82: Hoare triple {12312#false} assume 0 == ~cond; {12312#false} is VALID [2018-11-23 11:58:59,048 INFO L273 TraceCheckUtils]: 83: Hoare triple {12312#false} assume !false; {12312#false} is VALID [2018-11-23 11:58:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:59,053 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:58:59,053 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-23 11:58:59,062 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:58:59,121 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2018-11-23 11:58:59,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:58:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:58:59,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:58:59,403 INFO L256 TraceCheckUtils]: 0: Hoare triple {12311#true} call ULTIMATE.init(); {12311#true} is VALID [2018-11-23 11:58:59,403 INFO L273 TraceCheckUtils]: 1: Hoare triple {12311#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {12311#true} is VALID [2018-11-23 11:58:59,403 INFO L273 TraceCheckUtils]: 2: Hoare triple {12311#true} assume true; {12311#true} is VALID [2018-11-23 11:58:59,404 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {12311#true} {12311#true} #88#return; {12311#true} is VALID [2018-11-23 11:58:59,404 INFO L256 TraceCheckUtils]: 4: Hoare triple {12311#true} call #t~ret13 := main(); {12311#true} is VALID [2018-11-23 11:58:59,404 INFO L273 TraceCheckUtils]: 5: Hoare triple {12311#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {12311#true} is VALID [2018-11-23 11:58:59,404 INFO L273 TraceCheckUtils]: 6: Hoare triple {12311#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {12311#true} is VALID [2018-11-23 11:58:59,405 INFO L273 TraceCheckUtils]: 7: Hoare triple {12311#true} ~i~0 := 2; {12313#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:59,405 INFO L273 TraceCheckUtils]: 8: Hoare triple {12313#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12313#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:59,406 INFO L273 TraceCheckUtils]: 9: Hoare triple {12313#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12313#(<= main_~i~0 2)} is VALID [2018-11-23 11:58:59,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {12313#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12314#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:59,407 INFO L273 TraceCheckUtils]: 11: Hoare triple {12314#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12314#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:59,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {12314#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12314#(<= main_~i~0 3)} is VALID [2018-11-23 11:58:59,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {12314#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12315#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:59,408 INFO L273 TraceCheckUtils]: 14: Hoare triple {12315#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12315#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:59,408 INFO L273 TraceCheckUtils]: 15: Hoare triple {12315#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12315#(<= main_~i~0 4)} is VALID [2018-11-23 11:58:59,409 INFO L273 TraceCheckUtils]: 16: Hoare triple {12315#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12316#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:59,409 INFO L273 TraceCheckUtils]: 17: Hoare triple {12316#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12316#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:59,410 INFO L273 TraceCheckUtils]: 18: Hoare triple {12316#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12316#(<= main_~i~0 5)} is VALID [2018-11-23 11:58:59,411 INFO L273 TraceCheckUtils]: 19: Hoare triple {12316#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12317#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:59,411 INFO L273 TraceCheckUtils]: 20: Hoare triple {12317#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12317#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:59,412 INFO L273 TraceCheckUtils]: 21: Hoare triple {12317#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12317#(<= main_~i~0 6)} is VALID [2018-11-23 11:58:59,412 INFO L273 TraceCheckUtils]: 22: Hoare triple {12317#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12318#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:59,413 INFO L273 TraceCheckUtils]: 23: Hoare triple {12318#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12318#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:59,414 INFO L273 TraceCheckUtils]: 24: Hoare triple {12318#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12318#(<= main_~i~0 7)} is VALID [2018-11-23 11:58:59,414 INFO L273 TraceCheckUtils]: 25: Hoare triple {12318#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12319#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:59,415 INFO L273 TraceCheckUtils]: 26: Hoare triple {12319#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12319#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:59,415 INFO L273 TraceCheckUtils]: 27: Hoare triple {12319#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12319#(<= main_~i~0 8)} is VALID [2018-11-23 11:58:59,416 INFO L273 TraceCheckUtils]: 28: Hoare triple {12319#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12320#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:59,417 INFO L273 TraceCheckUtils]: 29: Hoare triple {12320#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12320#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:59,417 INFO L273 TraceCheckUtils]: 30: Hoare triple {12320#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12320#(<= main_~i~0 9)} is VALID [2018-11-23 11:58:59,418 INFO L273 TraceCheckUtils]: 31: Hoare triple {12320#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12321#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:59,418 INFO L273 TraceCheckUtils]: 32: Hoare triple {12321#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12321#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:59,419 INFO L273 TraceCheckUtils]: 33: Hoare triple {12321#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12321#(<= main_~i~0 10)} is VALID [2018-11-23 11:58:59,420 INFO L273 TraceCheckUtils]: 34: Hoare triple {12321#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12322#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:59,420 INFO L273 TraceCheckUtils]: 35: Hoare triple {12322#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12322#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:59,421 INFO L273 TraceCheckUtils]: 36: Hoare triple {12322#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12322#(<= main_~i~0 11)} is VALID [2018-11-23 11:58:59,421 INFO L273 TraceCheckUtils]: 37: Hoare triple {12322#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12323#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:59,422 INFO L273 TraceCheckUtils]: 38: Hoare triple {12323#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12323#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:59,422 INFO L273 TraceCheckUtils]: 39: Hoare triple {12323#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12323#(<= main_~i~0 12)} is VALID [2018-11-23 11:58:59,423 INFO L273 TraceCheckUtils]: 40: Hoare triple {12323#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12324#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:59,424 INFO L273 TraceCheckUtils]: 41: Hoare triple {12324#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12324#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:59,424 INFO L273 TraceCheckUtils]: 42: Hoare triple {12324#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12324#(<= main_~i~0 13)} is VALID [2018-11-23 11:58:59,425 INFO L273 TraceCheckUtils]: 43: Hoare triple {12324#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12325#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:59,426 INFO L273 TraceCheckUtils]: 44: Hoare triple {12325#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12325#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:59,426 INFO L273 TraceCheckUtils]: 45: Hoare triple {12325#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12325#(<= main_~i~0 14)} is VALID [2018-11-23 11:58:59,427 INFO L273 TraceCheckUtils]: 46: Hoare triple {12325#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12326#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:59,427 INFO L273 TraceCheckUtils]: 47: Hoare triple {12326#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12326#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:59,428 INFO L273 TraceCheckUtils]: 48: Hoare triple {12326#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12326#(<= main_~i~0 15)} is VALID [2018-11-23 11:58:59,429 INFO L273 TraceCheckUtils]: 49: Hoare triple {12326#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12327#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:59,429 INFO L273 TraceCheckUtils]: 50: Hoare triple {12327#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12327#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:59,430 INFO L273 TraceCheckUtils]: 51: Hoare triple {12327#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12327#(<= main_~i~0 16)} is VALID [2018-11-23 11:58:59,430 INFO L273 TraceCheckUtils]: 52: Hoare triple {12327#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12328#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:59,431 INFO L273 TraceCheckUtils]: 53: Hoare triple {12328#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12328#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:59,431 INFO L273 TraceCheckUtils]: 54: Hoare triple {12328#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12328#(<= main_~i~0 17)} is VALID [2018-11-23 11:58:59,432 INFO L273 TraceCheckUtils]: 55: Hoare triple {12328#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12329#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:59,433 INFO L273 TraceCheckUtils]: 56: Hoare triple {12329#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12329#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:59,433 INFO L273 TraceCheckUtils]: 57: Hoare triple {12329#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12329#(<= main_~i~0 18)} is VALID [2018-11-23 11:58:59,434 INFO L273 TraceCheckUtils]: 58: Hoare triple {12329#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12330#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:59,434 INFO L273 TraceCheckUtils]: 59: Hoare triple {12330#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12330#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:59,435 INFO L273 TraceCheckUtils]: 60: Hoare triple {12330#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12330#(<= main_~i~0 19)} is VALID [2018-11-23 11:58:59,436 INFO L273 TraceCheckUtils]: 61: Hoare triple {12330#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12331#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:59,436 INFO L273 TraceCheckUtils]: 62: Hoare triple {12331#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12331#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:59,437 INFO L273 TraceCheckUtils]: 63: Hoare triple {12331#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12331#(<= main_~i~0 20)} is VALID [2018-11-23 11:58:59,438 INFO L273 TraceCheckUtils]: 64: Hoare triple {12331#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12332#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:59,438 INFO L273 TraceCheckUtils]: 65: Hoare triple {12332#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12332#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:59,439 INFO L273 TraceCheckUtils]: 66: Hoare triple {12332#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12332#(<= main_~i~0 21)} is VALID [2018-11-23 11:58:59,439 INFO L273 TraceCheckUtils]: 67: Hoare triple {12332#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12333#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:59,440 INFO L273 TraceCheckUtils]: 68: Hoare triple {12333#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12333#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:59,440 INFO L273 TraceCheckUtils]: 69: Hoare triple {12333#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12333#(<= main_~i~0 22)} is VALID [2018-11-23 11:58:59,441 INFO L273 TraceCheckUtils]: 70: Hoare triple {12333#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12334#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:59,442 INFO L273 TraceCheckUtils]: 71: Hoare triple {12334#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12334#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:59,442 INFO L273 TraceCheckUtils]: 72: Hoare triple {12334#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12334#(<= main_~i~0 23)} is VALID [2018-11-23 11:58:59,443 INFO L273 TraceCheckUtils]: 73: Hoare triple {12334#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12335#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:59,443 INFO L273 TraceCheckUtils]: 74: Hoare triple {12335#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {12335#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:59,444 INFO L273 TraceCheckUtils]: 75: Hoare triple {12335#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {12335#(<= main_~i~0 24)} is VALID [2018-11-23 11:58:59,445 INFO L273 TraceCheckUtils]: 76: Hoare triple {12335#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {12336#(<= main_~i~0 25)} is VALID [2018-11-23 11:58:59,445 INFO L273 TraceCheckUtils]: 77: Hoare triple {12336#(<= main_~i~0 25)} assume !(~i~0 < 100000); {12312#false} is VALID [2018-11-23 11:58:59,446 INFO L273 TraceCheckUtils]: 78: Hoare triple {12312#false} havoc ~x~0;~x~0 := 0; {12312#false} is VALID [2018-11-23 11:58:59,446 INFO L273 TraceCheckUtils]: 79: Hoare triple {12312#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {12312#false} is VALID [2018-11-23 11:58:59,446 INFO L256 TraceCheckUtils]: 80: Hoare triple {12312#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {12312#false} is VALID [2018-11-23 11:58:59,446 INFO L273 TraceCheckUtils]: 81: Hoare triple {12312#false} ~cond := #in~cond; {12312#false} is VALID [2018-11-23 11:58:59,446 INFO L273 TraceCheckUtils]: 82: Hoare triple {12312#false} assume 0 == ~cond; {12312#false} is VALID [2018-11-23 11:58:59,447 INFO L273 TraceCheckUtils]: 83: Hoare triple {12312#false} assume !false; {12312#false} is VALID [2018-11-23 11:58:59,452 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:58:59,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:58:59,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 26 [2018-11-23 11:58:59,471 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-11-23 11:58:59,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:58:59,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 11:58:59,551 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-23 11:58:59,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 11:58:59,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 11:58:59,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:58:59,553 INFO L87 Difference]: Start difference. First operand 118 states and 169 transitions. Second operand 26 states. [2018-11-23 11:59:00,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,278 INFO L93 Difference]: Finished difference Result 142 states and 201 transitions. [2018-11-23 11:59:00,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:59:00,278 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 84 [2018-11-23 11:59:00,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:00,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:59:00,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 201 transitions. [2018-11-23 11:59:00,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 11:59:00,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 201 transitions. [2018-11-23 11:59:00,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 201 transitions. [2018-11-23 11:59:00,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:00,515 INFO L225 Difference]: With dead ends: 142 [2018-11-23 11:59:00,515 INFO L226 Difference]: Without dead ends: 125 [2018-11-23 11:59:00,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 11:59:00,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-11-23 11:59:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-11-23 11:59:00,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:00,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand 122 states. [2018-11-23 11:59:00,540 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand 122 states. [2018-11-23 11:59:00,540 INFO L87 Difference]: Start difference. First operand 125 states. Second operand 122 states. [2018-11-23 11:59:00,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,543 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2018-11-23 11:59:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions. [2018-11-23 11:59:00,543 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:00,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:00,543 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand 125 states. [2018-11-23 11:59:00,544 INFO L87 Difference]: Start difference. First operand 122 states. Second operand 125 states. [2018-11-23 11:59:00,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:00,546 INFO L93 Difference]: Finished difference Result 125 states and 180 transitions. [2018-11-23 11:59:00,546 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 180 transitions. [2018-11-23 11:59:00,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:00,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:00,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:00,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:00,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-11-23 11:59:00,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 175 transitions. [2018-11-23 11:59:00,549 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 175 transitions. Word has length 84 [2018-11-23 11:59:00,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:00,549 INFO L480 AbstractCegarLoop]: Abstraction has 122 states and 175 transitions. [2018-11-23 11:59:00,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 11:59:00,550 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 175 transitions. [2018-11-23 11:59:00,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 11:59:00,550 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:00,551 INFO L402 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:00,551 INFO L423 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:00,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:00,551 INFO L82 PathProgramCache]: Analyzing trace with hash 2120883420, now seen corresponding path program 24 times [2018-11-23 11:59:00,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:00,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:00,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:00,552 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:00,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:00,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:01,278 INFO L256 TraceCheckUtils]: 0: Hoare triple {13175#true} call ULTIMATE.init(); {13175#true} is VALID [2018-11-23 11:59:01,279 INFO L273 TraceCheckUtils]: 1: Hoare triple {13175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13175#true} is VALID [2018-11-23 11:59:01,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {13175#true} assume true; {13175#true} is VALID [2018-11-23 11:59:01,279 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13175#true} {13175#true} #88#return; {13175#true} is VALID [2018-11-23 11:59:01,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {13175#true} call #t~ret13 := main(); {13175#true} is VALID [2018-11-23 11:59:01,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {13175#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {13175#true} is VALID [2018-11-23 11:59:01,280 INFO L273 TraceCheckUtils]: 6: Hoare triple {13175#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {13175#true} is VALID [2018-11-23 11:59:01,280 INFO L273 TraceCheckUtils]: 7: Hoare triple {13175#true} ~i~0 := 2; {13177#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,281 INFO L273 TraceCheckUtils]: 8: Hoare triple {13177#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13177#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,281 INFO L273 TraceCheckUtils]: 9: Hoare triple {13177#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13177#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,281 INFO L273 TraceCheckUtils]: 10: Hoare triple {13177#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13178#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,282 INFO L273 TraceCheckUtils]: 11: Hoare triple {13178#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13178#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {13178#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13178#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,283 INFO L273 TraceCheckUtils]: 13: Hoare triple {13178#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13179#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:01,283 INFO L273 TraceCheckUtils]: 14: Hoare triple {13179#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13179#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:01,283 INFO L273 TraceCheckUtils]: 15: Hoare triple {13179#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13179#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:01,284 INFO L273 TraceCheckUtils]: 16: Hoare triple {13179#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13180#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:01,284 INFO L273 TraceCheckUtils]: 17: Hoare triple {13180#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13180#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:01,285 INFO L273 TraceCheckUtils]: 18: Hoare triple {13180#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13180#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:01,286 INFO L273 TraceCheckUtils]: 19: Hoare triple {13180#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13181#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:01,286 INFO L273 TraceCheckUtils]: 20: Hoare triple {13181#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13181#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:01,287 INFO L273 TraceCheckUtils]: 21: Hoare triple {13181#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13181#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:01,288 INFO L273 TraceCheckUtils]: 22: Hoare triple {13181#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13182#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:01,288 INFO L273 TraceCheckUtils]: 23: Hoare triple {13182#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13182#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:01,289 INFO L273 TraceCheckUtils]: 24: Hoare triple {13182#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13182#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:01,289 INFO L273 TraceCheckUtils]: 25: Hoare triple {13182#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13183#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:01,290 INFO L273 TraceCheckUtils]: 26: Hoare triple {13183#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13183#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:01,290 INFO L273 TraceCheckUtils]: 27: Hoare triple {13183#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13183#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:01,291 INFO L273 TraceCheckUtils]: 28: Hoare triple {13183#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13184#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:01,292 INFO L273 TraceCheckUtils]: 29: Hoare triple {13184#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13184#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:01,292 INFO L273 TraceCheckUtils]: 30: Hoare triple {13184#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13184#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:01,293 INFO L273 TraceCheckUtils]: 31: Hoare triple {13184#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13185#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:01,293 INFO L273 TraceCheckUtils]: 32: Hoare triple {13185#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13185#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:01,294 INFO L273 TraceCheckUtils]: 33: Hoare triple {13185#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13185#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:01,295 INFO L273 TraceCheckUtils]: 34: Hoare triple {13185#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13186#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:01,295 INFO L273 TraceCheckUtils]: 35: Hoare triple {13186#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13186#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:01,296 INFO L273 TraceCheckUtils]: 36: Hoare triple {13186#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13186#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:01,296 INFO L273 TraceCheckUtils]: 37: Hoare triple {13186#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13187#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:01,297 INFO L273 TraceCheckUtils]: 38: Hoare triple {13187#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13187#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:01,297 INFO L273 TraceCheckUtils]: 39: Hoare triple {13187#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13187#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:01,298 INFO L273 TraceCheckUtils]: 40: Hoare triple {13187#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13188#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:01,299 INFO L273 TraceCheckUtils]: 41: Hoare triple {13188#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13188#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:01,299 INFO L273 TraceCheckUtils]: 42: Hoare triple {13188#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13188#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:01,300 INFO L273 TraceCheckUtils]: 43: Hoare triple {13188#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13189#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,301 INFO L273 TraceCheckUtils]: 44: Hoare triple {13189#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13189#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,301 INFO L273 TraceCheckUtils]: 45: Hoare triple {13189#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13189#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,302 INFO L273 TraceCheckUtils]: 46: Hoare triple {13189#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13190#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:01,302 INFO L273 TraceCheckUtils]: 47: Hoare triple {13190#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13190#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:01,303 INFO L273 TraceCheckUtils]: 48: Hoare triple {13190#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13190#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:01,304 INFO L273 TraceCheckUtils]: 49: Hoare triple {13190#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13191#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:01,304 INFO L273 TraceCheckUtils]: 50: Hoare triple {13191#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13191#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:01,305 INFO L273 TraceCheckUtils]: 51: Hoare triple {13191#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13191#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:01,305 INFO L273 TraceCheckUtils]: 52: Hoare triple {13191#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13192#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:01,306 INFO L273 TraceCheckUtils]: 53: Hoare triple {13192#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13192#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:01,306 INFO L273 TraceCheckUtils]: 54: Hoare triple {13192#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13192#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:01,307 INFO L273 TraceCheckUtils]: 55: Hoare triple {13192#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13193#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:01,308 INFO L273 TraceCheckUtils]: 56: Hoare triple {13193#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13193#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:01,308 INFO L273 TraceCheckUtils]: 57: Hoare triple {13193#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13193#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:01,309 INFO L273 TraceCheckUtils]: 58: Hoare triple {13193#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13194#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:01,309 INFO L273 TraceCheckUtils]: 59: Hoare triple {13194#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13194#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:01,310 INFO L273 TraceCheckUtils]: 60: Hoare triple {13194#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13194#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:01,311 INFO L273 TraceCheckUtils]: 61: Hoare triple {13194#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13195#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:01,311 INFO L273 TraceCheckUtils]: 62: Hoare triple {13195#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13195#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:01,312 INFO L273 TraceCheckUtils]: 63: Hoare triple {13195#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13195#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:01,312 INFO L273 TraceCheckUtils]: 64: Hoare triple {13195#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13196#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:01,313 INFO L273 TraceCheckUtils]: 65: Hoare triple {13196#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13196#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:01,314 INFO L273 TraceCheckUtils]: 66: Hoare triple {13196#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13196#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:01,314 INFO L273 TraceCheckUtils]: 67: Hoare triple {13196#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13197#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:01,315 INFO L273 TraceCheckUtils]: 68: Hoare triple {13197#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13197#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:01,315 INFO L273 TraceCheckUtils]: 69: Hoare triple {13197#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13197#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:01,316 INFO L273 TraceCheckUtils]: 70: Hoare triple {13197#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13198#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:01,317 INFO L273 TraceCheckUtils]: 71: Hoare triple {13198#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13198#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:01,317 INFO L273 TraceCheckUtils]: 72: Hoare triple {13198#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13198#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:01,318 INFO L273 TraceCheckUtils]: 73: Hoare triple {13198#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13199#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:01,318 INFO L273 TraceCheckUtils]: 74: Hoare triple {13199#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13199#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:01,319 INFO L273 TraceCheckUtils]: 75: Hoare triple {13199#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13199#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:01,320 INFO L273 TraceCheckUtils]: 76: Hoare triple {13199#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13200#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:01,320 INFO L273 TraceCheckUtils]: 77: Hoare triple {13200#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13200#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:01,321 INFO L273 TraceCheckUtils]: 78: Hoare triple {13200#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13200#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:01,321 INFO L273 TraceCheckUtils]: 79: Hoare triple {13200#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13201#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:01,322 INFO L273 TraceCheckUtils]: 80: Hoare triple {13201#(<= main_~i~0 26)} assume !(~i~0 < 100000); {13176#false} is VALID [2018-11-23 11:59:01,322 INFO L273 TraceCheckUtils]: 81: Hoare triple {13176#false} havoc ~x~0;~x~0 := 0; {13176#false} is VALID [2018-11-23 11:59:01,323 INFO L273 TraceCheckUtils]: 82: Hoare triple {13176#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {13176#false} is VALID [2018-11-23 11:59:01,323 INFO L256 TraceCheckUtils]: 83: Hoare triple {13176#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {13176#false} is VALID [2018-11-23 11:59:01,323 INFO L273 TraceCheckUtils]: 84: Hoare triple {13176#false} ~cond := #in~cond; {13176#false} is VALID [2018-11-23 11:59:01,323 INFO L273 TraceCheckUtils]: 85: Hoare triple {13176#false} assume 0 == ~cond; {13176#false} is VALID [2018-11-23 11:59:01,323 INFO L273 TraceCheckUtils]: 86: Hoare triple {13176#false} assume !false; {13176#false} is VALID [2018-11-23 11:59:01,330 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:01,330 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:01,330 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-23 11:59:01,338 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:01,402 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2018-11-23 11:59:01,402 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:01,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:01,628 INFO L256 TraceCheckUtils]: 0: Hoare triple {13175#true} call ULTIMATE.init(); {13175#true} is VALID [2018-11-23 11:59:01,629 INFO L273 TraceCheckUtils]: 1: Hoare triple {13175#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {13175#true} is VALID [2018-11-23 11:59:01,629 INFO L273 TraceCheckUtils]: 2: Hoare triple {13175#true} assume true; {13175#true} is VALID [2018-11-23 11:59:01,629 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {13175#true} {13175#true} #88#return; {13175#true} is VALID [2018-11-23 11:59:01,629 INFO L256 TraceCheckUtils]: 4: Hoare triple {13175#true} call #t~ret13 := main(); {13175#true} is VALID [2018-11-23 11:59:01,630 INFO L273 TraceCheckUtils]: 5: Hoare triple {13175#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {13175#true} is VALID [2018-11-23 11:59:01,630 INFO L273 TraceCheckUtils]: 6: Hoare triple {13175#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {13175#true} is VALID [2018-11-23 11:59:01,630 INFO L273 TraceCheckUtils]: 7: Hoare triple {13175#true} ~i~0 := 2; {13177#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,631 INFO L273 TraceCheckUtils]: 8: Hoare triple {13177#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13177#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,631 INFO L273 TraceCheckUtils]: 9: Hoare triple {13177#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13177#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:01,632 INFO L273 TraceCheckUtils]: 10: Hoare triple {13177#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13178#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,632 INFO L273 TraceCheckUtils]: 11: Hoare triple {13178#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13178#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,632 INFO L273 TraceCheckUtils]: 12: Hoare triple {13178#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13178#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:01,633 INFO L273 TraceCheckUtils]: 13: Hoare triple {13178#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13179#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:01,633 INFO L273 TraceCheckUtils]: 14: Hoare triple {13179#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13179#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:01,634 INFO L273 TraceCheckUtils]: 15: Hoare triple {13179#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13179#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:01,634 INFO L273 TraceCheckUtils]: 16: Hoare triple {13179#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13180#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:01,635 INFO L273 TraceCheckUtils]: 17: Hoare triple {13180#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13180#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:01,635 INFO L273 TraceCheckUtils]: 18: Hoare triple {13180#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13180#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:01,636 INFO L273 TraceCheckUtils]: 19: Hoare triple {13180#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13181#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:01,637 INFO L273 TraceCheckUtils]: 20: Hoare triple {13181#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13181#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:01,637 INFO L273 TraceCheckUtils]: 21: Hoare triple {13181#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13181#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:01,638 INFO L273 TraceCheckUtils]: 22: Hoare triple {13181#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13182#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:01,638 INFO L273 TraceCheckUtils]: 23: Hoare triple {13182#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13182#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:01,639 INFO L273 TraceCheckUtils]: 24: Hoare triple {13182#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13182#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:01,640 INFO L273 TraceCheckUtils]: 25: Hoare triple {13182#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13183#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:01,640 INFO L273 TraceCheckUtils]: 26: Hoare triple {13183#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13183#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:01,641 INFO L273 TraceCheckUtils]: 27: Hoare triple {13183#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13183#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:01,642 INFO L273 TraceCheckUtils]: 28: Hoare triple {13183#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13184#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:01,642 INFO L273 TraceCheckUtils]: 29: Hoare triple {13184#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13184#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:01,643 INFO L273 TraceCheckUtils]: 30: Hoare triple {13184#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13184#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:01,643 INFO L273 TraceCheckUtils]: 31: Hoare triple {13184#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13185#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:01,644 INFO L273 TraceCheckUtils]: 32: Hoare triple {13185#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13185#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:01,644 INFO L273 TraceCheckUtils]: 33: Hoare triple {13185#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13185#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:01,645 INFO L273 TraceCheckUtils]: 34: Hoare triple {13185#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13186#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:01,646 INFO L273 TraceCheckUtils]: 35: Hoare triple {13186#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13186#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:01,646 INFO L273 TraceCheckUtils]: 36: Hoare triple {13186#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13186#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:01,647 INFO L273 TraceCheckUtils]: 37: Hoare triple {13186#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13187#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:01,647 INFO L273 TraceCheckUtils]: 38: Hoare triple {13187#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13187#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:01,648 INFO L273 TraceCheckUtils]: 39: Hoare triple {13187#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13187#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:01,649 INFO L273 TraceCheckUtils]: 40: Hoare triple {13187#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13188#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:01,649 INFO L273 TraceCheckUtils]: 41: Hoare triple {13188#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13188#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:01,650 INFO L273 TraceCheckUtils]: 42: Hoare triple {13188#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13188#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:01,650 INFO L273 TraceCheckUtils]: 43: Hoare triple {13188#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13189#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,651 INFO L273 TraceCheckUtils]: 44: Hoare triple {13189#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13189#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,651 INFO L273 TraceCheckUtils]: 45: Hoare triple {13189#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13189#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:01,652 INFO L273 TraceCheckUtils]: 46: Hoare triple {13189#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13190#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:01,653 INFO L273 TraceCheckUtils]: 47: Hoare triple {13190#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13190#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:01,653 INFO L273 TraceCheckUtils]: 48: Hoare triple {13190#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13190#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:01,654 INFO L273 TraceCheckUtils]: 49: Hoare triple {13190#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13191#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:01,654 INFO L273 TraceCheckUtils]: 50: Hoare triple {13191#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13191#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:01,655 INFO L273 TraceCheckUtils]: 51: Hoare triple {13191#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13191#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:01,656 INFO L273 TraceCheckUtils]: 52: Hoare triple {13191#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13192#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:01,656 INFO L273 TraceCheckUtils]: 53: Hoare triple {13192#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13192#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:01,657 INFO L273 TraceCheckUtils]: 54: Hoare triple {13192#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13192#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:01,658 INFO L273 TraceCheckUtils]: 55: Hoare triple {13192#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13193#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:01,658 INFO L273 TraceCheckUtils]: 56: Hoare triple {13193#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13193#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:01,659 INFO L273 TraceCheckUtils]: 57: Hoare triple {13193#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13193#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:01,659 INFO L273 TraceCheckUtils]: 58: Hoare triple {13193#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13194#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:01,660 INFO L273 TraceCheckUtils]: 59: Hoare triple {13194#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13194#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:01,660 INFO L273 TraceCheckUtils]: 60: Hoare triple {13194#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13194#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:01,661 INFO L273 TraceCheckUtils]: 61: Hoare triple {13194#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13195#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:01,662 INFO L273 TraceCheckUtils]: 62: Hoare triple {13195#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13195#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:01,662 INFO L273 TraceCheckUtils]: 63: Hoare triple {13195#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13195#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:01,663 INFO L273 TraceCheckUtils]: 64: Hoare triple {13195#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13196#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:01,663 INFO L273 TraceCheckUtils]: 65: Hoare triple {13196#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13196#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:01,664 INFO L273 TraceCheckUtils]: 66: Hoare triple {13196#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13196#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:01,665 INFO L273 TraceCheckUtils]: 67: Hoare triple {13196#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13197#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:01,665 INFO L273 TraceCheckUtils]: 68: Hoare triple {13197#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13197#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:01,666 INFO L273 TraceCheckUtils]: 69: Hoare triple {13197#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13197#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:01,666 INFO L273 TraceCheckUtils]: 70: Hoare triple {13197#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13198#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:01,667 INFO L273 TraceCheckUtils]: 71: Hoare triple {13198#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13198#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:01,667 INFO L273 TraceCheckUtils]: 72: Hoare triple {13198#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13198#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:01,668 INFO L273 TraceCheckUtils]: 73: Hoare triple {13198#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13199#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:01,669 INFO L273 TraceCheckUtils]: 74: Hoare triple {13199#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13199#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:01,669 INFO L273 TraceCheckUtils]: 75: Hoare triple {13199#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13199#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:01,670 INFO L273 TraceCheckUtils]: 76: Hoare triple {13199#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13200#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:01,671 INFO L273 TraceCheckUtils]: 77: Hoare triple {13200#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {13200#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:01,671 INFO L273 TraceCheckUtils]: 78: Hoare triple {13200#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {13200#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:01,672 INFO L273 TraceCheckUtils]: 79: Hoare triple {13200#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {13201#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:01,672 INFO L273 TraceCheckUtils]: 80: Hoare triple {13201#(<= main_~i~0 26)} assume !(~i~0 < 100000); {13176#false} is VALID [2018-11-23 11:59:01,673 INFO L273 TraceCheckUtils]: 81: Hoare triple {13176#false} havoc ~x~0;~x~0 := 0; {13176#false} is VALID [2018-11-23 11:59:01,673 INFO L273 TraceCheckUtils]: 82: Hoare triple {13176#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {13176#false} is VALID [2018-11-23 11:59:01,673 INFO L256 TraceCheckUtils]: 83: Hoare triple {13176#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {13176#false} is VALID [2018-11-23 11:59:01,673 INFO L273 TraceCheckUtils]: 84: Hoare triple {13176#false} ~cond := #in~cond; {13176#false} is VALID [2018-11-23 11:59:01,674 INFO L273 TraceCheckUtils]: 85: Hoare triple {13176#false} assume 0 == ~cond; {13176#false} is VALID [2018-11-23 11:59:01,674 INFO L273 TraceCheckUtils]: 86: Hoare triple {13176#false} assume !false; {13176#false} is VALID [2018-11-23 11:59:01,680 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:01,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:01,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27] total 27 [2018-11-23 11:59:01,699 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 87 [2018-11-23 11:59:01,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:01,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2018-11-23 11:59:01,781 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-23 11:59:01,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-11-23 11:59:01,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-11-23 11:59:01,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:59:01,783 INFO L87 Difference]: Start difference. First operand 122 states and 175 transitions. Second operand 27 states. [2018-11-23 11:59:02,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,629 INFO L93 Difference]: Finished difference Result 146 states and 207 transitions. [2018-11-23 11:59:02,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-23 11:59:02,629 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 87 [2018-11-23 11:59:02,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:59:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 207 transitions. [2018-11-23 11:59:02,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:59:02,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 207 transitions. [2018-11-23 11:59:02,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 207 transitions. [2018-11-23 11:59:02,891 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-23 11:59:02,893 INFO L225 Difference]: With dead ends: 146 [2018-11-23 11:59:02,893 INFO L226 Difference]: Without dead ends: 129 [2018-11-23 11:59:02,894 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-11-23 11:59:02,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-11-23 11:59:02,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-11-23 11:59:02,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:02,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand 126 states. [2018-11-23 11:59:02,990 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand 126 states. [2018-11-23 11:59:02,990 INFO L87 Difference]: Start difference. First operand 129 states. Second operand 126 states. [2018-11-23 11:59:02,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,993 INFO L93 Difference]: Finished difference Result 129 states and 186 transitions. [2018-11-23 11:59:02,993 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2018-11-23 11:59:02,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,994 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand 129 states. [2018-11-23 11:59:02,994 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 129 states. [2018-11-23 11:59:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:02,996 INFO L93 Difference]: Finished difference Result 129 states and 186 transitions. [2018-11-23 11:59:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 186 transitions. [2018-11-23 11:59:02,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:02,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:02,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:02,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:02,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-11-23 11:59:02,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 181 transitions. [2018-11-23 11:59:02,999 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 181 transitions. Word has length 87 [2018-11-23 11:59:03,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:03,000 INFO L480 AbstractCegarLoop]: Abstraction has 126 states and 181 transitions. [2018-11-23 11:59:03,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-11-23 11:59:03,000 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 181 transitions. [2018-11-23 11:59:03,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-11-23 11:59:03,001 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:03,001 INFO L402 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:03,001 INFO L423 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:03,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:03,001 INFO L82 PathProgramCache]: Analyzing trace with hash 623855681, now seen corresponding path program 25 times [2018-11-23 11:59:03,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:03,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:03,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:03,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:03,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,734 INFO L256 TraceCheckUtils]: 0: Hoare triple {14067#true} call ULTIMATE.init(); {14067#true} is VALID [2018-11-23 11:59:04,734 INFO L273 TraceCheckUtils]: 1: Hoare triple {14067#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14067#true} is VALID [2018-11-23 11:59:04,734 INFO L273 TraceCheckUtils]: 2: Hoare triple {14067#true} assume true; {14067#true} is VALID [2018-11-23 11:59:04,734 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14067#true} {14067#true} #88#return; {14067#true} is VALID [2018-11-23 11:59:04,734 INFO L256 TraceCheckUtils]: 4: Hoare triple {14067#true} call #t~ret13 := main(); {14067#true} is VALID [2018-11-23 11:59:04,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {14067#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {14067#true} is VALID [2018-11-23 11:59:04,735 INFO L273 TraceCheckUtils]: 6: Hoare triple {14067#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {14067#true} is VALID [2018-11-23 11:59:04,735 INFO L273 TraceCheckUtils]: 7: Hoare triple {14067#true} ~i~0 := 2; {14069#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:04,735 INFO L273 TraceCheckUtils]: 8: Hoare triple {14069#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14069#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:04,736 INFO L273 TraceCheckUtils]: 9: Hoare triple {14069#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14069#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:04,737 INFO L273 TraceCheckUtils]: 10: Hoare triple {14069#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14070#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:04,737 INFO L273 TraceCheckUtils]: 11: Hoare triple {14070#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14070#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:04,738 INFO L273 TraceCheckUtils]: 12: Hoare triple {14070#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14070#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:04,738 INFO L273 TraceCheckUtils]: 13: Hoare triple {14070#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14071#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:04,739 INFO L273 TraceCheckUtils]: 14: Hoare triple {14071#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14071#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:04,739 INFO L273 TraceCheckUtils]: 15: Hoare triple {14071#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14071#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:04,740 INFO L273 TraceCheckUtils]: 16: Hoare triple {14071#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14072#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:04,741 INFO L273 TraceCheckUtils]: 17: Hoare triple {14072#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14072#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:04,741 INFO L273 TraceCheckUtils]: 18: Hoare triple {14072#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14072#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:04,742 INFO L273 TraceCheckUtils]: 19: Hoare triple {14072#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14073#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:04,742 INFO L273 TraceCheckUtils]: 20: Hoare triple {14073#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14073#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:04,743 INFO L273 TraceCheckUtils]: 21: Hoare triple {14073#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14073#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:04,744 INFO L273 TraceCheckUtils]: 22: Hoare triple {14073#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14074#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:04,744 INFO L273 TraceCheckUtils]: 23: Hoare triple {14074#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14074#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:04,745 INFO L273 TraceCheckUtils]: 24: Hoare triple {14074#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14074#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:04,745 INFO L273 TraceCheckUtils]: 25: Hoare triple {14074#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14075#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:04,746 INFO L273 TraceCheckUtils]: 26: Hoare triple {14075#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14075#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:04,747 INFO L273 TraceCheckUtils]: 27: Hoare triple {14075#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14075#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:04,747 INFO L273 TraceCheckUtils]: 28: Hoare triple {14075#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14076#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:04,748 INFO L273 TraceCheckUtils]: 29: Hoare triple {14076#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14076#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:04,748 INFO L273 TraceCheckUtils]: 30: Hoare triple {14076#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14076#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:04,749 INFO L273 TraceCheckUtils]: 31: Hoare triple {14076#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14077#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:04,750 INFO L273 TraceCheckUtils]: 32: Hoare triple {14077#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14077#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:04,750 INFO L273 TraceCheckUtils]: 33: Hoare triple {14077#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14077#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:04,751 INFO L273 TraceCheckUtils]: 34: Hoare triple {14077#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14078#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:04,751 INFO L273 TraceCheckUtils]: 35: Hoare triple {14078#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14078#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:04,752 INFO L273 TraceCheckUtils]: 36: Hoare triple {14078#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14078#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:04,753 INFO L273 TraceCheckUtils]: 37: Hoare triple {14078#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14079#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:04,753 INFO L273 TraceCheckUtils]: 38: Hoare triple {14079#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14079#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:04,754 INFO L273 TraceCheckUtils]: 39: Hoare triple {14079#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14079#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:04,754 INFO L273 TraceCheckUtils]: 40: Hoare triple {14079#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14080#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:04,755 INFO L273 TraceCheckUtils]: 41: Hoare triple {14080#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14080#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:04,755 INFO L273 TraceCheckUtils]: 42: Hoare triple {14080#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14080#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:04,756 INFO L273 TraceCheckUtils]: 43: Hoare triple {14080#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14081#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:04,757 INFO L273 TraceCheckUtils]: 44: Hoare triple {14081#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14081#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:04,757 INFO L273 TraceCheckUtils]: 45: Hoare triple {14081#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14081#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:04,758 INFO L273 TraceCheckUtils]: 46: Hoare triple {14081#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14082#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:04,759 INFO L273 TraceCheckUtils]: 47: Hoare triple {14082#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14082#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:04,759 INFO L273 TraceCheckUtils]: 48: Hoare triple {14082#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14082#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:04,760 INFO L273 TraceCheckUtils]: 49: Hoare triple {14082#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14083#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:04,760 INFO L273 TraceCheckUtils]: 50: Hoare triple {14083#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14083#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:04,761 INFO L273 TraceCheckUtils]: 51: Hoare triple {14083#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14083#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:04,762 INFO L273 TraceCheckUtils]: 52: Hoare triple {14083#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14084#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:04,762 INFO L273 TraceCheckUtils]: 53: Hoare triple {14084#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14084#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:04,763 INFO L273 TraceCheckUtils]: 54: Hoare triple {14084#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14084#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:04,763 INFO L273 TraceCheckUtils]: 55: Hoare triple {14084#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14085#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:04,764 INFO L273 TraceCheckUtils]: 56: Hoare triple {14085#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14085#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:04,764 INFO L273 TraceCheckUtils]: 57: Hoare triple {14085#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14085#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:04,765 INFO L273 TraceCheckUtils]: 58: Hoare triple {14085#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14086#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:04,766 INFO L273 TraceCheckUtils]: 59: Hoare triple {14086#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14086#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:04,766 INFO L273 TraceCheckUtils]: 60: Hoare triple {14086#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14086#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:04,767 INFO L273 TraceCheckUtils]: 61: Hoare triple {14086#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14087#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:04,768 INFO L273 TraceCheckUtils]: 62: Hoare triple {14087#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14087#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:04,768 INFO L273 TraceCheckUtils]: 63: Hoare triple {14087#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14087#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:04,769 INFO L273 TraceCheckUtils]: 64: Hoare triple {14087#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14088#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:04,769 INFO L273 TraceCheckUtils]: 65: Hoare triple {14088#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14088#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:04,770 INFO L273 TraceCheckUtils]: 66: Hoare triple {14088#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14088#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:04,771 INFO L273 TraceCheckUtils]: 67: Hoare triple {14088#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14089#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:04,771 INFO L273 TraceCheckUtils]: 68: Hoare triple {14089#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14089#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:04,772 INFO L273 TraceCheckUtils]: 69: Hoare triple {14089#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14089#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:04,772 INFO L273 TraceCheckUtils]: 70: Hoare triple {14089#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14090#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:04,773 INFO L273 TraceCheckUtils]: 71: Hoare triple {14090#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14090#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:04,773 INFO L273 TraceCheckUtils]: 72: Hoare triple {14090#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14090#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:04,774 INFO L273 TraceCheckUtils]: 73: Hoare triple {14090#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14091#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:04,775 INFO L273 TraceCheckUtils]: 74: Hoare triple {14091#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14091#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:04,775 INFO L273 TraceCheckUtils]: 75: Hoare triple {14091#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14091#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:04,776 INFO L273 TraceCheckUtils]: 76: Hoare triple {14091#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14092#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:04,776 INFO L273 TraceCheckUtils]: 77: Hoare triple {14092#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14092#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:04,785 INFO L273 TraceCheckUtils]: 78: Hoare triple {14092#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14092#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:04,785 INFO L273 TraceCheckUtils]: 79: Hoare triple {14092#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14093#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:04,786 INFO L273 TraceCheckUtils]: 80: Hoare triple {14093#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14093#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:04,786 INFO L273 TraceCheckUtils]: 81: Hoare triple {14093#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14093#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:04,787 INFO L273 TraceCheckUtils]: 82: Hoare triple {14093#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14094#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:04,787 INFO L273 TraceCheckUtils]: 83: Hoare triple {14094#(<= main_~i~0 27)} assume !(~i~0 < 100000); {14068#false} is VALID [2018-11-23 11:59:04,787 INFO L273 TraceCheckUtils]: 84: Hoare triple {14068#false} havoc ~x~0;~x~0 := 0; {14068#false} is VALID [2018-11-23 11:59:04,787 INFO L273 TraceCheckUtils]: 85: Hoare triple {14068#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {14068#false} is VALID [2018-11-23 11:59:04,787 INFO L256 TraceCheckUtils]: 86: Hoare triple {14068#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {14068#false} is VALID [2018-11-23 11:59:04,787 INFO L273 TraceCheckUtils]: 87: Hoare triple {14068#false} ~cond := #in~cond; {14068#false} is VALID [2018-11-23 11:59:04,788 INFO L273 TraceCheckUtils]: 88: Hoare triple {14068#false} assume 0 == ~cond; {14068#false} is VALID [2018-11-23 11:59:04,788 INFO L273 TraceCheckUtils]: 89: Hoare triple {14068#false} assume !false; {14068#false} is VALID [2018-11-23 11:59:04,793 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:04,793 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:04,793 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-23 11:59:04,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:04,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:04,887 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:05,116 INFO L256 TraceCheckUtils]: 0: Hoare triple {14067#true} call ULTIMATE.init(); {14067#true} is VALID [2018-11-23 11:59:05,117 INFO L273 TraceCheckUtils]: 1: Hoare triple {14067#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14067#true} is VALID [2018-11-23 11:59:05,117 INFO L273 TraceCheckUtils]: 2: Hoare triple {14067#true} assume true; {14067#true} is VALID [2018-11-23 11:59:05,117 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14067#true} {14067#true} #88#return; {14067#true} is VALID [2018-11-23 11:59:05,117 INFO L256 TraceCheckUtils]: 4: Hoare triple {14067#true} call #t~ret13 := main(); {14067#true} is VALID [2018-11-23 11:59:05,118 INFO L273 TraceCheckUtils]: 5: Hoare triple {14067#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {14067#true} is VALID [2018-11-23 11:59:05,118 INFO L273 TraceCheckUtils]: 6: Hoare triple {14067#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {14067#true} is VALID [2018-11-23 11:59:05,118 INFO L273 TraceCheckUtils]: 7: Hoare triple {14067#true} ~i~0 := 2; {14069#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,119 INFO L273 TraceCheckUtils]: 8: Hoare triple {14069#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14069#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,119 INFO L273 TraceCheckUtils]: 9: Hoare triple {14069#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14069#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:05,120 INFO L273 TraceCheckUtils]: 10: Hoare triple {14069#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14070#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,121 INFO L273 TraceCheckUtils]: 11: Hoare triple {14070#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14070#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,121 INFO L273 TraceCheckUtils]: 12: Hoare triple {14070#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14070#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:05,121 INFO L273 TraceCheckUtils]: 13: Hoare triple {14070#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14071#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:05,122 INFO L273 TraceCheckUtils]: 14: Hoare triple {14071#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14071#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:05,122 INFO L273 TraceCheckUtils]: 15: Hoare triple {14071#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14071#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:05,122 INFO L273 TraceCheckUtils]: 16: Hoare triple {14071#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14072#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:05,123 INFO L273 TraceCheckUtils]: 17: Hoare triple {14072#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14072#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:05,124 INFO L273 TraceCheckUtils]: 18: Hoare triple {14072#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14072#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:05,124 INFO L273 TraceCheckUtils]: 19: Hoare triple {14072#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14073#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:05,125 INFO L273 TraceCheckUtils]: 20: Hoare triple {14073#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14073#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:05,125 INFO L273 TraceCheckUtils]: 21: Hoare triple {14073#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14073#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:05,126 INFO L273 TraceCheckUtils]: 22: Hoare triple {14073#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14074#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:05,148 INFO L273 TraceCheckUtils]: 23: Hoare triple {14074#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14074#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:05,153 INFO L273 TraceCheckUtils]: 24: Hoare triple {14074#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14074#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:05,154 INFO L273 TraceCheckUtils]: 25: Hoare triple {14074#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14075#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:05,154 INFO L273 TraceCheckUtils]: 26: Hoare triple {14075#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14075#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:05,154 INFO L273 TraceCheckUtils]: 27: Hoare triple {14075#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14075#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:05,155 INFO L273 TraceCheckUtils]: 28: Hoare triple {14075#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14076#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:05,155 INFO L273 TraceCheckUtils]: 29: Hoare triple {14076#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14076#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:05,155 INFO L273 TraceCheckUtils]: 30: Hoare triple {14076#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14076#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:05,156 INFO L273 TraceCheckUtils]: 31: Hoare triple {14076#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14077#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:05,156 INFO L273 TraceCheckUtils]: 32: Hoare triple {14077#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14077#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:05,157 INFO L273 TraceCheckUtils]: 33: Hoare triple {14077#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14077#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:05,157 INFO L273 TraceCheckUtils]: 34: Hoare triple {14077#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14078#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:05,157 INFO L273 TraceCheckUtils]: 35: Hoare triple {14078#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14078#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:05,158 INFO L273 TraceCheckUtils]: 36: Hoare triple {14078#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14078#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:05,158 INFO L273 TraceCheckUtils]: 37: Hoare triple {14078#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14079#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:05,159 INFO L273 TraceCheckUtils]: 38: Hoare triple {14079#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14079#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:05,159 INFO L273 TraceCheckUtils]: 39: Hoare triple {14079#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14079#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:05,160 INFO L273 TraceCheckUtils]: 40: Hoare triple {14079#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14080#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:05,161 INFO L273 TraceCheckUtils]: 41: Hoare triple {14080#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14080#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:05,161 INFO L273 TraceCheckUtils]: 42: Hoare triple {14080#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14080#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:05,162 INFO L273 TraceCheckUtils]: 43: Hoare triple {14080#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14081#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:05,162 INFO L273 TraceCheckUtils]: 44: Hoare triple {14081#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14081#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:05,163 INFO L273 TraceCheckUtils]: 45: Hoare triple {14081#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14081#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:05,164 INFO L273 TraceCheckUtils]: 46: Hoare triple {14081#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14082#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:05,164 INFO L273 TraceCheckUtils]: 47: Hoare triple {14082#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14082#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:05,167 INFO L273 TraceCheckUtils]: 48: Hoare triple {14082#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14082#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:05,168 INFO L273 TraceCheckUtils]: 49: Hoare triple {14082#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14083#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:05,170 INFO L273 TraceCheckUtils]: 50: Hoare triple {14083#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14083#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:05,170 INFO L273 TraceCheckUtils]: 51: Hoare triple {14083#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14083#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:05,172 INFO L273 TraceCheckUtils]: 52: Hoare triple {14083#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14084#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:05,173 INFO L273 TraceCheckUtils]: 53: Hoare triple {14084#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14084#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:05,173 INFO L273 TraceCheckUtils]: 54: Hoare triple {14084#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14084#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:05,174 INFO L273 TraceCheckUtils]: 55: Hoare triple {14084#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14085#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:05,174 INFO L273 TraceCheckUtils]: 56: Hoare triple {14085#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14085#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:05,174 INFO L273 TraceCheckUtils]: 57: Hoare triple {14085#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14085#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:05,175 INFO L273 TraceCheckUtils]: 58: Hoare triple {14085#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14086#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:05,175 INFO L273 TraceCheckUtils]: 59: Hoare triple {14086#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14086#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:05,176 INFO L273 TraceCheckUtils]: 60: Hoare triple {14086#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14086#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:05,176 INFO L273 TraceCheckUtils]: 61: Hoare triple {14086#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14087#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:05,177 INFO L273 TraceCheckUtils]: 62: Hoare triple {14087#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14087#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:05,177 INFO L273 TraceCheckUtils]: 63: Hoare triple {14087#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14087#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:05,178 INFO L273 TraceCheckUtils]: 64: Hoare triple {14087#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14088#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:05,179 INFO L273 TraceCheckUtils]: 65: Hoare triple {14088#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14088#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:05,179 INFO L273 TraceCheckUtils]: 66: Hoare triple {14088#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14088#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:05,180 INFO L273 TraceCheckUtils]: 67: Hoare triple {14088#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14089#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:05,180 INFO L273 TraceCheckUtils]: 68: Hoare triple {14089#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14089#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:05,181 INFO L273 TraceCheckUtils]: 69: Hoare triple {14089#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14089#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:05,182 INFO L273 TraceCheckUtils]: 70: Hoare triple {14089#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14090#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:05,182 INFO L273 TraceCheckUtils]: 71: Hoare triple {14090#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14090#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:05,183 INFO L273 TraceCheckUtils]: 72: Hoare triple {14090#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14090#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:05,183 INFO L273 TraceCheckUtils]: 73: Hoare triple {14090#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14091#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:05,184 INFO L273 TraceCheckUtils]: 74: Hoare triple {14091#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14091#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:05,185 INFO L273 TraceCheckUtils]: 75: Hoare triple {14091#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14091#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:05,185 INFO L273 TraceCheckUtils]: 76: Hoare triple {14091#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14092#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:05,186 INFO L273 TraceCheckUtils]: 77: Hoare triple {14092#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14092#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:05,186 INFO L273 TraceCheckUtils]: 78: Hoare triple {14092#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14092#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:05,187 INFO L273 TraceCheckUtils]: 79: Hoare triple {14092#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14093#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:05,188 INFO L273 TraceCheckUtils]: 80: Hoare triple {14093#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14093#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:05,188 INFO L273 TraceCheckUtils]: 81: Hoare triple {14093#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14093#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:05,189 INFO L273 TraceCheckUtils]: 82: Hoare triple {14093#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14094#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:05,190 INFO L273 TraceCheckUtils]: 83: Hoare triple {14094#(<= main_~i~0 27)} assume !(~i~0 < 100000); {14068#false} is VALID [2018-11-23 11:59:05,190 INFO L273 TraceCheckUtils]: 84: Hoare triple {14068#false} havoc ~x~0;~x~0 := 0; {14068#false} is VALID [2018-11-23 11:59:05,190 INFO L273 TraceCheckUtils]: 85: Hoare triple {14068#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {14068#false} is VALID [2018-11-23 11:59:05,190 INFO L256 TraceCheckUtils]: 86: Hoare triple {14068#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {14068#false} is VALID [2018-11-23 11:59:05,190 INFO L273 TraceCheckUtils]: 87: Hoare triple {14068#false} ~cond := #in~cond; {14068#false} is VALID [2018-11-23 11:59:05,191 INFO L273 TraceCheckUtils]: 88: Hoare triple {14068#false} assume 0 == ~cond; {14068#false} is VALID [2018-11-23 11:59:05,191 INFO L273 TraceCheckUtils]: 89: Hoare triple {14068#false} assume !false; {14068#false} is VALID [2018-11-23 11:59:05,197 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:05,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:05,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 28 [2018-11-23 11:59:05,215 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 90 [2018-11-23 11:59:05,216 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:05,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:59:05,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:05,301 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:59:05,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:59:05,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:59:05,302 INFO L87 Difference]: Start difference. First operand 126 states and 181 transitions. Second operand 28 states. [2018-11-23 11:59:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,016 INFO L93 Difference]: Finished difference Result 150 states and 213 transitions. [2018-11-23 11:59:06,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-23 11:59:06,016 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 90 [2018-11-23 11:59:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:06,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:59:06,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 213 transitions. [2018-11-23 11:59:06,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:59:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 213 transitions. [2018-11-23 11:59:06,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 213 transitions. [2018-11-23 11:59:06,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:06,226 INFO L225 Difference]: With dead ends: 150 [2018-11-23 11:59:06,226 INFO L226 Difference]: Without dead ends: 133 [2018-11-23 11:59:06,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:59:06,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-11-23 11:59:06,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2018-11-23 11:59:06,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:06,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand 130 states. [2018-11-23 11:59:06,253 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand 130 states. [2018-11-23 11:59:06,253 INFO L87 Difference]: Start difference. First operand 133 states. Second operand 130 states. [2018-11-23 11:59:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,256 INFO L93 Difference]: Finished difference Result 133 states and 192 transitions. [2018-11-23 11:59:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 192 transitions. [2018-11-23 11:59:06,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,257 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand 133 states. [2018-11-23 11:59:06,257 INFO L87 Difference]: Start difference. First operand 130 states. Second operand 133 states. [2018-11-23 11:59:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:06,259 INFO L93 Difference]: Finished difference Result 133 states and 192 transitions. [2018-11-23 11:59:06,259 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 192 transitions. [2018-11-23 11:59:06,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:06,260 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:06,260 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:06,260 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-11-23 11:59:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 187 transitions. [2018-11-23 11:59:06,262 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 187 transitions. Word has length 90 [2018-11-23 11:59:06,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:06,263 INFO L480 AbstractCegarLoop]: Abstraction has 130 states and 187 transitions. [2018-11-23 11:59:06,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:59:06,263 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 187 transitions. [2018-11-23 11:59:06,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-11-23 11:59:06,264 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:06,264 INFO L402 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:06,264 INFO L423 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:06,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:06,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1610884796, now seen corresponding path program 26 times [2018-11-23 11:59:06,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:06,265 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:06,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:06,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:06,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,385 INFO L256 TraceCheckUtils]: 0: Hoare triple {14987#true} call ULTIMATE.init(); {14987#true} is VALID [2018-11-23 11:59:07,386 INFO L273 TraceCheckUtils]: 1: Hoare triple {14987#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14987#true} is VALID [2018-11-23 11:59:07,386 INFO L273 TraceCheckUtils]: 2: Hoare triple {14987#true} assume true; {14987#true} is VALID [2018-11-23 11:59:07,386 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14987#true} {14987#true} #88#return; {14987#true} is VALID [2018-11-23 11:59:07,386 INFO L256 TraceCheckUtils]: 4: Hoare triple {14987#true} call #t~ret13 := main(); {14987#true} is VALID [2018-11-23 11:59:07,387 INFO L273 TraceCheckUtils]: 5: Hoare triple {14987#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {14987#true} is VALID [2018-11-23 11:59:07,387 INFO L273 TraceCheckUtils]: 6: Hoare triple {14987#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {14987#true} is VALID [2018-11-23 11:59:07,387 INFO L273 TraceCheckUtils]: 7: Hoare triple {14987#true} ~i~0 := 2; {14989#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,388 INFO L273 TraceCheckUtils]: 8: Hoare triple {14989#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14989#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,388 INFO L273 TraceCheckUtils]: 9: Hoare triple {14989#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14989#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,389 INFO L273 TraceCheckUtils]: 10: Hoare triple {14989#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14990#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,390 INFO L273 TraceCheckUtils]: 11: Hoare triple {14990#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14990#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,390 INFO L273 TraceCheckUtils]: 12: Hoare triple {14990#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14990#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,391 INFO L273 TraceCheckUtils]: 13: Hoare triple {14990#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14991#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,392 INFO L273 TraceCheckUtils]: 14: Hoare triple {14991#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14991#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,392 INFO L273 TraceCheckUtils]: 15: Hoare triple {14991#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14991#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,393 INFO L273 TraceCheckUtils]: 16: Hoare triple {14991#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14992#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,393 INFO L273 TraceCheckUtils]: 17: Hoare triple {14992#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14992#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,394 INFO L273 TraceCheckUtils]: 18: Hoare triple {14992#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14992#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,395 INFO L273 TraceCheckUtils]: 19: Hoare triple {14992#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14993#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,395 INFO L273 TraceCheckUtils]: 20: Hoare triple {14993#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14993#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,396 INFO L273 TraceCheckUtils]: 21: Hoare triple {14993#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14993#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,396 INFO L273 TraceCheckUtils]: 22: Hoare triple {14993#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14994#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,397 INFO L273 TraceCheckUtils]: 23: Hoare triple {14994#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14994#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,397 INFO L273 TraceCheckUtils]: 24: Hoare triple {14994#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14994#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,398 INFO L273 TraceCheckUtils]: 25: Hoare triple {14994#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14995#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,399 INFO L273 TraceCheckUtils]: 26: Hoare triple {14995#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14995#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,399 INFO L273 TraceCheckUtils]: 27: Hoare triple {14995#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14995#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,400 INFO L273 TraceCheckUtils]: 28: Hoare triple {14995#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14996#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,401 INFO L273 TraceCheckUtils]: 29: Hoare triple {14996#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14996#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,401 INFO L273 TraceCheckUtils]: 30: Hoare triple {14996#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14996#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,402 INFO L273 TraceCheckUtils]: 31: Hoare triple {14996#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14997#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,402 INFO L273 TraceCheckUtils]: 32: Hoare triple {14997#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14997#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,403 INFO L273 TraceCheckUtils]: 33: Hoare triple {14997#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14997#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,404 INFO L273 TraceCheckUtils]: 34: Hoare triple {14997#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14998#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,404 INFO L273 TraceCheckUtils]: 35: Hoare triple {14998#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14998#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,405 INFO L273 TraceCheckUtils]: 36: Hoare triple {14998#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14998#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,405 INFO L273 TraceCheckUtils]: 37: Hoare triple {14998#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14999#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,406 INFO L273 TraceCheckUtils]: 38: Hoare triple {14999#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14999#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,406 INFO L273 TraceCheckUtils]: 39: Hoare triple {14999#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14999#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,407 INFO L273 TraceCheckUtils]: 40: Hoare triple {14999#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15000#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,408 INFO L273 TraceCheckUtils]: 41: Hoare triple {15000#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15000#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,408 INFO L273 TraceCheckUtils]: 42: Hoare triple {15000#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15000#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,409 INFO L273 TraceCheckUtils]: 43: Hoare triple {15000#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15001#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,409 INFO L273 TraceCheckUtils]: 44: Hoare triple {15001#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15001#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,410 INFO L273 TraceCheckUtils]: 45: Hoare triple {15001#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15001#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,411 INFO L273 TraceCheckUtils]: 46: Hoare triple {15001#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15002#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,411 INFO L273 TraceCheckUtils]: 47: Hoare triple {15002#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15002#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,412 INFO L273 TraceCheckUtils]: 48: Hoare triple {15002#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15002#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,412 INFO L273 TraceCheckUtils]: 49: Hoare triple {15002#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15003#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,413 INFO L273 TraceCheckUtils]: 50: Hoare triple {15003#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15003#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,413 INFO L273 TraceCheckUtils]: 51: Hoare triple {15003#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15003#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,414 INFO L273 TraceCheckUtils]: 52: Hoare triple {15003#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15004#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,415 INFO L273 TraceCheckUtils]: 53: Hoare triple {15004#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15004#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,415 INFO L273 TraceCheckUtils]: 54: Hoare triple {15004#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15004#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,416 INFO L273 TraceCheckUtils]: 55: Hoare triple {15004#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15005#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:07,417 INFO L273 TraceCheckUtils]: 56: Hoare triple {15005#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15005#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:07,417 INFO L273 TraceCheckUtils]: 57: Hoare triple {15005#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15005#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:07,418 INFO L273 TraceCheckUtils]: 58: Hoare triple {15005#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15006#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:07,418 INFO L273 TraceCheckUtils]: 59: Hoare triple {15006#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15006#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:07,419 INFO L273 TraceCheckUtils]: 60: Hoare triple {15006#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15006#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:07,420 INFO L273 TraceCheckUtils]: 61: Hoare triple {15006#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15007#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:07,420 INFO L273 TraceCheckUtils]: 62: Hoare triple {15007#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15007#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:07,421 INFO L273 TraceCheckUtils]: 63: Hoare triple {15007#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15007#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:07,421 INFO L273 TraceCheckUtils]: 64: Hoare triple {15007#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15008#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:07,422 INFO L273 TraceCheckUtils]: 65: Hoare triple {15008#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15008#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:07,422 INFO L273 TraceCheckUtils]: 66: Hoare triple {15008#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15008#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:07,423 INFO L273 TraceCheckUtils]: 67: Hoare triple {15008#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15009#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:07,424 INFO L273 TraceCheckUtils]: 68: Hoare triple {15009#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15009#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:07,424 INFO L273 TraceCheckUtils]: 69: Hoare triple {15009#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15009#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:07,425 INFO L273 TraceCheckUtils]: 70: Hoare triple {15009#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15010#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:07,425 INFO L273 TraceCheckUtils]: 71: Hoare triple {15010#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15010#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:07,426 INFO L273 TraceCheckUtils]: 72: Hoare triple {15010#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15010#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:07,427 INFO L273 TraceCheckUtils]: 73: Hoare triple {15010#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15011#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:07,427 INFO L273 TraceCheckUtils]: 74: Hoare triple {15011#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15011#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:07,428 INFO L273 TraceCheckUtils]: 75: Hoare triple {15011#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15011#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:07,428 INFO L273 TraceCheckUtils]: 76: Hoare triple {15011#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15012#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:07,429 INFO L273 TraceCheckUtils]: 77: Hoare triple {15012#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15012#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:07,429 INFO L273 TraceCheckUtils]: 78: Hoare triple {15012#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15012#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:07,430 INFO L273 TraceCheckUtils]: 79: Hoare triple {15012#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15013#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:07,431 INFO L273 TraceCheckUtils]: 80: Hoare triple {15013#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15013#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:07,431 INFO L273 TraceCheckUtils]: 81: Hoare triple {15013#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15013#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:07,432 INFO L273 TraceCheckUtils]: 82: Hoare triple {15013#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15014#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:07,433 INFO L273 TraceCheckUtils]: 83: Hoare triple {15014#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15014#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:07,433 INFO L273 TraceCheckUtils]: 84: Hoare triple {15014#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15014#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:07,434 INFO L273 TraceCheckUtils]: 85: Hoare triple {15014#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15015#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:07,434 INFO L273 TraceCheckUtils]: 86: Hoare triple {15015#(<= main_~i~0 28)} assume !(~i~0 < 100000); {14988#false} is VALID [2018-11-23 11:59:07,435 INFO L273 TraceCheckUtils]: 87: Hoare triple {14988#false} havoc ~x~0;~x~0 := 0; {14988#false} is VALID [2018-11-23 11:59:07,435 INFO L273 TraceCheckUtils]: 88: Hoare triple {14988#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {14988#false} is VALID [2018-11-23 11:59:07,435 INFO L256 TraceCheckUtils]: 89: Hoare triple {14988#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {14988#false} is VALID [2018-11-23 11:59:07,435 INFO L273 TraceCheckUtils]: 90: Hoare triple {14988#false} ~cond := #in~cond; {14988#false} is VALID [2018-11-23 11:59:07,435 INFO L273 TraceCheckUtils]: 91: Hoare triple {14988#false} assume 0 == ~cond; {14988#false} is VALID [2018-11-23 11:59:07,436 INFO L273 TraceCheckUtils]: 92: Hoare triple {14988#false} assume !false; {14988#false} is VALID [2018-11-23 11:59:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:07,442 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:07,442 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-23 11:59:07,451 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:07,503 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:07,503 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:07,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:07,728 INFO L256 TraceCheckUtils]: 0: Hoare triple {14987#true} call ULTIMATE.init(); {14987#true} is VALID [2018-11-23 11:59:07,729 INFO L273 TraceCheckUtils]: 1: Hoare triple {14987#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {14987#true} is VALID [2018-11-23 11:59:07,729 INFO L273 TraceCheckUtils]: 2: Hoare triple {14987#true} assume true; {14987#true} is VALID [2018-11-23 11:59:07,729 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {14987#true} {14987#true} #88#return; {14987#true} is VALID [2018-11-23 11:59:07,729 INFO L256 TraceCheckUtils]: 4: Hoare triple {14987#true} call #t~ret13 := main(); {14987#true} is VALID [2018-11-23 11:59:07,729 INFO L273 TraceCheckUtils]: 5: Hoare triple {14987#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {14987#true} is VALID [2018-11-23 11:59:07,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {14987#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {14987#true} is VALID [2018-11-23 11:59:07,730 INFO L273 TraceCheckUtils]: 7: Hoare triple {14987#true} ~i~0 := 2; {14989#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,731 INFO L273 TraceCheckUtils]: 8: Hoare triple {14989#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14989#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,731 INFO L273 TraceCheckUtils]: 9: Hoare triple {14989#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14989#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:07,731 INFO L273 TraceCheckUtils]: 10: Hoare triple {14989#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14990#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {14990#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14990#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,732 INFO L273 TraceCheckUtils]: 12: Hoare triple {14990#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14990#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:07,732 INFO L273 TraceCheckUtils]: 13: Hoare triple {14990#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14991#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,733 INFO L273 TraceCheckUtils]: 14: Hoare triple {14991#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14991#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,734 INFO L273 TraceCheckUtils]: 15: Hoare triple {14991#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14991#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:07,734 INFO L273 TraceCheckUtils]: 16: Hoare triple {14991#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14992#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,735 INFO L273 TraceCheckUtils]: 17: Hoare triple {14992#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14992#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,735 INFO L273 TraceCheckUtils]: 18: Hoare triple {14992#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14992#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:07,736 INFO L273 TraceCheckUtils]: 19: Hoare triple {14992#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14993#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,737 INFO L273 TraceCheckUtils]: 20: Hoare triple {14993#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14993#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,737 INFO L273 TraceCheckUtils]: 21: Hoare triple {14993#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14993#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:07,738 INFO L273 TraceCheckUtils]: 22: Hoare triple {14993#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14994#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,738 INFO L273 TraceCheckUtils]: 23: Hoare triple {14994#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14994#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,739 INFO L273 TraceCheckUtils]: 24: Hoare triple {14994#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14994#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:07,740 INFO L273 TraceCheckUtils]: 25: Hoare triple {14994#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14995#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,740 INFO L273 TraceCheckUtils]: 26: Hoare triple {14995#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14995#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,741 INFO L273 TraceCheckUtils]: 27: Hoare triple {14995#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14995#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:07,741 INFO L273 TraceCheckUtils]: 28: Hoare triple {14995#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14996#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,742 INFO L273 TraceCheckUtils]: 29: Hoare triple {14996#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14996#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,742 INFO L273 TraceCheckUtils]: 30: Hoare triple {14996#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14996#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:07,743 INFO L273 TraceCheckUtils]: 31: Hoare triple {14996#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14997#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,744 INFO L273 TraceCheckUtils]: 32: Hoare triple {14997#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14997#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,744 INFO L273 TraceCheckUtils]: 33: Hoare triple {14997#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14997#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:07,745 INFO L273 TraceCheckUtils]: 34: Hoare triple {14997#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14998#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,745 INFO L273 TraceCheckUtils]: 35: Hoare triple {14998#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14998#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,746 INFO L273 TraceCheckUtils]: 36: Hoare triple {14998#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14998#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:07,747 INFO L273 TraceCheckUtils]: 37: Hoare triple {14998#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {14999#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,747 INFO L273 TraceCheckUtils]: 38: Hoare triple {14999#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {14999#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,748 INFO L273 TraceCheckUtils]: 39: Hoare triple {14999#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {14999#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:07,749 INFO L273 TraceCheckUtils]: 40: Hoare triple {14999#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15000#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,749 INFO L273 TraceCheckUtils]: 41: Hoare triple {15000#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15000#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,750 INFO L273 TraceCheckUtils]: 42: Hoare triple {15000#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15000#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:07,750 INFO L273 TraceCheckUtils]: 43: Hoare triple {15000#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15001#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,751 INFO L273 TraceCheckUtils]: 44: Hoare triple {15001#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15001#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,751 INFO L273 TraceCheckUtils]: 45: Hoare triple {15001#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15001#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:07,752 INFO L273 TraceCheckUtils]: 46: Hoare triple {15001#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15002#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,753 INFO L273 TraceCheckUtils]: 47: Hoare triple {15002#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15002#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,753 INFO L273 TraceCheckUtils]: 48: Hoare triple {15002#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15002#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:07,754 INFO L273 TraceCheckUtils]: 49: Hoare triple {15002#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15003#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,754 INFO L273 TraceCheckUtils]: 50: Hoare triple {15003#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15003#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,755 INFO L273 TraceCheckUtils]: 51: Hoare triple {15003#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15003#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:07,756 INFO L273 TraceCheckUtils]: 52: Hoare triple {15003#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15004#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,756 INFO L273 TraceCheckUtils]: 53: Hoare triple {15004#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15004#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,757 INFO L273 TraceCheckUtils]: 54: Hoare triple {15004#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15004#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:07,758 INFO L273 TraceCheckUtils]: 55: Hoare triple {15004#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15005#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:07,758 INFO L273 TraceCheckUtils]: 56: Hoare triple {15005#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15005#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:07,759 INFO L273 TraceCheckUtils]: 57: Hoare triple {15005#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15005#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:07,759 INFO L273 TraceCheckUtils]: 58: Hoare triple {15005#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15006#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:07,760 INFO L273 TraceCheckUtils]: 59: Hoare triple {15006#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15006#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:07,760 INFO L273 TraceCheckUtils]: 60: Hoare triple {15006#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15006#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:07,761 INFO L273 TraceCheckUtils]: 61: Hoare triple {15006#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15007#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:07,762 INFO L273 TraceCheckUtils]: 62: Hoare triple {15007#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15007#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:07,762 INFO L273 TraceCheckUtils]: 63: Hoare triple {15007#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15007#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:07,763 INFO L273 TraceCheckUtils]: 64: Hoare triple {15007#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15008#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:07,763 INFO L273 TraceCheckUtils]: 65: Hoare triple {15008#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15008#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:07,764 INFO L273 TraceCheckUtils]: 66: Hoare triple {15008#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15008#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:07,765 INFO L273 TraceCheckUtils]: 67: Hoare triple {15008#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15009#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:07,765 INFO L273 TraceCheckUtils]: 68: Hoare triple {15009#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15009#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:07,766 INFO L273 TraceCheckUtils]: 69: Hoare triple {15009#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15009#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:07,766 INFO L273 TraceCheckUtils]: 70: Hoare triple {15009#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15010#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:07,767 INFO L273 TraceCheckUtils]: 71: Hoare triple {15010#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15010#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:07,767 INFO L273 TraceCheckUtils]: 72: Hoare triple {15010#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15010#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:07,768 INFO L273 TraceCheckUtils]: 73: Hoare triple {15010#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15011#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:07,769 INFO L273 TraceCheckUtils]: 74: Hoare triple {15011#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15011#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:07,769 INFO L273 TraceCheckUtils]: 75: Hoare triple {15011#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15011#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:07,770 INFO L273 TraceCheckUtils]: 76: Hoare triple {15011#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15012#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:07,771 INFO L273 TraceCheckUtils]: 77: Hoare triple {15012#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15012#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:07,771 INFO L273 TraceCheckUtils]: 78: Hoare triple {15012#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15012#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:07,772 INFO L273 TraceCheckUtils]: 79: Hoare triple {15012#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15013#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:07,772 INFO L273 TraceCheckUtils]: 80: Hoare triple {15013#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15013#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:07,773 INFO L273 TraceCheckUtils]: 81: Hoare triple {15013#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15013#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:07,774 INFO L273 TraceCheckUtils]: 82: Hoare triple {15013#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15014#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:07,774 INFO L273 TraceCheckUtils]: 83: Hoare triple {15014#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15014#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:07,775 INFO L273 TraceCheckUtils]: 84: Hoare triple {15014#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15014#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:07,775 INFO L273 TraceCheckUtils]: 85: Hoare triple {15014#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15015#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:07,776 INFO L273 TraceCheckUtils]: 86: Hoare triple {15015#(<= main_~i~0 28)} assume !(~i~0 < 100000); {14988#false} is VALID [2018-11-23 11:59:07,776 INFO L273 TraceCheckUtils]: 87: Hoare triple {14988#false} havoc ~x~0;~x~0 := 0; {14988#false} is VALID [2018-11-23 11:59:07,776 INFO L273 TraceCheckUtils]: 88: Hoare triple {14988#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {14988#false} is VALID [2018-11-23 11:59:07,777 INFO L256 TraceCheckUtils]: 89: Hoare triple {14988#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {14988#false} is VALID [2018-11-23 11:59:07,777 INFO L273 TraceCheckUtils]: 90: Hoare triple {14988#false} ~cond := #in~cond; {14988#false} is VALID [2018-11-23 11:59:07,777 INFO L273 TraceCheckUtils]: 91: Hoare triple {14988#false} assume 0 == ~cond; {14988#false} is VALID [2018-11-23 11:59:07,777 INFO L273 TraceCheckUtils]: 92: Hoare triple {14988#false} assume !false; {14988#false} is VALID [2018-11-23 11:59:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:07,802 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:07,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 29 [2018-11-23 11:59:07,803 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 93 [2018-11-23 11:59:07,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:07,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states. [2018-11-23 11:59:07,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:07,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-11-23 11:59:07,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-11-23 11:59:07,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:59:07,910 INFO L87 Difference]: Start difference. First operand 130 states and 187 transitions. Second operand 29 states. [2018-11-23 11:59:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:08,992 INFO L93 Difference]: Finished difference Result 154 states and 219 transitions. [2018-11-23 11:59:08,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-11-23 11:59:08,992 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 93 [2018-11-23 11:59:08,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:08,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:59:08,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 219 transitions. [2018-11-23 11:59:08,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 11:59:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 219 transitions. [2018-11-23 11:59:08,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 29 states and 219 transitions. [2018-11-23 11:59:09,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 219 edges. 219 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:09,211 INFO L225 Difference]: With dead ends: 154 [2018-11-23 11:59:09,212 INFO L226 Difference]: Without dead ends: 137 [2018-11-23 11:59:09,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-11-23 11:59:09,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-11-23 11:59:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-11-23 11:59:09,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:09,247 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand 134 states. [2018-11-23 11:59:09,247 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 134 states. [2018-11-23 11:59:09,247 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 134 states. [2018-11-23 11:59:09,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:09,249 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2018-11-23 11:59:09,250 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 198 transitions. [2018-11-23 11:59:09,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:09,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:09,250 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand 137 states. [2018-11-23 11:59:09,251 INFO L87 Difference]: Start difference. First operand 134 states. Second operand 137 states. [2018-11-23 11:59:09,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:09,253 INFO L93 Difference]: Finished difference Result 137 states and 198 transitions. [2018-11-23 11:59:09,253 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 198 transitions. [2018-11-23 11:59:09,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:09,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:09,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:09,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-11-23 11:59:09,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 193 transitions. [2018-11-23 11:59:09,257 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 193 transitions. Word has length 93 [2018-11-23 11:59:09,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:09,257 INFO L480 AbstractCegarLoop]: Abstraction has 134 states and 193 transitions. [2018-11-23 11:59:09,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-11-23 11:59:09,257 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 193 transitions. [2018-11-23 11:59:09,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-11-23 11:59:09,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:09,258 INFO L402 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:09,258 INFO L423 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:09,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:09,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1445825951, now seen corresponding path program 27 times [2018-11-23 11:59:09,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:09,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:09,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:09,260 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:09,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:09,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,746 INFO L256 TraceCheckUtils]: 0: Hoare triple {15935#true} call ULTIMATE.init(); {15935#true} is VALID [2018-11-23 11:59:09,747 INFO L273 TraceCheckUtils]: 1: Hoare triple {15935#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15935#true} is VALID [2018-11-23 11:59:09,747 INFO L273 TraceCheckUtils]: 2: Hoare triple {15935#true} assume true; {15935#true} is VALID [2018-11-23 11:59:09,747 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15935#true} {15935#true} #88#return; {15935#true} is VALID [2018-11-23 11:59:09,747 INFO L256 TraceCheckUtils]: 4: Hoare triple {15935#true} call #t~ret13 := main(); {15935#true} is VALID [2018-11-23 11:59:09,747 INFO L273 TraceCheckUtils]: 5: Hoare triple {15935#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {15935#true} is VALID [2018-11-23 11:59:09,748 INFO L273 TraceCheckUtils]: 6: Hoare triple {15935#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {15935#true} is VALID [2018-11-23 11:59:09,748 INFO L273 TraceCheckUtils]: 7: Hoare triple {15935#true} ~i~0 := 2; {15937#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,749 INFO L273 TraceCheckUtils]: 8: Hoare triple {15937#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15937#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,749 INFO L273 TraceCheckUtils]: 9: Hoare triple {15937#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15937#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:09,750 INFO L273 TraceCheckUtils]: 10: Hoare triple {15937#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15938#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,750 INFO L273 TraceCheckUtils]: 11: Hoare triple {15938#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15938#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,750 INFO L273 TraceCheckUtils]: 12: Hoare triple {15938#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15938#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:09,751 INFO L273 TraceCheckUtils]: 13: Hoare triple {15938#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15939#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:09,751 INFO L273 TraceCheckUtils]: 14: Hoare triple {15939#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15939#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:09,755 INFO L273 TraceCheckUtils]: 15: Hoare triple {15939#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15939#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:09,755 INFO L273 TraceCheckUtils]: 16: Hoare triple {15939#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15940#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:09,756 INFO L273 TraceCheckUtils]: 17: Hoare triple {15940#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15940#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:09,756 INFO L273 TraceCheckUtils]: 18: Hoare triple {15940#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15940#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:09,756 INFO L273 TraceCheckUtils]: 19: Hoare triple {15940#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15941#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:09,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {15941#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15941#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:09,757 INFO L273 TraceCheckUtils]: 21: Hoare triple {15941#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15941#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:09,757 INFO L273 TraceCheckUtils]: 22: Hoare triple {15941#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15942#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:09,758 INFO L273 TraceCheckUtils]: 23: Hoare triple {15942#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15942#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:09,758 INFO L273 TraceCheckUtils]: 24: Hoare triple {15942#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15942#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:09,758 INFO L273 TraceCheckUtils]: 25: Hoare triple {15942#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15943#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:09,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {15943#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15943#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:09,759 INFO L273 TraceCheckUtils]: 27: Hoare triple {15943#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15943#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:09,760 INFO L273 TraceCheckUtils]: 28: Hoare triple {15943#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15944#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:09,760 INFO L273 TraceCheckUtils]: 29: Hoare triple {15944#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15944#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:09,761 INFO L273 TraceCheckUtils]: 30: Hoare triple {15944#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15944#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:09,762 INFO L273 TraceCheckUtils]: 31: Hoare triple {15944#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15945#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:09,762 INFO L273 TraceCheckUtils]: 32: Hoare triple {15945#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15945#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:09,763 INFO L273 TraceCheckUtils]: 33: Hoare triple {15945#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15945#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:09,763 INFO L273 TraceCheckUtils]: 34: Hoare triple {15945#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15946#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:09,764 INFO L273 TraceCheckUtils]: 35: Hoare triple {15946#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15946#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:09,764 INFO L273 TraceCheckUtils]: 36: Hoare triple {15946#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15946#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:09,765 INFO L273 TraceCheckUtils]: 37: Hoare triple {15946#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15947#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:09,766 INFO L273 TraceCheckUtils]: 38: Hoare triple {15947#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15947#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:09,766 INFO L273 TraceCheckUtils]: 39: Hoare triple {15947#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15947#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:09,767 INFO L273 TraceCheckUtils]: 40: Hoare triple {15947#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15948#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:09,767 INFO L273 TraceCheckUtils]: 41: Hoare triple {15948#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15948#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:09,768 INFO L273 TraceCheckUtils]: 42: Hoare triple {15948#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15948#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:09,769 INFO L273 TraceCheckUtils]: 43: Hoare triple {15948#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15949#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:09,769 INFO L273 TraceCheckUtils]: 44: Hoare triple {15949#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15949#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:09,770 INFO L273 TraceCheckUtils]: 45: Hoare triple {15949#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15949#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:09,770 INFO L273 TraceCheckUtils]: 46: Hoare triple {15949#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15950#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:09,771 INFO L273 TraceCheckUtils]: 47: Hoare triple {15950#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15950#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:09,771 INFO L273 TraceCheckUtils]: 48: Hoare triple {15950#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15950#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:09,772 INFO L273 TraceCheckUtils]: 49: Hoare triple {15950#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15951#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:09,773 INFO L273 TraceCheckUtils]: 50: Hoare triple {15951#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15951#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:09,773 INFO L273 TraceCheckUtils]: 51: Hoare triple {15951#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15951#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:09,774 INFO L273 TraceCheckUtils]: 52: Hoare triple {15951#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15952#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:09,774 INFO L273 TraceCheckUtils]: 53: Hoare triple {15952#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15952#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:09,775 INFO L273 TraceCheckUtils]: 54: Hoare triple {15952#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15952#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:09,776 INFO L273 TraceCheckUtils]: 55: Hoare triple {15952#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15953#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:09,776 INFO L273 TraceCheckUtils]: 56: Hoare triple {15953#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15953#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:09,777 INFO L273 TraceCheckUtils]: 57: Hoare triple {15953#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15953#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:09,778 INFO L273 TraceCheckUtils]: 58: Hoare triple {15953#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15954#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:09,778 INFO L273 TraceCheckUtils]: 59: Hoare triple {15954#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15954#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:09,779 INFO L273 TraceCheckUtils]: 60: Hoare triple {15954#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15954#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:09,779 INFO L273 TraceCheckUtils]: 61: Hoare triple {15954#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15955#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:09,780 INFO L273 TraceCheckUtils]: 62: Hoare triple {15955#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15955#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:09,780 INFO L273 TraceCheckUtils]: 63: Hoare triple {15955#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15955#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:09,781 INFO L273 TraceCheckUtils]: 64: Hoare triple {15955#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15956#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:09,782 INFO L273 TraceCheckUtils]: 65: Hoare triple {15956#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15956#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:09,782 INFO L273 TraceCheckUtils]: 66: Hoare triple {15956#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15956#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:09,783 INFO L273 TraceCheckUtils]: 67: Hoare triple {15956#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15957#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:09,783 INFO L273 TraceCheckUtils]: 68: Hoare triple {15957#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15957#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:09,784 INFO L273 TraceCheckUtils]: 69: Hoare triple {15957#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15957#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:09,785 INFO L273 TraceCheckUtils]: 70: Hoare triple {15957#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15958#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:09,785 INFO L273 TraceCheckUtils]: 71: Hoare triple {15958#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15958#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:09,786 INFO L273 TraceCheckUtils]: 72: Hoare triple {15958#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15958#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:09,786 INFO L273 TraceCheckUtils]: 73: Hoare triple {15958#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15959#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:09,787 INFO L273 TraceCheckUtils]: 74: Hoare triple {15959#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15959#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:09,787 INFO L273 TraceCheckUtils]: 75: Hoare triple {15959#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15959#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:09,788 INFO L273 TraceCheckUtils]: 76: Hoare triple {15959#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15960#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:09,789 INFO L273 TraceCheckUtils]: 77: Hoare triple {15960#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15960#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:09,789 INFO L273 TraceCheckUtils]: 78: Hoare triple {15960#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15960#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:09,790 INFO L273 TraceCheckUtils]: 79: Hoare triple {15960#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15961#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:09,791 INFO L273 TraceCheckUtils]: 80: Hoare triple {15961#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15961#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:09,791 INFO L273 TraceCheckUtils]: 81: Hoare triple {15961#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15961#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:09,792 INFO L273 TraceCheckUtils]: 82: Hoare triple {15961#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15962#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:09,792 INFO L273 TraceCheckUtils]: 83: Hoare triple {15962#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15962#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:09,793 INFO L273 TraceCheckUtils]: 84: Hoare triple {15962#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15962#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:09,794 INFO L273 TraceCheckUtils]: 85: Hoare triple {15962#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15963#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:09,794 INFO L273 TraceCheckUtils]: 86: Hoare triple {15963#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15963#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:09,795 INFO L273 TraceCheckUtils]: 87: Hoare triple {15963#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15963#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:09,795 INFO L273 TraceCheckUtils]: 88: Hoare triple {15963#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15964#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:09,796 INFO L273 TraceCheckUtils]: 89: Hoare triple {15964#(<= main_~i~0 29)} assume !(~i~0 < 100000); {15936#false} is VALID [2018-11-23 11:59:09,796 INFO L273 TraceCheckUtils]: 90: Hoare triple {15936#false} havoc ~x~0;~x~0 := 0; {15936#false} is VALID [2018-11-23 11:59:09,796 INFO L273 TraceCheckUtils]: 91: Hoare triple {15936#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {15936#false} is VALID [2018-11-23 11:59:09,797 INFO L256 TraceCheckUtils]: 92: Hoare triple {15936#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {15936#false} is VALID [2018-11-23 11:59:09,797 INFO L273 TraceCheckUtils]: 93: Hoare triple {15936#false} ~cond := #in~cond; {15936#false} is VALID [2018-11-23 11:59:09,797 INFO L273 TraceCheckUtils]: 94: Hoare triple {15936#false} assume 0 == ~cond; {15936#false} is VALID [2018-11-23 11:59:09,797 INFO L273 TraceCheckUtils]: 95: Hoare triple {15936#false} assume !false; {15936#false} is VALID [2018-11-23 11:59:09,804 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:09,804 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:09,804 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-23 11:59:09,813 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:09,889 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 28 check-sat command(s) [2018-11-23 11:59:09,889 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:09,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:09,917 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:10,175 INFO L256 TraceCheckUtils]: 0: Hoare triple {15935#true} call ULTIMATE.init(); {15935#true} is VALID [2018-11-23 11:59:10,175 INFO L273 TraceCheckUtils]: 1: Hoare triple {15935#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {15935#true} is VALID [2018-11-23 11:59:10,176 INFO L273 TraceCheckUtils]: 2: Hoare triple {15935#true} assume true; {15935#true} is VALID [2018-11-23 11:59:10,176 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {15935#true} {15935#true} #88#return; {15935#true} is VALID [2018-11-23 11:59:10,176 INFO L256 TraceCheckUtils]: 4: Hoare triple {15935#true} call #t~ret13 := main(); {15935#true} is VALID [2018-11-23 11:59:10,176 INFO L273 TraceCheckUtils]: 5: Hoare triple {15935#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {15935#true} is VALID [2018-11-23 11:59:10,177 INFO L273 TraceCheckUtils]: 6: Hoare triple {15935#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {15935#true} is VALID [2018-11-23 11:59:10,177 INFO L273 TraceCheckUtils]: 7: Hoare triple {15935#true} ~i~0 := 2; {15937#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:10,178 INFO L273 TraceCheckUtils]: 8: Hoare triple {15937#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15937#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:10,178 INFO L273 TraceCheckUtils]: 9: Hoare triple {15937#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15937#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:10,178 INFO L273 TraceCheckUtils]: 10: Hoare triple {15937#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15938#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:10,179 INFO L273 TraceCheckUtils]: 11: Hoare triple {15938#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15938#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:10,179 INFO L273 TraceCheckUtils]: 12: Hoare triple {15938#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15938#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:10,180 INFO L273 TraceCheckUtils]: 13: Hoare triple {15938#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15939#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:10,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {15939#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15939#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:10,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {15939#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15939#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:10,181 INFO L273 TraceCheckUtils]: 16: Hoare triple {15939#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15940#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:10,182 INFO L273 TraceCheckUtils]: 17: Hoare triple {15940#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15940#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:10,182 INFO L273 TraceCheckUtils]: 18: Hoare triple {15940#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15940#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:10,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {15940#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15941#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:10,184 INFO L273 TraceCheckUtils]: 20: Hoare triple {15941#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15941#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:10,184 INFO L273 TraceCheckUtils]: 21: Hoare triple {15941#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15941#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:10,185 INFO L273 TraceCheckUtils]: 22: Hoare triple {15941#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15942#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:10,186 INFO L273 TraceCheckUtils]: 23: Hoare triple {15942#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15942#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:10,186 INFO L273 TraceCheckUtils]: 24: Hoare triple {15942#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15942#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:10,187 INFO L273 TraceCheckUtils]: 25: Hoare triple {15942#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15943#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:10,188 INFO L273 TraceCheckUtils]: 26: Hoare triple {15943#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15943#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:10,188 INFO L273 TraceCheckUtils]: 27: Hoare triple {15943#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15943#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:10,189 INFO L273 TraceCheckUtils]: 28: Hoare triple {15943#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15944#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:10,190 INFO L273 TraceCheckUtils]: 29: Hoare triple {15944#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15944#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:10,190 INFO L273 TraceCheckUtils]: 30: Hoare triple {15944#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15944#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:10,191 INFO L273 TraceCheckUtils]: 31: Hoare triple {15944#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15945#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:10,192 INFO L273 TraceCheckUtils]: 32: Hoare triple {15945#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15945#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:10,193 INFO L273 TraceCheckUtils]: 33: Hoare triple {15945#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15945#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:10,193 INFO L273 TraceCheckUtils]: 34: Hoare triple {15945#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15946#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:10,194 INFO L273 TraceCheckUtils]: 35: Hoare triple {15946#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15946#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:10,195 INFO L273 TraceCheckUtils]: 36: Hoare triple {15946#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15946#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:10,195 INFO L273 TraceCheckUtils]: 37: Hoare triple {15946#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15947#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:10,196 INFO L273 TraceCheckUtils]: 38: Hoare triple {15947#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15947#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:10,197 INFO L273 TraceCheckUtils]: 39: Hoare triple {15947#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15947#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:10,198 INFO L273 TraceCheckUtils]: 40: Hoare triple {15947#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15948#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:10,198 INFO L273 TraceCheckUtils]: 41: Hoare triple {15948#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15948#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:10,199 INFO L273 TraceCheckUtils]: 42: Hoare triple {15948#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15948#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:10,200 INFO L273 TraceCheckUtils]: 43: Hoare triple {15948#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15949#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:10,200 INFO L273 TraceCheckUtils]: 44: Hoare triple {15949#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15949#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:10,201 INFO L273 TraceCheckUtils]: 45: Hoare triple {15949#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15949#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:10,202 INFO L273 TraceCheckUtils]: 46: Hoare triple {15949#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15950#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:10,202 INFO L273 TraceCheckUtils]: 47: Hoare triple {15950#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15950#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:10,203 INFO L273 TraceCheckUtils]: 48: Hoare triple {15950#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15950#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:10,204 INFO L273 TraceCheckUtils]: 49: Hoare triple {15950#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15951#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:10,204 INFO L273 TraceCheckUtils]: 50: Hoare triple {15951#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15951#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:10,205 INFO L273 TraceCheckUtils]: 51: Hoare triple {15951#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15951#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:10,206 INFO L273 TraceCheckUtils]: 52: Hoare triple {15951#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15952#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:10,206 INFO L273 TraceCheckUtils]: 53: Hoare triple {15952#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15952#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:10,207 INFO L273 TraceCheckUtils]: 54: Hoare triple {15952#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15952#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:10,208 INFO L273 TraceCheckUtils]: 55: Hoare triple {15952#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15953#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:10,210 INFO L273 TraceCheckUtils]: 56: Hoare triple {15953#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15953#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:10,210 INFO L273 TraceCheckUtils]: 57: Hoare triple {15953#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15953#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:10,211 INFO L273 TraceCheckUtils]: 58: Hoare triple {15953#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15954#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:10,211 INFO L273 TraceCheckUtils]: 59: Hoare triple {15954#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15954#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:10,212 INFO L273 TraceCheckUtils]: 60: Hoare triple {15954#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15954#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:10,212 INFO L273 TraceCheckUtils]: 61: Hoare triple {15954#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15955#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:10,213 INFO L273 TraceCheckUtils]: 62: Hoare triple {15955#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15955#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:10,213 INFO L273 TraceCheckUtils]: 63: Hoare triple {15955#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15955#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:10,214 INFO L273 TraceCheckUtils]: 64: Hoare triple {15955#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15956#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:10,214 INFO L273 TraceCheckUtils]: 65: Hoare triple {15956#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15956#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:10,215 INFO L273 TraceCheckUtils]: 66: Hoare triple {15956#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15956#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:10,215 INFO L273 TraceCheckUtils]: 67: Hoare triple {15956#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15957#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:10,216 INFO L273 TraceCheckUtils]: 68: Hoare triple {15957#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15957#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:10,217 INFO L273 TraceCheckUtils]: 69: Hoare triple {15957#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15957#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:10,217 INFO L273 TraceCheckUtils]: 70: Hoare triple {15957#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15958#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:10,218 INFO L273 TraceCheckUtils]: 71: Hoare triple {15958#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15958#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:10,219 INFO L273 TraceCheckUtils]: 72: Hoare triple {15958#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15958#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:10,220 INFO L273 TraceCheckUtils]: 73: Hoare triple {15958#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15959#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:10,220 INFO L273 TraceCheckUtils]: 74: Hoare triple {15959#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15959#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:10,221 INFO L273 TraceCheckUtils]: 75: Hoare triple {15959#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15959#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:10,222 INFO L273 TraceCheckUtils]: 76: Hoare triple {15959#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15960#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:10,222 INFO L273 TraceCheckUtils]: 77: Hoare triple {15960#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15960#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:10,223 INFO L273 TraceCheckUtils]: 78: Hoare triple {15960#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15960#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:10,224 INFO L273 TraceCheckUtils]: 79: Hoare triple {15960#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15961#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:10,224 INFO L273 TraceCheckUtils]: 80: Hoare triple {15961#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15961#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:10,225 INFO L273 TraceCheckUtils]: 81: Hoare triple {15961#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15961#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:10,226 INFO L273 TraceCheckUtils]: 82: Hoare triple {15961#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15962#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:10,226 INFO L273 TraceCheckUtils]: 83: Hoare triple {15962#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15962#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:10,227 INFO L273 TraceCheckUtils]: 84: Hoare triple {15962#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15962#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:10,228 INFO L273 TraceCheckUtils]: 85: Hoare triple {15962#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15963#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:10,228 INFO L273 TraceCheckUtils]: 86: Hoare triple {15963#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {15963#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:10,229 INFO L273 TraceCheckUtils]: 87: Hoare triple {15963#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {15963#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:10,230 INFO L273 TraceCheckUtils]: 88: Hoare triple {15963#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {15964#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:10,231 INFO L273 TraceCheckUtils]: 89: Hoare triple {15964#(<= main_~i~0 29)} assume !(~i~0 < 100000); {15936#false} is VALID [2018-11-23 11:59:10,231 INFO L273 TraceCheckUtils]: 90: Hoare triple {15936#false} havoc ~x~0;~x~0 := 0; {15936#false} is VALID [2018-11-23 11:59:10,231 INFO L273 TraceCheckUtils]: 91: Hoare triple {15936#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {15936#false} is VALID [2018-11-23 11:59:10,231 INFO L256 TraceCheckUtils]: 92: Hoare triple {15936#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {15936#false} is VALID [2018-11-23 11:59:10,232 INFO L273 TraceCheckUtils]: 93: Hoare triple {15936#false} ~cond := #in~cond; {15936#false} is VALID [2018-11-23 11:59:10,232 INFO L273 TraceCheckUtils]: 94: Hoare triple {15936#false} assume 0 == ~cond; {15936#false} is VALID [2018-11-23 11:59:10,232 INFO L273 TraceCheckUtils]: 95: Hoare triple {15936#false} assume !false; {15936#false} is VALID [2018-11-23 11:59:10,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:10,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:10,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 30 [2018-11-23 11:59:10,264 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 96 [2018-11-23 11:59:10,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:10,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2018-11-23 11:59:10,373 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-23 11:59:10,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-11-23 11:59:10,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-11-23 11:59:10,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:59:10,375 INFO L87 Difference]: Start difference. First operand 134 states and 193 transitions. Second operand 30 states. [2018-11-23 11:59:11,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,659 INFO L93 Difference]: Finished difference Result 158 states and 225 transitions. [2018-11-23 11:59:11,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-11-23 11:59:11,660 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 96 [2018-11-23 11:59:11,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:11,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:59:11,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 225 transitions. [2018-11-23 11:59:11,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 11:59:11,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 225 transitions. [2018-11-23 11:59:11,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states and 225 transitions. [2018-11-23 11:59:11,883 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:11,886 INFO L225 Difference]: With dead ends: 158 [2018-11-23 11:59:11,886 INFO L226 Difference]: Without dead ends: 141 [2018-11-23 11:59:11,887 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 11:59:11,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-11-23 11:59:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 138. [2018-11-23 11:59:11,917 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:11,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand 138 states. [2018-11-23 11:59:11,917 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand 138 states. [2018-11-23 11:59:11,917 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 138 states. [2018-11-23 11:59:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,920 INFO L93 Difference]: Finished difference Result 141 states and 204 transitions. [2018-11-23 11:59:11,920 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2018-11-23 11:59:11,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:11,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:11,921 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 141 states. [2018-11-23 11:59:11,921 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 141 states. [2018-11-23 11:59:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:11,924 INFO L93 Difference]: Finished difference Result 141 states and 204 transitions. [2018-11-23 11:59:11,924 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2018-11-23 11:59:11,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:11,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:11,925 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:11,925 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:11,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-11-23 11:59:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 199 transitions. [2018-11-23 11:59:11,927 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 199 transitions. Word has length 96 [2018-11-23 11:59:11,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:11,927 INFO L480 AbstractCegarLoop]: Abstraction has 138 states and 199 transitions. [2018-11-23 11:59:11,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-11-23 11:59:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 199 transitions. [2018-11-23 11:59:11,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 11:59:11,928 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:11,928 INFO L402 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:11,929 INFO L423 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:11,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:11,929 INFO L82 PathProgramCache]: Analyzing trace with hash -2019080036, now seen corresponding path program 28 times [2018-11-23 11:59:11,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:11,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:11,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:11,930 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:11,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,547 INFO L256 TraceCheckUtils]: 0: Hoare triple {16911#true} call ULTIMATE.init(); {16911#true} is VALID [2018-11-23 11:59:12,547 INFO L273 TraceCheckUtils]: 1: Hoare triple {16911#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16911#true} is VALID [2018-11-23 11:59:12,547 INFO L273 TraceCheckUtils]: 2: Hoare triple {16911#true} assume true; {16911#true} is VALID [2018-11-23 11:59:12,547 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16911#true} {16911#true} #88#return; {16911#true} is VALID [2018-11-23 11:59:12,548 INFO L256 TraceCheckUtils]: 4: Hoare triple {16911#true} call #t~ret13 := main(); {16911#true} is VALID [2018-11-23 11:59:12,548 INFO L273 TraceCheckUtils]: 5: Hoare triple {16911#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {16911#true} is VALID [2018-11-23 11:59:12,548 INFO L273 TraceCheckUtils]: 6: Hoare triple {16911#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {16911#true} is VALID [2018-11-23 11:59:12,549 INFO L273 TraceCheckUtils]: 7: Hoare triple {16911#true} ~i~0 := 2; {16913#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:12,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {16913#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16913#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:12,549 INFO L273 TraceCheckUtils]: 9: Hoare triple {16913#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16913#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:12,550 INFO L273 TraceCheckUtils]: 10: Hoare triple {16913#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16914#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:12,550 INFO L273 TraceCheckUtils]: 11: Hoare triple {16914#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16914#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:12,550 INFO L273 TraceCheckUtils]: 12: Hoare triple {16914#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16914#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:12,551 INFO L273 TraceCheckUtils]: 13: Hoare triple {16914#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16915#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:12,551 INFO L273 TraceCheckUtils]: 14: Hoare triple {16915#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16915#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:12,552 INFO L273 TraceCheckUtils]: 15: Hoare triple {16915#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16915#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:12,553 INFO L273 TraceCheckUtils]: 16: Hoare triple {16915#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16916#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:12,553 INFO L273 TraceCheckUtils]: 17: Hoare triple {16916#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16916#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:12,554 INFO L273 TraceCheckUtils]: 18: Hoare triple {16916#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16916#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:12,555 INFO L273 TraceCheckUtils]: 19: Hoare triple {16916#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16917#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:12,555 INFO L273 TraceCheckUtils]: 20: Hoare triple {16917#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16917#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:12,556 INFO L273 TraceCheckUtils]: 21: Hoare triple {16917#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16917#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:12,556 INFO L273 TraceCheckUtils]: 22: Hoare triple {16917#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16918#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:12,557 INFO L273 TraceCheckUtils]: 23: Hoare triple {16918#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16918#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:12,557 INFO L273 TraceCheckUtils]: 24: Hoare triple {16918#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16918#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:12,558 INFO L273 TraceCheckUtils]: 25: Hoare triple {16918#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16919#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:12,559 INFO L273 TraceCheckUtils]: 26: Hoare triple {16919#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16919#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:12,559 INFO L273 TraceCheckUtils]: 27: Hoare triple {16919#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16919#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:12,560 INFO L273 TraceCheckUtils]: 28: Hoare triple {16919#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16920#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:12,560 INFO L273 TraceCheckUtils]: 29: Hoare triple {16920#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16920#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:12,561 INFO L273 TraceCheckUtils]: 30: Hoare triple {16920#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16920#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:12,562 INFO L273 TraceCheckUtils]: 31: Hoare triple {16920#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16921#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:12,562 INFO L273 TraceCheckUtils]: 32: Hoare triple {16921#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16921#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:12,563 INFO L273 TraceCheckUtils]: 33: Hoare triple {16921#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16921#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:12,563 INFO L273 TraceCheckUtils]: 34: Hoare triple {16921#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16922#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:12,564 INFO L273 TraceCheckUtils]: 35: Hoare triple {16922#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16922#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:12,564 INFO L273 TraceCheckUtils]: 36: Hoare triple {16922#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16922#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:12,565 INFO L273 TraceCheckUtils]: 37: Hoare triple {16922#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16923#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:12,566 INFO L273 TraceCheckUtils]: 38: Hoare triple {16923#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16923#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:12,566 INFO L273 TraceCheckUtils]: 39: Hoare triple {16923#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16923#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:12,567 INFO L273 TraceCheckUtils]: 40: Hoare triple {16923#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16924#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:12,568 INFO L273 TraceCheckUtils]: 41: Hoare triple {16924#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16924#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:12,568 INFO L273 TraceCheckUtils]: 42: Hoare triple {16924#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16924#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:12,569 INFO L273 TraceCheckUtils]: 43: Hoare triple {16924#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16925#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:12,569 INFO L273 TraceCheckUtils]: 44: Hoare triple {16925#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16925#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:12,570 INFO L273 TraceCheckUtils]: 45: Hoare triple {16925#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16925#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:12,571 INFO L273 TraceCheckUtils]: 46: Hoare triple {16925#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16926#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:12,571 INFO L273 TraceCheckUtils]: 47: Hoare triple {16926#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16926#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:12,572 INFO L273 TraceCheckUtils]: 48: Hoare triple {16926#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16926#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:12,572 INFO L273 TraceCheckUtils]: 49: Hoare triple {16926#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16927#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:12,573 INFO L273 TraceCheckUtils]: 50: Hoare triple {16927#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16927#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:12,573 INFO L273 TraceCheckUtils]: 51: Hoare triple {16927#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16927#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:12,574 INFO L273 TraceCheckUtils]: 52: Hoare triple {16927#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16928#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:12,575 INFO L273 TraceCheckUtils]: 53: Hoare triple {16928#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16928#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:12,575 INFO L273 TraceCheckUtils]: 54: Hoare triple {16928#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16928#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:12,576 INFO L273 TraceCheckUtils]: 55: Hoare triple {16928#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16929#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:12,576 INFO L273 TraceCheckUtils]: 56: Hoare triple {16929#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16929#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:12,577 INFO L273 TraceCheckUtils]: 57: Hoare triple {16929#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16929#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:12,578 INFO L273 TraceCheckUtils]: 58: Hoare triple {16929#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16930#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:12,578 INFO L273 TraceCheckUtils]: 59: Hoare triple {16930#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16930#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:12,579 INFO L273 TraceCheckUtils]: 60: Hoare triple {16930#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16930#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:12,579 INFO L273 TraceCheckUtils]: 61: Hoare triple {16930#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16931#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:12,580 INFO L273 TraceCheckUtils]: 62: Hoare triple {16931#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16931#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:12,580 INFO L273 TraceCheckUtils]: 63: Hoare triple {16931#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16931#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:12,581 INFO L273 TraceCheckUtils]: 64: Hoare triple {16931#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16932#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:12,582 INFO L273 TraceCheckUtils]: 65: Hoare triple {16932#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16932#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:12,582 INFO L273 TraceCheckUtils]: 66: Hoare triple {16932#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16932#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:12,583 INFO L273 TraceCheckUtils]: 67: Hoare triple {16932#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16933#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:12,584 INFO L273 TraceCheckUtils]: 68: Hoare triple {16933#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16933#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:12,584 INFO L273 TraceCheckUtils]: 69: Hoare triple {16933#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16933#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:12,585 INFO L273 TraceCheckUtils]: 70: Hoare triple {16933#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16934#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:12,585 INFO L273 TraceCheckUtils]: 71: Hoare triple {16934#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16934#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:12,586 INFO L273 TraceCheckUtils]: 72: Hoare triple {16934#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16934#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:12,587 INFO L273 TraceCheckUtils]: 73: Hoare triple {16934#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16935#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:12,587 INFO L273 TraceCheckUtils]: 74: Hoare triple {16935#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16935#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:12,588 INFO L273 TraceCheckUtils]: 75: Hoare triple {16935#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16935#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:12,588 INFO L273 TraceCheckUtils]: 76: Hoare triple {16935#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16936#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:12,589 INFO L273 TraceCheckUtils]: 77: Hoare triple {16936#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16936#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:12,589 INFO L273 TraceCheckUtils]: 78: Hoare triple {16936#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16936#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:12,590 INFO L273 TraceCheckUtils]: 79: Hoare triple {16936#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16937#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:12,591 INFO L273 TraceCheckUtils]: 80: Hoare triple {16937#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16937#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:12,591 INFO L273 TraceCheckUtils]: 81: Hoare triple {16937#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16937#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:12,592 INFO L273 TraceCheckUtils]: 82: Hoare triple {16937#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16938#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:12,592 INFO L273 TraceCheckUtils]: 83: Hoare triple {16938#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16938#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:12,593 INFO L273 TraceCheckUtils]: 84: Hoare triple {16938#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16938#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:12,594 INFO L273 TraceCheckUtils]: 85: Hoare triple {16938#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16939#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:12,594 INFO L273 TraceCheckUtils]: 86: Hoare triple {16939#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16939#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:12,595 INFO L273 TraceCheckUtils]: 87: Hoare triple {16939#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16939#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:12,595 INFO L273 TraceCheckUtils]: 88: Hoare triple {16939#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16940#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:12,596 INFO L273 TraceCheckUtils]: 89: Hoare triple {16940#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16940#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:12,596 INFO L273 TraceCheckUtils]: 90: Hoare triple {16940#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16940#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:12,597 INFO L273 TraceCheckUtils]: 91: Hoare triple {16940#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16941#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:12,598 INFO L273 TraceCheckUtils]: 92: Hoare triple {16941#(<= main_~i~0 30)} assume !(~i~0 < 100000); {16912#false} is VALID [2018-11-23 11:59:12,598 INFO L273 TraceCheckUtils]: 93: Hoare triple {16912#false} havoc ~x~0;~x~0 := 0; {16912#false} is VALID [2018-11-23 11:59:12,598 INFO L273 TraceCheckUtils]: 94: Hoare triple {16912#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {16912#false} is VALID [2018-11-23 11:59:12,599 INFO L256 TraceCheckUtils]: 95: Hoare triple {16912#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {16912#false} is VALID [2018-11-23 11:59:12,599 INFO L273 TraceCheckUtils]: 96: Hoare triple {16912#false} ~cond := #in~cond; {16912#false} is VALID [2018-11-23 11:59:12,599 INFO L273 TraceCheckUtils]: 97: Hoare triple {16912#false} assume 0 == ~cond; {16912#false} is VALID [2018-11-23 11:59:12,599 INFO L273 TraceCheckUtils]: 98: Hoare triple {16912#false} assume !false; {16912#false} is VALID [2018-11-23 11:59:12,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:12,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:12,606 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-23 11:59:12,615 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:12,669 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:12,669 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:12,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:12,703 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:13,126 INFO L256 TraceCheckUtils]: 0: Hoare triple {16911#true} call ULTIMATE.init(); {16911#true} is VALID [2018-11-23 11:59:13,126 INFO L273 TraceCheckUtils]: 1: Hoare triple {16911#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {16911#true} is VALID [2018-11-23 11:59:13,126 INFO L273 TraceCheckUtils]: 2: Hoare triple {16911#true} assume true; {16911#true} is VALID [2018-11-23 11:59:13,126 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {16911#true} {16911#true} #88#return; {16911#true} is VALID [2018-11-23 11:59:13,127 INFO L256 TraceCheckUtils]: 4: Hoare triple {16911#true} call #t~ret13 := main(); {16911#true} is VALID [2018-11-23 11:59:13,127 INFO L273 TraceCheckUtils]: 5: Hoare triple {16911#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {16911#true} is VALID [2018-11-23 11:59:13,127 INFO L273 TraceCheckUtils]: 6: Hoare triple {16911#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {16911#true} is VALID [2018-11-23 11:59:13,128 INFO L273 TraceCheckUtils]: 7: Hoare triple {16911#true} ~i~0 := 2; {16913#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:13,128 INFO L273 TraceCheckUtils]: 8: Hoare triple {16913#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16913#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:13,130 INFO L273 TraceCheckUtils]: 9: Hoare triple {16913#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16913#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:13,130 INFO L273 TraceCheckUtils]: 10: Hoare triple {16913#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16914#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:13,132 INFO L273 TraceCheckUtils]: 11: Hoare triple {16914#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16914#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:13,134 INFO L273 TraceCheckUtils]: 12: Hoare triple {16914#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16914#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:13,134 INFO L273 TraceCheckUtils]: 13: Hoare triple {16914#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16915#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:13,136 INFO L273 TraceCheckUtils]: 14: Hoare triple {16915#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16915#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:13,136 INFO L273 TraceCheckUtils]: 15: Hoare triple {16915#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16915#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:13,138 INFO L273 TraceCheckUtils]: 16: Hoare triple {16915#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16916#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:13,138 INFO L273 TraceCheckUtils]: 17: Hoare triple {16916#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16916#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:13,140 INFO L273 TraceCheckUtils]: 18: Hoare triple {16916#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16916#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:13,140 INFO L273 TraceCheckUtils]: 19: Hoare triple {16916#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16917#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:13,142 INFO L273 TraceCheckUtils]: 20: Hoare triple {16917#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16917#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:13,142 INFO L273 TraceCheckUtils]: 21: Hoare triple {16917#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16917#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:13,144 INFO L273 TraceCheckUtils]: 22: Hoare triple {16917#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16918#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:13,144 INFO L273 TraceCheckUtils]: 23: Hoare triple {16918#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16918#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:13,146 INFO L273 TraceCheckUtils]: 24: Hoare triple {16918#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16918#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:13,146 INFO L273 TraceCheckUtils]: 25: Hoare triple {16918#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16919#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:13,148 INFO L273 TraceCheckUtils]: 26: Hoare triple {16919#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16919#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:13,148 INFO L273 TraceCheckUtils]: 27: Hoare triple {16919#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16919#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:13,150 INFO L273 TraceCheckUtils]: 28: Hoare triple {16919#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16920#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:13,150 INFO L273 TraceCheckUtils]: 29: Hoare triple {16920#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16920#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:13,152 INFO L273 TraceCheckUtils]: 30: Hoare triple {16920#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16920#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:13,152 INFO L273 TraceCheckUtils]: 31: Hoare triple {16920#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16921#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:13,154 INFO L273 TraceCheckUtils]: 32: Hoare triple {16921#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16921#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:13,154 INFO L273 TraceCheckUtils]: 33: Hoare triple {16921#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16921#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:13,156 INFO L273 TraceCheckUtils]: 34: Hoare triple {16921#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16922#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:13,156 INFO L273 TraceCheckUtils]: 35: Hoare triple {16922#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16922#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:13,158 INFO L273 TraceCheckUtils]: 36: Hoare triple {16922#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16922#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:13,158 INFO L273 TraceCheckUtils]: 37: Hoare triple {16922#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16923#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:13,160 INFO L273 TraceCheckUtils]: 38: Hoare triple {16923#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16923#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:13,163 INFO L273 TraceCheckUtils]: 39: Hoare triple {16923#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16923#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:13,164 INFO L273 TraceCheckUtils]: 40: Hoare triple {16923#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16924#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:13,165 INFO L273 TraceCheckUtils]: 41: Hoare triple {16924#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16924#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:13,165 INFO L273 TraceCheckUtils]: 42: Hoare triple {16924#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16924#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:13,167 INFO L273 TraceCheckUtils]: 43: Hoare triple {16924#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16925#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:13,167 INFO L273 TraceCheckUtils]: 44: Hoare triple {16925#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16925#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:13,169 INFO L273 TraceCheckUtils]: 45: Hoare triple {16925#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16925#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:13,169 INFO L273 TraceCheckUtils]: 46: Hoare triple {16925#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16926#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:13,171 INFO L273 TraceCheckUtils]: 47: Hoare triple {16926#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16926#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:13,171 INFO L273 TraceCheckUtils]: 48: Hoare triple {16926#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16926#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:13,173 INFO L273 TraceCheckUtils]: 49: Hoare triple {16926#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16927#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:13,173 INFO L273 TraceCheckUtils]: 50: Hoare triple {16927#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16927#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:13,175 INFO L273 TraceCheckUtils]: 51: Hoare triple {16927#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16927#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:13,175 INFO L273 TraceCheckUtils]: 52: Hoare triple {16927#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16928#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:13,177 INFO L273 TraceCheckUtils]: 53: Hoare triple {16928#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16928#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:13,177 INFO L273 TraceCheckUtils]: 54: Hoare triple {16928#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16928#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:13,179 INFO L273 TraceCheckUtils]: 55: Hoare triple {16928#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16929#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:13,179 INFO L273 TraceCheckUtils]: 56: Hoare triple {16929#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16929#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:13,181 INFO L273 TraceCheckUtils]: 57: Hoare triple {16929#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16929#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:13,181 INFO L273 TraceCheckUtils]: 58: Hoare triple {16929#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16930#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:13,183 INFO L273 TraceCheckUtils]: 59: Hoare triple {16930#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16930#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:13,183 INFO L273 TraceCheckUtils]: 60: Hoare triple {16930#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16930#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:13,185 INFO L273 TraceCheckUtils]: 61: Hoare triple {16930#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16931#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:13,185 INFO L273 TraceCheckUtils]: 62: Hoare triple {16931#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16931#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:13,187 INFO L273 TraceCheckUtils]: 63: Hoare triple {16931#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16931#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:13,187 INFO L273 TraceCheckUtils]: 64: Hoare triple {16931#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16932#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:13,190 INFO L273 TraceCheckUtils]: 65: Hoare triple {16932#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16932#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:13,190 INFO L273 TraceCheckUtils]: 66: Hoare triple {16932#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16932#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:13,192 INFO L273 TraceCheckUtils]: 67: Hoare triple {16932#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16933#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:13,205 INFO L273 TraceCheckUtils]: 68: Hoare triple {16933#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16933#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:13,217 INFO L273 TraceCheckUtils]: 69: Hoare triple {16933#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16933#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:13,230 INFO L273 TraceCheckUtils]: 70: Hoare triple {16933#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16934#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:13,243 INFO L273 TraceCheckUtils]: 71: Hoare triple {16934#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16934#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:13,255 INFO L273 TraceCheckUtils]: 72: Hoare triple {16934#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16934#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:13,268 INFO L273 TraceCheckUtils]: 73: Hoare triple {16934#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16935#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:13,280 INFO L273 TraceCheckUtils]: 74: Hoare triple {16935#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16935#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:13,293 INFO L273 TraceCheckUtils]: 75: Hoare triple {16935#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16935#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:13,305 INFO L273 TraceCheckUtils]: 76: Hoare triple {16935#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16936#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:13,318 INFO L273 TraceCheckUtils]: 77: Hoare triple {16936#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16936#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:13,334 INFO L273 TraceCheckUtils]: 78: Hoare triple {16936#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16936#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:13,343 INFO L273 TraceCheckUtils]: 79: Hoare triple {16936#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16937#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:13,355 INFO L273 TraceCheckUtils]: 80: Hoare triple {16937#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16937#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:13,368 INFO L273 TraceCheckUtils]: 81: Hoare triple {16937#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16937#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:13,380 INFO L273 TraceCheckUtils]: 82: Hoare triple {16937#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16938#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:13,397 INFO L273 TraceCheckUtils]: 83: Hoare triple {16938#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16938#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:13,406 INFO L273 TraceCheckUtils]: 84: Hoare triple {16938#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16938#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:13,417 INFO L273 TraceCheckUtils]: 85: Hoare triple {16938#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16939#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:13,417 INFO L273 TraceCheckUtils]: 86: Hoare triple {16939#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16939#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:13,419 INFO L273 TraceCheckUtils]: 87: Hoare triple {16939#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16939#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:13,419 INFO L273 TraceCheckUtils]: 88: Hoare triple {16939#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16940#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:13,437 INFO L273 TraceCheckUtils]: 89: Hoare triple {16940#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {16940#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:13,445 INFO L273 TraceCheckUtils]: 90: Hoare triple {16940#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {16940#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:13,450 INFO L273 TraceCheckUtils]: 91: Hoare triple {16940#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {16941#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:13,450 INFO L273 TraceCheckUtils]: 92: Hoare triple {16941#(<= main_~i~0 30)} assume !(~i~0 < 100000); {16912#false} is VALID [2018-11-23 11:59:13,450 INFO L273 TraceCheckUtils]: 93: Hoare triple {16912#false} havoc ~x~0;~x~0 := 0; {16912#false} is VALID [2018-11-23 11:59:13,450 INFO L273 TraceCheckUtils]: 94: Hoare triple {16912#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {16912#false} is VALID [2018-11-23 11:59:13,451 INFO L256 TraceCheckUtils]: 95: Hoare triple {16912#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {16912#false} is VALID [2018-11-23 11:59:13,451 INFO L273 TraceCheckUtils]: 96: Hoare triple {16912#false} ~cond := #in~cond; {16912#false} is VALID [2018-11-23 11:59:13,451 INFO L273 TraceCheckUtils]: 97: Hoare triple {16912#false} assume 0 == ~cond; {16912#false} is VALID [2018-11-23 11:59:13,451 INFO L273 TraceCheckUtils]: 98: Hoare triple {16912#false} assume !false; {16912#false} is VALID [2018-11-23 11:59:13,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:13,475 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:13,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 31 [2018-11-23 11:59:13,476 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 99 [2018-11-23 11:59:13,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:13,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states. [2018-11-23 11:59:13,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:13,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-11-23 11:59:13,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-11-23 11:59:13,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:59:13,574 INFO L87 Difference]: Start difference. First operand 138 states and 199 transitions. Second operand 31 states. [2018-11-23 11:59:14,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:14,592 INFO L93 Difference]: Finished difference Result 162 states and 231 transitions. [2018-11-23 11:59:14,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-23 11:59:14,592 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 99 [2018-11-23 11:59:14,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:14,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:59:14,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 231 transitions. [2018-11-23 11:59:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 11:59:14,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 231 transitions. [2018-11-23 11:59:14,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 231 transitions. [2018-11-23 11:59:15,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 231 edges. 231 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:15,224 INFO L225 Difference]: With dead ends: 162 [2018-11-23 11:59:15,224 INFO L226 Difference]: Without dead ends: 145 [2018-11-23 11:59:15,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-11-23 11:59:15,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-11-23 11:59:15,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 142. [2018-11-23 11:59:15,309 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:15,309 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand 142 states. [2018-11-23 11:59:15,309 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand 142 states. [2018-11-23 11:59:15,309 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 142 states. [2018-11-23 11:59:15,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,312 INFO L93 Difference]: Finished difference Result 145 states and 210 transitions. [2018-11-23 11:59:15,312 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2018-11-23 11:59:15,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:15,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:15,313 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand 145 states. [2018-11-23 11:59:15,313 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 145 states. [2018-11-23 11:59:15,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:15,316 INFO L93 Difference]: Finished difference Result 145 states and 210 transitions. [2018-11-23 11:59:15,316 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 210 transitions. [2018-11-23 11:59:15,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:15,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:15,317 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:15,317 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:15,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-11-23 11:59:15,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 205 transitions. [2018-11-23 11:59:15,320 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 205 transitions. Word has length 99 [2018-11-23 11:59:15,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:15,320 INFO L480 AbstractCegarLoop]: Abstraction has 142 states and 205 transitions. [2018-11-23 11:59:15,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-11-23 11:59:15,320 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 205 transitions. [2018-11-23 11:59:15,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 11:59:15,321 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:15,321 INFO L402 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:15,321 INFO L423 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:15,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:15,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1253409921, now seen corresponding path program 29 times [2018-11-23 11:59:15,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:15,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:15,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:15,322 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:15,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:15,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:15,945 INFO L256 TraceCheckUtils]: 0: Hoare triple {17915#true} call ULTIMATE.init(); {17915#true} is VALID [2018-11-23 11:59:15,946 INFO L273 TraceCheckUtils]: 1: Hoare triple {17915#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17915#true} is VALID [2018-11-23 11:59:15,946 INFO L273 TraceCheckUtils]: 2: Hoare triple {17915#true} assume true; {17915#true} is VALID [2018-11-23 11:59:15,946 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17915#true} {17915#true} #88#return; {17915#true} is VALID [2018-11-23 11:59:15,947 INFO L256 TraceCheckUtils]: 4: Hoare triple {17915#true} call #t~ret13 := main(); {17915#true} is VALID [2018-11-23 11:59:15,947 INFO L273 TraceCheckUtils]: 5: Hoare triple {17915#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {17915#true} is VALID [2018-11-23 11:59:15,947 INFO L273 TraceCheckUtils]: 6: Hoare triple {17915#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {17915#true} is VALID [2018-11-23 11:59:15,948 INFO L273 TraceCheckUtils]: 7: Hoare triple {17915#true} ~i~0 := 2; {17917#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:15,948 INFO L273 TraceCheckUtils]: 8: Hoare triple {17917#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17917#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:15,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {17917#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17917#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:15,949 INFO L273 TraceCheckUtils]: 10: Hoare triple {17917#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17918#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:15,949 INFO L273 TraceCheckUtils]: 11: Hoare triple {17918#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17918#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:15,949 INFO L273 TraceCheckUtils]: 12: Hoare triple {17918#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17918#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:15,950 INFO L273 TraceCheckUtils]: 13: Hoare triple {17918#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17919#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:15,950 INFO L273 TraceCheckUtils]: 14: Hoare triple {17919#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17919#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:15,951 INFO L273 TraceCheckUtils]: 15: Hoare triple {17919#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17919#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:15,951 INFO L273 TraceCheckUtils]: 16: Hoare triple {17919#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17920#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:15,952 INFO L273 TraceCheckUtils]: 17: Hoare triple {17920#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17920#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:15,952 INFO L273 TraceCheckUtils]: 18: Hoare triple {17920#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17920#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:15,953 INFO L273 TraceCheckUtils]: 19: Hoare triple {17920#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17921#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:15,954 INFO L273 TraceCheckUtils]: 20: Hoare triple {17921#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17921#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:15,954 INFO L273 TraceCheckUtils]: 21: Hoare triple {17921#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17921#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:15,955 INFO L273 TraceCheckUtils]: 22: Hoare triple {17921#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17922#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:15,965 INFO L273 TraceCheckUtils]: 23: Hoare triple {17922#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17922#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:15,966 INFO L273 TraceCheckUtils]: 24: Hoare triple {17922#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17922#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:15,966 INFO L273 TraceCheckUtils]: 25: Hoare triple {17922#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17923#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:15,966 INFO L273 TraceCheckUtils]: 26: Hoare triple {17923#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17923#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:15,967 INFO L273 TraceCheckUtils]: 27: Hoare triple {17923#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17923#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:15,967 INFO L273 TraceCheckUtils]: 28: Hoare triple {17923#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17924#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:15,968 INFO L273 TraceCheckUtils]: 29: Hoare triple {17924#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17924#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:15,968 INFO L273 TraceCheckUtils]: 30: Hoare triple {17924#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17924#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:15,968 INFO L273 TraceCheckUtils]: 31: Hoare triple {17924#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17925#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:15,969 INFO L273 TraceCheckUtils]: 32: Hoare triple {17925#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17925#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:15,969 INFO L273 TraceCheckUtils]: 33: Hoare triple {17925#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17925#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:15,970 INFO L273 TraceCheckUtils]: 34: Hoare triple {17925#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17926#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:15,970 INFO L273 TraceCheckUtils]: 35: Hoare triple {17926#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17926#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:15,971 INFO L273 TraceCheckUtils]: 36: Hoare triple {17926#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17926#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:15,971 INFO L273 TraceCheckUtils]: 37: Hoare triple {17926#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17927#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:15,972 INFO L273 TraceCheckUtils]: 38: Hoare triple {17927#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17927#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:15,972 INFO L273 TraceCheckUtils]: 39: Hoare triple {17927#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17927#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:15,973 INFO L273 TraceCheckUtils]: 40: Hoare triple {17927#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17928#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:15,974 INFO L273 TraceCheckUtils]: 41: Hoare triple {17928#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17928#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:15,974 INFO L273 TraceCheckUtils]: 42: Hoare triple {17928#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17928#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:15,975 INFO L273 TraceCheckUtils]: 43: Hoare triple {17928#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17929#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:15,975 INFO L273 TraceCheckUtils]: 44: Hoare triple {17929#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17929#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:15,976 INFO L273 TraceCheckUtils]: 45: Hoare triple {17929#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17929#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:15,977 INFO L273 TraceCheckUtils]: 46: Hoare triple {17929#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17930#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:15,977 INFO L273 TraceCheckUtils]: 47: Hoare triple {17930#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17930#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:15,978 INFO L273 TraceCheckUtils]: 48: Hoare triple {17930#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17930#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:15,978 INFO L273 TraceCheckUtils]: 49: Hoare triple {17930#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17931#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:15,979 INFO L273 TraceCheckUtils]: 50: Hoare triple {17931#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17931#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:15,979 INFO L273 TraceCheckUtils]: 51: Hoare triple {17931#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17931#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:15,980 INFO L273 TraceCheckUtils]: 52: Hoare triple {17931#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17932#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:15,981 INFO L273 TraceCheckUtils]: 53: Hoare triple {17932#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17932#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:15,981 INFO L273 TraceCheckUtils]: 54: Hoare triple {17932#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17932#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:15,982 INFO L273 TraceCheckUtils]: 55: Hoare triple {17932#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17933#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:15,982 INFO L273 TraceCheckUtils]: 56: Hoare triple {17933#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17933#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:15,983 INFO L273 TraceCheckUtils]: 57: Hoare triple {17933#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17933#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:15,984 INFO L273 TraceCheckUtils]: 58: Hoare triple {17933#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17934#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:15,984 INFO L273 TraceCheckUtils]: 59: Hoare triple {17934#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17934#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:15,985 INFO L273 TraceCheckUtils]: 60: Hoare triple {17934#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17934#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:15,985 INFO L273 TraceCheckUtils]: 61: Hoare triple {17934#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17935#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:15,986 INFO L273 TraceCheckUtils]: 62: Hoare triple {17935#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17935#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:15,986 INFO L273 TraceCheckUtils]: 63: Hoare triple {17935#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17935#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:15,987 INFO L273 TraceCheckUtils]: 64: Hoare triple {17935#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17936#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:15,988 INFO L273 TraceCheckUtils]: 65: Hoare triple {17936#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17936#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:15,988 INFO L273 TraceCheckUtils]: 66: Hoare triple {17936#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17936#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:15,989 INFO L273 TraceCheckUtils]: 67: Hoare triple {17936#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17937#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:15,989 INFO L273 TraceCheckUtils]: 68: Hoare triple {17937#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17937#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:15,990 INFO L273 TraceCheckUtils]: 69: Hoare triple {17937#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17937#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:15,991 INFO L273 TraceCheckUtils]: 70: Hoare triple {17937#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17938#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:15,991 INFO L273 TraceCheckUtils]: 71: Hoare triple {17938#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17938#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:15,992 INFO L273 TraceCheckUtils]: 72: Hoare triple {17938#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17938#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:15,992 INFO L273 TraceCheckUtils]: 73: Hoare triple {17938#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17939#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:15,993 INFO L273 TraceCheckUtils]: 74: Hoare triple {17939#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17939#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:15,993 INFO L273 TraceCheckUtils]: 75: Hoare triple {17939#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17939#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:16,000 INFO L273 TraceCheckUtils]: 76: Hoare triple {17939#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17940#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:16,000 INFO L273 TraceCheckUtils]: 77: Hoare triple {17940#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17940#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:16,001 INFO L273 TraceCheckUtils]: 78: Hoare triple {17940#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17940#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:16,001 INFO L273 TraceCheckUtils]: 79: Hoare triple {17940#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17941#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:16,001 INFO L273 TraceCheckUtils]: 80: Hoare triple {17941#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17941#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:16,002 INFO L273 TraceCheckUtils]: 81: Hoare triple {17941#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17941#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:16,002 INFO L273 TraceCheckUtils]: 82: Hoare triple {17941#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17942#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:16,002 INFO L273 TraceCheckUtils]: 83: Hoare triple {17942#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17942#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:16,003 INFO L273 TraceCheckUtils]: 84: Hoare triple {17942#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17942#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:16,003 INFO L273 TraceCheckUtils]: 85: Hoare triple {17942#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17943#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:16,003 INFO L273 TraceCheckUtils]: 86: Hoare triple {17943#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17943#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:16,004 INFO L273 TraceCheckUtils]: 87: Hoare triple {17943#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17943#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:16,004 INFO L273 TraceCheckUtils]: 88: Hoare triple {17943#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17944#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:16,005 INFO L273 TraceCheckUtils]: 89: Hoare triple {17944#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17944#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:16,005 INFO L273 TraceCheckUtils]: 90: Hoare triple {17944#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17944#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:16,006 INFO L273 TraceCheckUtils]: 91: Hoare triple {17944#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17945#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:16,007 INFO L273 TraceCheckUtils]: 92: Hoare triple {17945#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17945#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:16,007 INFO L273 TraceCheckUtils]: 93: Hoare triple {17945#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17945#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:16,008 INFO L273 TraceCheckUtils]: 94: Hoare triple {17945#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17946#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:16,009 INFO L273 TraceCheckUtils]: 95: Hoare triple {17946#(<= main_~i~0 31)} assume !(~i~0 < 100000); {17916#false} is VALID [2018-11-23 11:59:16,009 INFO L273 TraceCheckUtils]: 96: Hoare triple {17916#false} havoc ~x~0;~x~0 := 0; {17916#false} is VALID [2018-11-23 11:59:16,009 INFO L273 TraceCheckUtils]: 97: Hoare triple {17916#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {17916#false} is VALID [2018-11-23 11:59:16,009 INFO L256 TraceCheckUtils]: 98: Hoare triple {17916#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {17916#false} is VALID [2018-11-23 11:59:16,009 INFO L273 TraceCheckUtils]: 99: Hoare triple {17916#false} ~cond := #in~cond; {17916#false} is VALID [2018-11-23 11:59:16,010 INFO L273 TraceCheckUtils]: 100: Hoare triple {17916#false} assume 0 == ~cond; {17916#false} is VALID [2018-11-23 11:59:16,010 INFO L273 TraceCheckUtils]: 101: Hoare triple {17916#false} assume !false; {17916#false} is VALID [2018-11-23 11:59:16,018 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:16,018 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:16,018 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-23 11:59:16,028 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:16,101 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 30 check-sat command(s) [2018-11-23 11:59:16,101 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:16,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:16,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {17915#true} call ULTIMATE.init(); {17915#true} is VALID [2018-11-23 11:59:16,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {17915#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {17915#true} is VALID [2018-11-23 11:59:16,368 INFO L273 TraceCheckUtils]: 2: Hoare triple {17915#true} assume true; {17915#true} is VALID [2018-11-23 11:59:16,368 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {17915#true} {17915#true} #88#return; {17915#true} is VALID [2018-11-23 11:59:16,369 INFO L256 TraceCheckUtils]: 4: Hoare triple {17915#true} call #t~ret13 := main(); {17915#true} is VALID [2018-11-23 11:59:16,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {17915#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {17915#true} is VALID [2018-11-23 11:59:16,369 INFO L273 TraceCheckUtils]: 6: Hoare triple {17915#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {17915#true} is VALID [2018-11-23 11:59:16,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {17915#true} ~i~0 := 2; {17917#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {17917#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17917#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,370 INFO L273 TraceCheckUtils]: 9: Hoare triple {17917#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17917#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:16,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {17917#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17918#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {17918#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17918#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,371 INFO L273 TraceCheckUtils]: 12: Hoare triple {17918#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17918#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:16,372 INFO L273 TraceCheckUtils]: 13: Hoare triple {17918#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17919#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:16,372 INFO L273 TraceCheckUtils]: 14: Hoare triple {17919#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17919#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:16,373 INFO L273 TraceCheckUtils]: 15: Hoare triple {17919#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17919#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:16,374 INFO L273 TraceCheckUtils]: 16: Hoare triple {17919#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17920#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:16,374 INFO L273 TraceCheckUtils]: 17: Hoare triple {17920#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17920#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:16,375 INFO L273 TraceCheckUtils]: 18: Hoare triple {17920#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17920#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:16,375 INFO L273 TraceCheckUtils]: 19: Hoare triple {17920#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17921#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:16,376 INFO L273 TraceCheckUtils]: 20: Hoare triple {17921#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17921#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:16,376 INFO L273 TraceCheckUtils]: 21: Hoare triple {17921#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17921#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:16,377 INFO L273 TraceCheckUtils]: 22: Hoare triple {17921#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17922#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:16,378 INFO L273 TraceCheckUtils]: 23: Hoare triple {17922#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17922#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:16,378 INFO L273 TraceCheckUtils]: 24: Hoare triple {17922#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17922#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:16,379 INFO L273 TraceCheckUtils]: 25: Hoare triple {17922#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17923#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:16,379 INFO L273 TraceCheckUtils]: 26: Hoare triple {17923#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17923#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:16,380 INFO L273 TraceCheckUtils]: 27: Hoare triple {17923#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17923#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:16,381 INFO L273 TraceCheckUtils]: 28: Hoare triple {17923#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17924#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:16,381 INFO L273 TraceCheckUtils]: 29: Hoare triple {17924#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17924#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:16,382 INFO L273 TraceCheckUtils]: 30: Hoare triple {17924#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17924#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:16,382 INFO L273 TraceCheckUtils]: 31: Hoare triple {17924#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17925#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:16,383 INFO L273 TraceCheckUtils]: 32: Hoare triple {17925#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17925#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:16,383 INFO L273 TraceCheckUtils]: 33: Hoare triple {17925#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17925#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:16,384 INFO L273 TraceCheckUtils]: 34: Hoare triple {17925#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17926#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:16,385 INFO L273 TraceCheckUtils]: 35: Hoare triple {17926#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17926#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:16,385 INFO L273 TraceCheckUtils]: 36: Hoare triple {17926#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17926#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:16,386 INFO L273 TraceCheckUtils]: 37: Hoare triple {17926#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17927#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:16,386 INFO L273 TraceCheckUtils]: 38: Hoare triple {17927#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17927#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:16,387 INFO L273 TraceCheckUtils]: 39: Hoare triple {17927#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17927#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:16,388 INFO L273 TraceCheckUtils]: 40: Hoare triple {17927#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17928#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:16,388 INFO L273 TraceCheckUtils]: 41: Hoare triple {17928#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17928#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:16,389 INFO L273 TraceCheckUtils]: 42: Hoare triple {17928#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17928#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:16,389 INFO L273 TraceCheckUtils]: 43: Hoare triple {17928#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17929#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:16,390 INFO L273 TraceCheckUtils]: 44: Hoare triple {17929#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17929#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:16,390 INFO L273 TraceCheckUtils]: 45: Hoare triple {17929#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17929#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:16,391 INFO L273 TraceCheckUtils]: 46: Hoare triple {17929#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17930#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:16,392 INFO L273 TraceCheckUtils]: 47: Hoare triple {17930#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17930#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:16,392 INFO L273 TraceCheckUtils]: 48: Hoare triple {17930#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17930#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:16,393 INFO L273 TraceCheckUtils]: 49: Hoare triple {17930#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17931#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:16,393 INFO L273 TraceCheckUtils]: 50: Hoare triple {17931#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17931#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:16,394 INFO L273 TraceCheckUtils]: 51: Hoare triple {17931#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17931#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:16,395 INFO L273 TraceCheckUtils]: 52: Hoare triple {17931#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17932#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:16,395 INFO L273 TraceCheckUtils]: 53: Hoare triple {17932#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17932#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:16,396 INFO L273 TraceCheckUtils]: 54: Hoare triple {17932#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17932#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:16,396 INFO L273 TraceCheckUtils]: 55: Hoare triple {17932#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17933#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:16,397 INFO L273 TraceCheckUtils]: 56: Hoare triple {17933#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17933#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:16,397 INFO L273 TraceCheckUtils]: 57: Hoare triple {17933#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17933#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:16,398 INFO L273 TraceCheckUtils]: 58: Hoare triple {17933#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17934#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:16,399 INFO L273 TraceCheckUtils]: 59: Hoare triple {17934#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17934#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:16,399 INFO L273 TraceCheckUtils]: 60: Hoare triple {17934#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17934#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:16,400 INFO L273 TraceCheckUtils]: 61: Hoare triple {17934#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17935#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:16,400 INFO L273 TraceCheckUtils]: 62: Hoare triple {17935#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17935#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:16,401 INFO L273 TraceCheckUtils]: 63: Hoare triple {17935#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17935#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:16,402 INFO L273 TraceCheckUtils]: 64: Hoare triple {17935#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17936#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:16,402 INFO L273 TraceCheckUtils]: 65: Hoare triple {17936#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17936#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:16,403 INFO L273 TraceCheckUtils]: 66: Hoare triple {17936#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17936#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:16,403 INFO L273 TraceCheckUtils]: 67: Hoare triple {17936#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17937#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:16,404 INFO L273 TraceCheckUtils]: 68: Hoare triple {17937#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17937#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:16,404 INFO L273 TraceCheckUtils]: 69: Hoare triple {17937#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17937#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:16,405 INFO L273 TraceCheckUtils]: 70: Hoare triple {17937#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17938#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:16,406 INFO L273 TraceCheckUtils]: 71: Hoare triple {17938#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17938#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:16,406 INFO L273 TraceCheckUtils]: 72: Hoare triple {17938#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17938#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:16,407 INFO L273 TraceCheckUtils]: 73: Hoare triple {17938#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17939#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:16,407 INFO L273 TraceCheckUtils]: 74: Hoare triple {17939#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17939#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:16,408 INFO L273 TraceCheckUtils]: 75: Hoare triple {17939#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17939#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:16,409 INFO L273 TraceCheckUtils]: 76: Hoare triple {17939#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17940#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:16,409 INFO L273 TraceCheckUtils]: 77: Hoare triple {17940#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17940#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:16,410 INFO L273 TraceCheckUtils]: 78: Hoare triple {17940#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17940#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:16,410 INFO L273 TraceCheckUtils]: 79: Hoare triple {17940#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17941#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:16,411 INFO L273 TraceCheckUtils]: 80: Hoare triple {17941#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17941#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:16,411 INFO L273 TraceCheckUtils]: 81: Hoare triple {17941#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17941#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:16,412 INFO L273 TraceCheckUtils]: 82: Hoare triple {17941#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17942#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:16,413 INFO L273 TraceCheckUtils]: 83: Hoare triple {17942#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17942#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:16,413 INFO L273 TraceCheckUtils]: 84: Hoare triple {17942#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17942#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:16,414 INFO L273 TraceCheckUtils]: 85: Hoare triple {17942#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17943#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:16,414 INFO L273 TraceCheckUtils]: 86: Hoare triple {17943#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17943#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:16,415 INFO L273 TraceCheckUtils]: 87: Hoare triple {17943#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17943#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:16,416 INFO L273 TraceCheckUtils]: 88: Hoare triple {17943#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17944#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:16,416 INFO L273 TraceCheckUtils]: 89: Hoare triple {17944#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17944#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:16,417 INFO L273 TraceCheckUtils]: 90: Hoare triple {17944#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17944#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:16,417 INFO L273 TraceCheckUtils]: 91: Hoare triple {17944#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17945#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:16,418 INFO L273 TraceCheckUtils]: 92: Hoare triple {17945#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {17945#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:16,418 INFO L273 TraceCheckUtils]: 93: Hoare triple {17945#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {17945#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:16,419 INFO L273 TraceCheckUtils]: 94: Hoare triple {17945#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {17946#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:16,420 INFO L273 TraceCheckUtils]: 95: Hoare triple {17946#(<= main_~i~0 31)} assume !(~i~0 < 100000); {17916#false} is VALID [2018-11-23 11:59:16,420 INFO L273 TraceCheckUtils]: 96: Hoare triple {17916#false} havoc ~x~0;~x~0 := 0; {17916#false} is VALID [2018-11-23 11:59:16,420 INFO L273 TraceCheckUtils]: 97: Hoare triple {17916#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {17916#false} is VALID [2018-11-23 11:59:16,420 INFO L256 TraceCheckUtils]: 98: Hoare triple {17916#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {17916#false} is VALID [2018-11-23 11:59:16,421 INFO L273 TraceCheckUtils]: 99: Hoare triple {17916#false} ~cond := #in~cond; {17916#false} is VALID [2018-11-23 11:59:16,421 INFO L273 TraceCheckUtils]: 100: Hoare triple {17916#false} assume 0 == ~cond; {17916#false} is VALID [2018-11-23 11:59:16,421 INFO L273 TraceCheckUtils]: 101: Hoare triple {17916#false} assume !false; {17916#false} is VALID [2018-11-23 11:59:16,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:16,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:16,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 32 [2018-11-23 11:59:16,448 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 102 [2018-11-23 11:59:16,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:16,448 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states. [2018-11-23 11:59:16,547 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-23 11:59:16,548 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-11-23 11:59:16,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-11-23 11:59:16,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:59:16,549 INFO L87 Difference]: Start difference. First operand 142 states and 205 transitions. Second operand 32 states. [2018-11-23 11:59:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,586 INFO L93 Difference]: Finished difference Result 166 states and 237 transitions. [2018-11-23 11:59:17,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-11-23 11:59:17,586 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 102 [2018-11-23 11:59:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:17,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:59:17,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 237 transitions. [2018-11-23 11:59:17,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 11:59:17,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 237 transitions. [2018-11-23 11:59:17,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 237 transitions. [2018-11-23 11:59:17,828 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-23 11:59:17,831 INFO L225 Difference]: With dead ends: 166 [2018-11-23 11:59:17,831 INFO L226 Difference]: Without dead ends: 149 [2018-11-23 11:59:17,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 11:59:17,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-11-23 11:59:17,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-11-23 11:59:17,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:17,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand 146 states. [2018-11-23 11:59:17,888 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand 146 states. [2018-11-23 11:59:17,888 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 146 states. [2018-11-23 11:59:17,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,891 INFO L93 Difference]: Finished difference Result 149 states and 216 transitions. [2018-11-23 11:59:17,891 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 216 transitions. [2018-11-23 11:59:17,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:17,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:17,891 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 149 states. [2018-11-23 11:59:17,891 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 149 states. [2018-11-23 11:59:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:17,893 INFO L93 Difference]: Finished difference Result 149 states and 216 transitions. [2018-11-23 11:59:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 216 transitions. [2018-11-23 11:59:17,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:17,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:17,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:17,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:17,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-23 11:59:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 211 transitions. [2018-11-23 11:59:17,896 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 211 transitions. Word has length 102 [2018-11-23 11:59:17,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:17,896 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 211 transitions. [2018-11-23 11:59:17,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-11-23 11:59:17,896 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 211 transitions. [2018-11-23 11:59:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-23 11:59:17,897 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:17,897 INFO L402 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:17,897 INFO L423 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:17,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:17,898 INFO L82 PathProgramCache]: Analyzing trace with hash 539067004, now seen corresponding path program 30 times [2018-11-23 11:59:17,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:17,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:17,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:17,898 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:17,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:18,828 INFO L256 TraceCheckUtils]: 0: Hoare triple {18947#true} call ULTIMATE.init(); {18947#true} is VALID [2018-11-23 11:59:18,828 INFO L273 TraceCheckUtils]: 1: Hoare triple {18947#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18947#true} is VALID [2018-11-23 11:59:18,828 INFO L273 TraceCheckUtils]: 2: Hoare triple {18947#true} assume true; {18947#true} is VALID [2018-11-23 11:59:18,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18947#true} {18947#true} #88#return; {18947#true} is VALID [2018-11-23 11:59:18,829 INFO L256 TraceCheckUtils]: 4: Hoare triple {18947#true} call #t~ret13 := main(); {18947#true} is VALID [2018-11-23 11:59:18,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {18947#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {18947#true} is VALID [2018-11-23 11:59:18,829 INFO L273 TraceCheckUtils]: 6: Hoare triple {18947#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {18947#true} is VALID [2018-11-23 11:59:18,830 INFO L273 TraceCheckUtils]: 7: Hoare triple {18947#true} ~i~0 := 2; {18949#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:18,830 INFO L273 TraceCheckUtils]: 8: Hoare triple {18949#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18949#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:18,831 INFO L273 TraceCheckUtils]: 9: Hoare triple {18949#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18949#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:18,831 INFO L273 TraceCheckUtils]: 10: Hoare triple {18949#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18950#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:18,832 INFO L273 TraceCheckUtils]: 11: Hoare triple {18950#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18950#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:18,832 INFO L273 TraceCheckUtils]: 12: Hoare triple {18950#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18950#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:18,833 INFO L273 TraceCheckUtils]: 13: Hoare triple {18950#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18951#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:18,834 INFO L273 TraceCheckUtils]: 14: Hoare triple {18951#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18951#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:18,834 INFO L273 TraceCheckUtils]: 15: Hoare triple {18951#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18951#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:18,835 INFO L273 TraceCheckUtils]: 16: Hoare triple {18951#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18952#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:18,835 INFO L273 TraceCheckUtils]: 17: Hoare triple {18952#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18952#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:18,836 INFO L273 TraceCheckUtils]: 18: Hoare triple {18952#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18952#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:18,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {18952#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18953#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:18,837 INFO L273 TraceCheckUtils]: 20: Hoare triple {18953#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18953#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:18,838 INFO L273 TraceCheckUtils]: 21: Hoare triple {18953#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18953#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:18,838 INFO L273 TraceCheckUtils]: 22: Hoare triple {18953#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18954#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:18,839 INFO L273 TraceCheckUtils]: 23: Hoare triple {18954#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18954#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:18,839 INFO L273 TraceCheckUtils]: 24: Hoare triple {18954#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18954#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:18,840 INFO L273 TraceCheckUtils]: 25: Hoare triple {18954#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:18,841 INFO L273 TraceCheckUtils]: 26: Hoare triple {18955#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18955#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:18,841 INFO L273 TraceCheckUtils]: 27: Hoare triple {18955#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18955#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:18,842 INFO L273 TraceCheckUtils]: 28: Hoare triple {18955#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18956#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:18,842 INFO L273 TraceCheckUtils]: 29: Hoare triple {18956#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18956#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:18,843 INFO L273 TraceCheckUtils]: 30: Hoare triple {18956#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18956#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:18,843 INFO L273 TraceCheckUtils]: 31: Hoare triple {18956#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18957#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:18,844 INFO L273 TraceCheckUtils]: 32: Hoare triple {18957#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18957#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:18,845 INFO L273 TraceCheckUtils]: 33: Hoare triple {18957#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18957#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:18,845 INFO L273 TraceCheckUtils]: 34: Hoare triple {18957#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18958#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:18,846 INFO L273 TraceCheckUtils]: 35: Hoare triple {18958#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18958#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:18,846 INFO L273 TraceCheckUtils]: 36: Hoare triple {18958#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18958#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:18,847 INFO L273 TraceCheckUtils]: 37: Hoare triple {18958#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18959#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:18,848 INFO L273 TraceCheckUtils]: 38: Hoare triple {18959#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18959#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:18,848 INFO L273 TraceCheckUtils]: 39: Hoare triple {18959#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18959#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:18,849 INFO L273 TraceCheckUtils]: 40: Hoare triple {18959#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18960#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:18,849 INFO L273 TraceCheckUtils]: 41: Hoare triple {18960#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18960#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:18,850 INFO L273 TraceCheckUtils]: 42: Hoare triple {18960#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18960#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:18,850 INFO L273 TraceCheckUtils]: 43: Hoare triple {18960#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18961#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:18,851 INFO L273 TraceCheckUtils]: 44: Hoare triple {18961#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18961#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:18,851 INFO L273 TraceCheckUtils]: 45: Hoare triple {18961#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18961#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:18,852 INFO L273 TraceCheckUtils]: 46: Hoare triple {18961#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18962#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:18,853 INFO L273 TraceCheckUtils]: 47: Hoare triple {18962#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18962#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:18,853 INFO L273 TraceCheckUtils]: 48: Hoare triple {18962#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18962#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:18,854 INFO L273 TraceCheckUtils]: 49: Hoare triple {18962#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18963#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:18,854 INFO L273 TraceCheckUtils]: 50: Hoare triple {18963#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18963#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:18,855 INFO L273 TraceCheckUtils]: 51: Hoare triple {18963#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18963#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:18,856 INFO L273 TraceCheckUtils]: 52: Hoare triple {18963#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18964#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:18,856 INFO L273 TraceCheckUtils]: 53: Hoare triple {18964#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18964#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:18,857 INFO L273 TraceCheckUtils]: 54: Hoare triple {18964#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18964#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:18,857 INFO L273 TraceCheckUtils]: 55: Hoare triple {18964#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18965#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:18,858 INFO L273 TraceCheckUtils]: 56: Hoare triple {18965#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18965#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:18,858 INFO L273 TraceCheckUtils]: 57: Hoare triple {18965#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18965#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:18,859 INFO L273 TraceCheckUtils]: 58: Hoare triple {18965#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18966#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:18,860 INFO L273 TraceCheckUtils]: 59: Hoare triple {18966#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18966#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:18,860 INFO L273 TraceCheckUtils]: 60: Hoare triple {18966#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18966#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:18,861 INFO L273 TraceCheckUtils]: 61: Hoare triple {18966#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18967#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:18,861 INFO L273 TraceCheckUtils]: 62: Hoare triple {18967#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18967#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:18,862 INFO L273 TraceCheckUtils]: 63: Hoare triple {18967#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18967#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:18,863 INFO L273 TraceCheckUtils]: 64: Hoare triple {18967#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18968#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:18,863 INFO L273 TraceCheckUtils]: 65: Hoare triple {18968#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18968#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:18,864 INFO L273 TraceCheckUtils]: 66: Hoare triple {18968#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18968#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:18,864 INFO L273 TraceCheckUtils]: 67: Hoare triple {18968#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18969#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:18,865 INFO L273 TraceCheckUtils]: 68: Hoare triple {18969#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18969#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:18,865 INFO L273 TraceCheckUtils]: 69: Hoare triple {18969#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18969#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:18,866 INFO L273 TraceCheckUtils]: 70: Hoare triple {18969#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18970#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:18,867 INFO L273 TraceCheckUtils]: 71: Hoare triple {18970#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18970#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:18,867 INFO L273 TraceCheckUtils]: 72: Hoare triple {18970#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18970#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:18,868 INFO L273 TraceCheckUtils]: 73: Hoare triple {18970#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18971#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:18,868 INFO L273 TraceCheckUtils]: 74: Hoare triple {18971#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18971#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:18,869 INFO L273 TraceCheckUtils]: 75: Hoare triple {18971#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18971#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:18,870 INFO L273 TraceCheckUtils]: 76: Hoare triple {18971#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18972#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:18,870 INFO L273 TraceCheckUtils]: 77: Hoare triple {18972#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18972#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:18,871 INFO L273 TraceCheckUtils]: 78: Hoare triple {18972#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18972#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:18,871 INFO L273 TraceCheckUtils]: 79: Hoare triple {18972#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18973#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:18,872 INFO L273 TraceCheckUtils]: 80: Hoare triple {18973#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18973#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:18,872 INFO L273 TraceCheckUtils]: 81: Hoare triple {18973#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18973#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:18,873 INFO L273 TraceCheckUtils]: 82: Hoare triple {18973#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18974#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:18,874 INFO L273 TraceCheckUtils]: 83: Hoare triple {18974#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18974#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:18,874 INFO L273 TraceCheckUtils]: 84: Hoare triple {18974#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18974#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:18,875 INFO L273 TraceCheckUtils]: 85: Hoare triple {18974#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18975#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:18,875 INFO L273 TraceCheckUtils]: 86: Hoare triple {18975#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18975#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:18,876 INFO L273 TraceCheckUtils]: 87: Hoare triple {18975#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18975#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:18,877 INFO L273 TraceCheckUtils]: 88: Hoare triple {18975#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18976#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:18,877 INFO L273 TraceCheckUtils]: 89: Hoare triple {18976#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18976#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:18,878 INFO L273 TraceCheckUtils]: 90: Hoare triple {18976#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18976#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:18,878 INFO L273 TraceCheckUtils]: 91: Hoare triple {18976#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18977#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:18,879 INFO L273 TraceCheckUtils]: 92: Hoare triple {18977#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18977#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:18,879 INFO L273 TraceCheckUtils]: 93: Hoare triple {18977#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18977#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:18,880 INFO L273 TraceCheckUtils]: 94: Hoare triple {18977#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18978#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:18,881 INFO L273 TraceCheckUtils]: 95: Hoare triple {18978#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18978#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:18,881 INFO L273 TraceCheckUtils]: 96: Hoare triple {18978#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18978#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:18,882 INFO L273 TraceCheckUtils]: 97: Hoare triple {18978#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18979#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:18,883 INFO L273 TraceCheckUtils]: 98: Hoare triple {18979#(<= main_~i~0 32)} assume !(~i~0 < 100000); {18948#false} is VALID [2018-11-23 11:59:18,883 INFO L273 TraceCheckUtils]: 99: Hoare triple {18948#false} havoc ~x~0;~x~0 := 0; {18948#false} is VALID [2018-11-23 11:59:18,883 INFO L273 TraceCheckUtils]: 100: Hoare triple {18948#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {18948#false} is VALID [2018-11-23 11:59:18,883 INFO L256 TraceCheckUtils]: 101: Hoare triple {18948#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {18948#false} is VALID [2018-11-23 11:59:18,883 INFO L273 TraceCheckUtils]: 102: Hoare triple {18948#false} ~cond := #in~cond; {18948#false} is VALID [2018-11-23 11:59:18,884 INFO L273 TraceCheckUtils]: 103: Hoare triple {18948#false} assume 0 == ~cond; {18948#false} is VALID [2018-11-23 11:59:18,884 INFO L273 TraceCheckUtils]: 104: Hoare triple {18948#false} assume !false; {18948#false} is VALID [2018-11-23 11:59:18,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:18,892 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:18,892 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-23 11:59:18,900 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:18,983 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 31 check-sat command(s) [2018-11-23 11:59:18,984 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:19,037 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:20,108 INFO L256 TraceCheckUtils]: 0: Hoare triple {18947#true} call ULTIMATE.init(); {18947#true} is VALID [2018-11-23 11:59:20,108 INFO L273 TraceCheckUtils]: 1: Hoare triple {18947#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {18947#true} is VALID [2018-11-23 11:59:20,108 INFO L273 TraceCheckUtils]: 2: Hoare triple {18947#true} assume true; {18947#true} is VALID [2018-11-23 11:59:20,108 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {18947#true} {18947#true} #88#return; {18947#true} is VALID [2018-11-23 11:59:20,108 INFO L256 TraceCheckUtils]: 4: Hoare triple {18947#true} call #t~ret13 := main(); {18947#true} is VALID [2018-11-23 11:59:20,109 INFO L273 TraceCheckUtils]: 5: Hoare triple {18947#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {18947#true} is VALID [2018-11-23 11:59:20,109 INFO L273 TraceCheckUtils]: 6: Hoare triple {18947#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {18947#true} is VALID [2018-11-23 11:59:20,109 INFO L273 TraceCheckUtils]: 7: Hoare triple {18947#true} ~i~0 := 2; {18949#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:20,109 INFO L273 TraceCheckUtils]: 8: Hoare triple {18949#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18949#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:20,110 INFO L273 TraceCheckUtils]: 9: Hoare triple {18949#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18949#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:20,110 INFO L273 TraceCheckUtils]: 10: Hoare triple {18949#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18950#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:20,110 INFO L273 TraceCheckUtils]: 11: Hoare triple {18950#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18950#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:20,111 INFO L273 TraceCheckUtils]: 12: Hoare triple {18950#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18950#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:20,111 INFO L273 TraceCheckUtils]: 13: Hoare triple {18950#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18951#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:20,111 INFO L273 TraceCheckUtils]: 14: Hoare triple {18951#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18951#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:20,112 INFO L273 TraceCheckUtils]: 15: Hoare triple {18951#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18951#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:20,113 INFO L273 TraceCheckUtils]: 16: Hoare triple {18951#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18952#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:20,113 INFO L273 TraceCheckUtils]: 17: Hoare triple {18952#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18952#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:20,114 INFO L273 TraceCheckUtils]: 18: Hoare triple {18952#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18952#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:20,114 INFO L273 TraceCheckUtils]: 19: Hoare triple {18952#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18953#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:20,115 INFO L273 TraceCheckUtils]: 20: Hoare triple {18953#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18953#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:20,115 INFO L273 TraceCheckUtils]: 21: Hoare triple {18953#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18953#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:20,116 INFO L273 TraceCheckUtils]: 22: Hoare triple {18953#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18954#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:20,117 INFO L273 TraceCheckUtils]: 23: Hoare triple {18954#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18954#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:20,117 INFO L273 TraceCheckUtils]: 24: Hoare triple {18954#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18954#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:20,118 INFO L273 TraceCheckUtils]: 25: Hoare triple {18954#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18955#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:20,118 INFO L273 TraceCheckUtils]: 26: Hoare triple {18955#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18955#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:20,119 INFO L273 TraceCheckUtils]: 27: Hoare triple {18955#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18955#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:20,120 INFO L273 TraceCheckUtils]: 28: Hoare triple {18955#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18956#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:20,120 INFO L273 TraceCheckUtils]: 29: Hoare triple {18956#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18956#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:20,121 INFO L273 TraceCheckUtils]: 30: Hoare triple {18956#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18956#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:20,121 INFO L273 TraceCheckUtils]: 31: Hoare triple {18956#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18957#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:20,122 INFO L273 TraceCheckUtils]: 32: Hoare triple {18957#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18957#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:20,122 INFO L273 TraceCheckUtils]: 33: Hoare triple {18957#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18957#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:20,123 INFO L273 TraceCheckUtils]: 34: Hoare triple {18957#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18958#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:20,124 INFO L273 TraceCheckUtils]: 35: Hoare triple {18958#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18958#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:20,124 INFO L273 TraceCheckUtils]: 36: Hoare triple {18958#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18958#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:20,125 INFO L273 TraceCheckUtils]: 37: Hoare triple {18958#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18959#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:20,125 INFO L273 TraceCheckUtils]: 38: Hoare triple {18959#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18959#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:20,126 INFO L273 TraceCheckUtils]: 39: Hoare triple {18959#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18959#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:20,127 INFO L273 TraceCheckUtils]: 40: Hoare triple {18959#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18960#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:20,127 INFO L273 TraceCheckUtils]: 41: Hoare triple {18960#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18960#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:20,128 INFO L273 TraceCheckUtils]: 42: Hoare triple {18960#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18960#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:20,128 INFO L273 TraceCheckUtils]: 43: Hoare triple {18960#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18961#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:20,129 INFO L273 TraceCheckUtils]: 44: Hoare triple {18961#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18961#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:20,129 INFO L273 TraceCheckUtils]: 45: Hoare triple {18961#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18961#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:20,130 INFO L273 TraceCheckUtils]: 46: Hoare triple {18961#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18962#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:20,131 INFO L273 TraceCheckUtils]: 47: Hoare triple {18962#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18962#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:20,131 INFO L273 TraceCheckUtils]: 48: Hoare triple {18962#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18962#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:20,132 INFO L273 TraceCheckUtils]: 49: Hoare triple {18962#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18963#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:20,132 INFO L273 TraceCheckUtils]: 50: Hoare triple {18963#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18963#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:20,133 INFO L273 TraceCheckUtils]: 51: Hoare triple {18963#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18963#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:20,134 INFO L273 TraceCheckUtils]: 52: Hoare triple {18963#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18964#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:20,134 INFO L273 TraceCheckUtils]: 53: Hoare triple {18964#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18964#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:20,135 INFO L273 TraceCheckUtils]: 54: Hoare triple {18964#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18964#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:20,135 INFO L273 TraceCheckUtils]: 55: Hoare triple {18964#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18965#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:20,136 INFO L273 TraceCheckUtils]: 56: Hoare triple {18965#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18965#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:20,136 INFO L273 TraceCheckUtils]: 57: Hoare triple {18965#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18965#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:20,137 INFO L273 TraceCheckUtils]: 58: Hoare triple {18965#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18966#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:20,138 INFO L273 TraceCheckUtils]: 59: Hoare triple {18966#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18966#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:20,138 INFO L273 TraceCheckUtils]: 60: Hoare triple {18966#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18966#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:20,139 INFO L273 TraceCheckUtils]: 61: Hoare triple {18966#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18967#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:20,139 INFO L273 TraceCheckUtils]: 62: Hoare triple {18967#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18967#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:20,140 INFO L273 TraceCheckUtils]: 63: Hoare triple {18967#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18967#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:20,141 INFO L273 TraceCheckUtils]: 64: Hoare triple {18967#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18968#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:20,141 INFO L273 TraceCheckUtils]: 65: Hoare triple {18968#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18968#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:20,142 INFO L273 TraceCheckUtils]: 66: Hoare triple {18968#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18968#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:20,142 INFO L273 TraceCheckUtils]: 67: Hoare triple {18968#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18969#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:20,143 INFO L273 TraceCheckUtils]: 68: Hoare triple {18969#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18969#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:20,143 INFO L273 TraceCheckUtils]: 69: Hoare triple {18969#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18969#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:20,144 INFO L273 TraceCheckUtils]: 70: Hoare triple {18969#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18970#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:20,145 INFO L273 TraceCheckUtils]: 71: Hoare triple {18970#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18970#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:20,145 INFO L273 TraceCheckUtils]: 72: Hoare triple {18970#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18970#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:20,146 INFO L273 TraceCheckUtils]: 73: Hoare triple {18970#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18971#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:20,146 INFO L273 TraceCheckUtils]: 74: Hoare triple {18971#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18971#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:20,147 INFO L273 TraceCheckUtils]: 75: Hoare triple {18971#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18971#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:20,148 INFO L273 TraceCheckUtils]: 76: Hoare triple {18971#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18972#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:20,148 INFO L273 TraceCheckUtils]: 77: Hoare triple {18972#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18972#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:20,149 INFO L273 TraceCheckUtils]: 78: Hoare triple {18972#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18972#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:20,149 INFO L273 TraceCheckUtils]: 79: Hoare triple {18972#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18973#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:20,150 INFO L273 TraceCheckUtils]: 80: Hoare triple {18973#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18973#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:20,150 INFO L273 TraceCheckUtils]: 81: Hoare triple {18973#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18973#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:20,151 INFO L273 TraceCheckUtils]: 82: Hoare triple {18973#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18974#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:20,152 INFO L273 TraceCheckUtils]: 83: Hoare triple {18974#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18974#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:20,152 INFO L273 TraceCheckUtils]: 84: Hoare triple {18974#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18974#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:20,153 INFO L273 TraceCheckUtils]: 85: Hoare triple {18974#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18975#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:20,153 INFO L273 TraceCheckUtils]: 86: Hoare triple {18975#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18975#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:20,154 INFO L273 TraceCheckUtils]: 87: Hoare triple {18975#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18975#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:20,155 INFO L273 TraceCheckUtils]: 88: Hoare triple {18975#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18976#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:20,155 INFO L273 TraceCheckUtils]: 89: Hoare triple {18976#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18976#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:20,156 INFO L273 TraceCheckUtils]: 90: Hoare triple {18976#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18976#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:20,156 INFO L273 TraceCheckUtils]: 91: Hoare triple {18976#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18977#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:20,157 INFO L273 TraceCheckUtils]: 92: Hoare triple {18977#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18977#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:20,157 INFO L273 TraceCheckUtils]: 93: Hoare triple {18977#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18977#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:20,158 INFO L273 TraceCheckUtils]: 94: Hoare triple {18977#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18978#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:20,159 INFO L273 TraceCheckUtils]: 95: Hoare triple {18978#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {18978#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:20,159 INFO L273 TraceCheckUtils]: 96: Hoare triple {18978#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {18978#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:20,160 INFO L273 TraceCheckUtils]: 97: Hoare triple {18978#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {18979#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:20,161 INFO L273 TraceCheckUtils]: 98: Hoare triple {18979#(<= main_~i~0 32)} assume !(~i~0 < 100000); {18948#false} is VALID [2018-11-23 11:59:20,161 INFO L273 TraceCheckUtils]: 99: Hoare triple {18948#false} havoc ~x~0;~x~0 := 0; {18948#false} is VALID [2018-11-23 11:59:20,161 INFO L273 TraceCheckUtils]: 100: Hoare triple {18948#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {18948#false} is VALID [2018-11-23 11:59:20,161 INFO L256 TraceCheckUtils]: 101: Hoare triple {18948#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {18948#false} is VALID [2018-11-23 11:59:20,161 INFO L273 TraceCheckUtils]: 102: Hoare triple {18948#false} ~cond := #in~cond; {18948#false} is VALID [2018-11-23 11:59:20,161 INFO L273 TraceCheckUtils]: 103: Hoare triple {18948#false} assume 0 == ~cond; {18948#false} is VALID [2018-11-23 11:59:20,162 INFO L273 TraceCheckUtils]: 104: Hoare triple {18948#false} assume !false; {18948#false} is VALID [2018-11-23 11:59:20,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:20,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:20,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33] total 33 [2018-11-23 11:59:20,190 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 105 [2018-11-23 11:59:20,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:20,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2018-11-23 11:59:20,292 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:20,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-11-23 11:59:20,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-11-23 11:59:20,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:59:20,293 INFO L87 Difference]: Start difference. First operand 146 states and 211 transitions. Second operand 33 states. [2018-11-23 11:59:21,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:21,524 INFO L93 Difference]: Finished difference Result 170 states and 243 transitions. [2018-11-23 11:59:21,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-11-23 11:59:21,524 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 105 [2018-11-23 11:59:21,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:59:21,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 243 transitions. [2018-11-23 11:59:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-23 11:59:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 243 transitions. [2018-11-23 11:59:21,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states and 243 transitions. [2018-11-23 11:59:21,756 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:21,760 INFO L225 Difference]: With dead ends: 170 [2018-11-23 11:59:21,760 INFO L226 Difference]: Without dead ends: 153 [2018-11-23 11:59:21,761 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-11-23 11:59:21,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-11-23 11:59:22,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 150. [2018-11-23 11:59:22,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:22,131 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand 150 states. [2018-11-23 11:59:22,131 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand 150 states. [2018-11-23 11:59:22,131 INFO L87 Difference]: Start difference. First operand 153 states. Second operand 150 states. [2018-11-23 11:59:22,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:22,135 INFO L93 Difference]: Finished difference Result 153 states and 222 transitions. [2018-11-23 11:59:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 222 transitions. [2018-11-23 11:59:22,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:22,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:22,136 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand 153 states. [2018-11-23 11:59:22,136 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 153 states. [2018-11-23 11:59:22,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:22,139 INFO L93 Difference]: Finished difference Result 153 states and 222 transitions. [2018-11-23 11:59:22,139 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 222 transitions. [2018-11-23 11:59:22,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:22,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:22,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:22,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:22,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-11-23 11:59:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 217 transitions. [2018-11-23 11:59:22,142 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 217 transitions. Word has length 105 [2018-11-23 11:59:22,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:22,143 INFO L480 AbstractCegarLoop]: Abstraction has 150 states and 217 transitions. [2018-11-23 11:59:22,143 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-11-23 11:59:22,143 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 217 transitions. [2018-11-23 11:59:22,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-11-23 11:59:22,144 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:22,144 INFO L402 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:22,144 INFO L423 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:22,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:22,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1112178337, now seen corresponding path program 31 times [2018-11-23 11:59:22,145 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:22,145 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:22,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:22,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:22,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:22,753 INFO L256 TraceCheckUtils]: 0: Hoare triple {20007#true} call ULTIMATE.init(); {20007#true} is VALID [2018-11-23 11:59:22,753 INFO L273 TraceCheckUtils]: 1: Hoare triple {20007#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20007#true} is VALID [2018-11-23 11:59:22,753 INFO L273 TraceCheckUtils]: 2: Hoare triple {20007#true} assume true; {20007#true} is VALID [2018-11-23 11:59:22,753 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20007#true} {20007#true} #88#return; {20007#true} is VALID [2018-11-23 11:59:22,754 INFO L256 TraceCheckUtils]: 4: Hoare triple {20007#true} call #t~ret13 := main(); {20007#true} is VALID [2018-11-23 11:59:22,754 INFO L273 TraceCheckUtils]: 5: Hoare triple {20007#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {20007#true} is VALID [2018-11-23 11:59:22,754 INFO L273 TraceCheckUtils]: 6: Hoare triple {20007#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {20007#true} is VALID [2018-11-23 11:59:22,754 INFO L273 TraceCheckUtils]: 7: Hoare triple {20007#true} ~i~0 := 2; {20009#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:22,755 INFO L273 TraceCheckUtils]: 8: Hoare triple {20009#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20009#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:22,755 INFO L273 TraceCheckUtils]: 9: Hoare triple {20009#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20009#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:22,756 INFO L273 TraceCheckUtils]: 10: Hoare triple {20009#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20010#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:22,757 INFO L273 TraceCheckUtils]: 11: Hoare triple {20010#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20010#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:22,757 INFO L273 TraceCheckUtils]: 12: Hoare triple {20010#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20010#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:22,758 INFO L273 TraceCheckUtils]: 13: Hoare triple {20010#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20011#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:22,758 INFO L273 TraceCheckUtils]: 14: Hoare triple {20011#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20011#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:22,759 INFO L273 TraceCheckUtils]: 15: Hoare triple {20011#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20011#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:22,760 INFO L273 TraceCheckUtils]: 16: Hoare triple {20011#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20012#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:22,760 INFO L273 TraceCheckUtils]: 17: Hoare triple {20012#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20012#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:22,761 INFO L273 TraceCheckUtils]: 18: Hoare triple {20012#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20012#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:22,761 INFO L273 TraceCheckUtils]: 19: Hoare triple {20012#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20013#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:22,762 INFO L273 TraceCheckUtils]: 20: Hoare triple {20013#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20013#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:22,762 INFO L273 TraceCheckUtils]: 21: Hoare triple {20013#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20013#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:22,763 INFO L273 TraceCheckUtils]: 22: Hoare triple {20013#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20014#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:22,764 INFO L273 TraceCheckUtils]: 23: Hoare triple {20014#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20014#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:22,764 INFO L273 TraceCheckUtils]: 24: Hoare triple {20014#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20014#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:22,765 INFO L273 TraceCheckUtils]: 25: Hoare triple {20014#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20015#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:22,765 INFO L273 TraceCheckUtils]: 26: Hoare triple {20015#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20015#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:22,766 INFO L273 TraceCheckUtils]: 27: Hoare triple {20015#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20015#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:22,767 INFO L273 TraceCheckUtils]: 28: Hoare triple {20015#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20016#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:22,767 INFO L273 TraceCheckUtils]: 29: Hoare triple {20016#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20016#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:22,768 INFO L273 TraceCheckUtils]: 30: Hoare triple {20016#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20016#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:22,768 INFO L273 TraceCheckUtils]: 31: Hoare triple {20016#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20017#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:22,769 INFO L273 TraceCheckUtils]: 32: Hoare triple {20017#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20017#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:22,769 INFO L273 TraceCheckUtils]: 33: Hoare triple {20017#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20017#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:22,770 INFO L273 TraceCheckUtils]: 34: Hoare triple {20017#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20018#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:22,771 INFO L273 TraceCheckUtils]: 35: Hoare triple {20018#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20018#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:22,771 INFO L273 TraceCheckUtils]: 36: Hoare triple {20018#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20018#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:22,772 INFO L273 TraceCheckUtils]: 37: Hoare triple {20018#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20019#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:22,772 INFO L273 TraceCheckUtils]: 38: Hoare triple {20019#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20019#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:22,773 INFO L273 TraceCheckUtils]: 39: Hoare triple {20019#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20019#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:22,774 INFO L273 TraceCheckUtils]: 40: Hoare triple {20019#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20020#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:22,774 INFO L273 TraceCheckUtils]: 41: Hoare triple {20020#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20020#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:22,775 INFO L273 TraceCheckUtils]: 42: Hoare triple {20020#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20020#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:22,775 INFO L273 TraceCheckUtils]: 43: Hoare triple {20020#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20021#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:22,776 INFO L273 TraceCheckUtils]: 44: Hoare triple {20021#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20021#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:22,776 INFO L273 TraceCheckUtils]: 45: Hoare triple {20021#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20021#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:22,777 INFO L273 TraceCheckUtils]: 46: Hoare triple {20021#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20022#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:22,778 INFO L273 TraceCheckUtils]: 47: Hoare triple {20022#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20022#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:22,778 INFO L273 TraceCheckUtils]: 48: Hoare triple {20022#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20022#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:22,779 INFO L273 TraceCheckUtils]: 49: Hoare triple {20022#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20023#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:22,779 INFO L273 TraceCheckUtils]: 50: Hoare triple {20023#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20023#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:22,780 INFO L273 TraceCheckUtils]: 51: Hoare triple {20023#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20023#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:22,780 INFO L273 TraceCheckUtils]: 52: Hoare triple {20023#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20024#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:22,781 INFO L273 TraceCheckUtils]: 53: Hoare triple {20024#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20024#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:22,782 INFO L273 TraceCheckUtils]: 54: Hoare triple {20024#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20024#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:22,782 INFO L273 TraceCheckUtils]: 55: Hoare triple {20024#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20025#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:22,783 INFO L273 TraceCheckUtils]: 56: Hoare triple {20025#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20025#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:22,783 INFO L273 TraceCheckUtils]: 57: Hoare triple {20025#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20025#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:22,784 INFO L273 TraceCheckUtils]: 58: Hoare triple {20025#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20026#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:22,785 INFO L273 TraceCheckUtils]: 59: Hoare triple {20026#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20026#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:22,785 INFO L273 TraceCheckUtils]: 60: Hoare triple {20026#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20026#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:22,786 INFO L273 TraceCheckUtils]: 61: Hoare triple {20026#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20027#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:22,786 INFO L273 TraceCheckUtils]: 62: Hoare triple {20027#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20027#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:22,787 INFO L273 TraceCheckUtils]: 63: Hoare triple {20027#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20027#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:22,788 INFO L273 TraceCheckUtils]: 64: Hoare triple {20027#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20028#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:22,788 INFO L273 TraceCheckUtils]: 65: Hoare triple {20028#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20028#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:22,789 INFO L273 TraceCheckUtils]: 66: Hoare triple {20028#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20028#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:22,789 INFO L273 TraceCheckUtils]: 67: Hoare triple {20028#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20029#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:22,790 INFO L273 TraceCheckUtils]: 68: Hoare triple {20029#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20029#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:22,790 INFO L273 TraceCheckUtils]: 69: Hoare triple {20029#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20029#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:22,791 INFO L273 TraceCheckUtils]: 70: Hoare triple {20029#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20030#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:22,792 INFO L273 TraceCheckUtils]: 71: Hoare triple {20030#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20030#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:22,792 INFO L273 TraceCheckUtils]: 72: Hoare triple {20030#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20030#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:22,793 INFO L273 TraceCheckUtils]: 73: Hoare triple {20030#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20031#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:22,793 INFO L273 TraceCheckUtils]: 74: Hoare triple {20031#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20031#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:22,794 INFO L273 TraceCheckUtils]: 75: Hoare triple {20031#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20031#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:22,795 INFO L273 TraceCheckUtils]: 76: Hoare triple {20031#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20032#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:22,795 INFO L273 TraceCheckUtils]: 77: Hoare triple {20032#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20032#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:22,796 INFO L273 TraceCheckUtils]: 78: Hoare triple {20032#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20032#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:22,796 INFO L273 TraceCheckUtils]: 79: Hoare triple {20032#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20033#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:22,797 INFO L273 TraceCheckUtils]: 80: Hoare triple {20033#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20033#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:22,797 INFO L273 TraceCheckUtils]: 81: Hoare triple {20033#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20033#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:22,798 INFO L273 TraceCheckUtils]: 82: Hoare triple {20033#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20034#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:22,799 INFO L273 TraceCheckUtils]: 83: Hoare triple {20034#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20034#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:22,799 INFO L273 TraceCheckUtils]: 84: Hoare triple {20034#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20034#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:22,800 INFO L273 TraceCheckUtils]: 85: Hoare triple {20034#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20035#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:22,800 INFO L273 TraceCheckUtils]: 86: Hoare triple {20035#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20035#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:22,801 INFO L273 TraceCheckUtils]: 87: Hoare triple {20035#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20035#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:22,801 INFO L273 TraceCheckUtils]: 88: Hoare triple {20035#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20036#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:22,802 INFO L273 TraceCheckUtils]: 89: Hoare triple {20036#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20036#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:22,802 INFO L273 TraceCheckUtils]: 90: Hoare triple {20036#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20036#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:22,803 INFO L273 TraceCheckUtils]: 91: Hoare triple {20036#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20037#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:22,804 INFO L273 TraceCheckUtils]: 92: Hoare triple {20037#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20037#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:22,804 INFO L273 TraceCheckUtils]: 93: Hoare triple {20037#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20037#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:22,805 INFO L273 TraceCheckUtils]: 94: Hoare triple {20037#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20038#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:22,805 INFO L273 TraceCheckUtils]: 95: Hoare triple {20038#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20038#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:22,806 INFO L273 TraceCheckUtils]: 96: Hoare triple {20038#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20038#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:22,807 INFO L273 TraceCheckUtils]: 97: Hoare triple {20038#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20039#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:22,807 INFO L273 TraceCheckUtils]: 98: Hoare triple {20039#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20039#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:22,808 INFO L273 TraceCheckUtils]: 99: Hoare triple {20039#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20039#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:22,808 INFO L273 TraceCheckUtils]: 100: Hoare triple {20039#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20040#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:22,809 INFO L273 TraceCheckUtils]: 101: Hoare triple {20040#(<= main_~i~0 33)} assume !(~i~0 < 100000); {20008#false} is VALID [2018-11-23 11:59:22,809 INFO L273 TraceCheckUtils]: 102: Hoare triple {20008#false} havoc ~x~0;~x~0 := 0; {20008#false} is VALID [2018-11-23 11:59:22,810 INFO L273 TraceCheckUtils]: 103: Hoare triple {20008#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {20008#false} is VALID [2018-11-23 11:59:22,810 INFO L256 TraceCheckUtils]: 104: Hoare triple {20008#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {20008#false} is VALID [2018-11-23 11:59:22,810 INFO L273 TraceCheckUtils]: 105: Hoare triple {20008#false} ~cond := #in~cond; {20008#false} is VALID [2018-11-23 11:59:22,810 INFO L273 TraceCheckUtils]: 106: Hoare triple {20008#false} assume 0 == ~cond; {20008#false} is VALID [2018-11-23 11:59:22,810 INFO L273 TraceCheckUtils]: 107: Hoare triple {20008#false} assume !false; {20008#false} is VALID [2018-11-23 11:59:22,819 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:22,819 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:22,819 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-23 11:59:22,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:22,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:22,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:22,916 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:23,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {20007#true} call ULTIMATE.init(); {20007#true} is VALID [2018-11-23 11:59:23,155 INFO L273 TraceCheckUtils]: 1: Hoare triple {20007#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {20007#true} is VALID [2018-11-23 11:59:23,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {20007#true} assume true; {20007#true} is VALID [2018-11-23 11:59:23,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {20007#true} {20007#true} #88#return; {20007#true} is VALID [2018-11-23 11:59:23,156 INFO L256 TraceCheckUtils]: 4: Hoare triple {20007#true} call #t~ret13 := main(); {20007#true} is VALID [2018-11-23 11:59:23,156 INFO L273 TraceCheckUtils]: 5: Hoare triple {20007#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {20007#true} is VALID [2018-11-23 11:59:23,156 INFO L273 TraceCheckUtils]: 6: Hoare triple {20007#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {20007#true} is VALID [2018-11-23 11:59:23,157 INFO L273 TraceCheckUtils]: 7: Hoare triple {20007#true} ~i~0 := 2; {20009#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:23,157 INFO L273 TraceCheckUtils]: 8: Hoare triple {20009#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20009#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:23,157 INFO L273 TraceCheckUtils]: 9: Hoare triple {20009#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20009#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:23,158 INFO L273 TraceCheckUtils]: 10: Hoare triple {20009#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20010#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:23,158 INFO L273 TraceCheckUtils]: 11: Hoare triple {20010#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20010#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:23,158 INFO L273 TraceCheckUtils]: 12: Hoare triple {20010#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20010#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:23,159 INFO L273 TraceCheckUtils]: 13: Hoare triple {20010#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20011#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:23,159 INFO L273 TraceCheckUtils]: 14: Hoare triple {20011#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20011#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:23,160 INFO L273 TraceCheckUtils]: 15: Hoare triple {20011#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20011#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:23,160 INFO L273 TraceCheckUtils]: 16: Hoare triple {20011#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20012#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:23,160 INFO L273 TraceCheckUtils]: 17: Hoare triple {20012#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20012#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:23,161 INFO L273 TraceCheckUtils]: 18: Hoare triple {20012#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20012#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:23,161 INFO L273 TraceCheckUtils]: 19: Hoare triple {20012#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20013#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:23,161 INFO L273 TraceCheckUtils]: 20: Hoare triple {20013#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20013#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:23,162 INFO L273 TraceCheckUtils]: 21: Hoare triple {20013#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20013#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:23,162 INFO L273 TraceCheckUtils]: 22: Hoare triple {20013#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20014#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:23,163 INFO L273 TraceCheckUtils]: 23: Hoare triple {20014#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20014#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:23,163 INFO L273 TraceCheckUtils]: 24: Hoare triple {20014#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20014#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:23,164 INFO L273 TraceCheckUtils]: 25: Hoare triple {20014#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20015#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:23,165 INFO L273 TraceCheckUtils]: 26: Hoare triple {20015#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20015#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:23,165 INFO L273 TraceCheckUtils]: 27: Hoare triple {20015#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20015#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:23,166 INFO L273 TraceCheckUtils]: 28: Hoare triple {20015#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20016#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:23,166 INFO L273 TraceCheckUtils]: 29: Hoare triple {20016#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20016#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:23,167 INFO L273 TraceCheckUtils]: 30: Hoare triple {20016#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20016#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:23,168 INFO L273 TraceCheckUtils]: 31: Hoare triple {20016#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20017#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:23,168 INFO L273 TraceCheckUtils]: 32: Hoare triple {20017#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20017#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:23,169 INFO L273 TraceCheckUtils]: 33: Hoare triple {20017#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20017#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:23,169 INFO L273 TraceCheckUtils]: 34: Hoare triple {20017#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20018#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:23,170 INFO L273 TraceCheckUtils]: 35: Hoare triple {20018#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20018#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:23,170 INFO L273 TraceCheckUtils]: 36: Hoare triple {20018#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20018#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:23,171 INFO L273 TraceCheckUtils]: 37: Hoare triple {20018#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20019#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:23,172 INFO L273 TraceCheckUtils]: 38: Hoare triple {20019#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20019#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:23,172 INFO L273 TraceCheckUtils]: 39: Hoare triple {20019#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20019#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:23,173 INFO L273 TraceCheckUtils]: 40: Hoare triple {20019#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20020#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:23,173 INFO L273 TraceCheckUtils]: 41: Hoare triple {20020#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20020#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:23,174 INFO L273 TraceCheckUtils]: 42: Hoare triple {20020#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20020#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:23,175 INFO L273 TraceCheckUtils]: 43: Hoare triple {20020#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20021#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:23,175 INFO L273 TraceCheckUtils]: 44: Hoare triple {20021#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20021#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:23,176 INFO L273 TraceCheckUtils]: 45: Hoare triple {20021#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20021#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:23,176 INFO L273 TraceCheckUtils]: 46: Hoare triple {20021#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20022#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:23,177 INFO L273 TraceCheckUtils]: 47: Hoare triple {20022#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20022#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:23,177 INFO L273 TraceCheckUtils]: 48: Hoare triple {20022#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20022#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:23,178 INFO L273 TraceCheckUtils]: 49: Hoare triple {20022#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20023#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:23,179 INFO L273 TraceCheckUtils]: 50: Hoare triple {20023#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20023#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:23,179 INFO L273 TraceCheckUtils]: 51: Hoare triple {20023#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20023#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:23,180 INFO L273 TraceCheckUtils]: 52: Hoare triple {20023#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20024#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:23,180 INFO L273 TraceCheckUtils]: 53: Hoare triple {20024#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20024#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:23,181 INFO L273 TraceCheckUtils]: 54: Hoare triple {20024#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20024#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:23,182 INFO L273 TraceCheckUtils]: 55: Hoare triple {20024#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20025#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:23,182 INFO L273 TraceCheckUtils]: 56: Hoare triple {20025#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20025#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:23,203 INFO L273 TraceCheckUtils]: 57: Hoare triple {20025#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20025#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:23,217 INFO L273 TraceCheckUtils]: 58: Hoare triple {20025#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20026#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:23,225 INFO L273 TraceCheckUtils]: 59: Hoare triple {20026#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20026#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:23,228 INFO L273 TraceCheckUtils]: 60: Hoare triple {20026#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20026#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:23,229 INFO L273 TraceCheckUtils]: 61: Hoare triple {20026#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20027#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:23,233 INFO L273 TraceCheckUtils]: 62: Hoare triple {20027#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20027#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:23,234 INFO L273 TraceCheckUtils]: 63: Hoare triple {20027#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20027#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:23,235 INFO L273 TraceCheckUtils]: 64: Hoare triple {20027#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20028#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:23,236 INFO L273 TraceCheckUtils]: 65: Hoare triple {20028#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20028#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:23,237 INFO L273 TraceCheckUtils]: 66: Hoare triple {20028#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20028#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:23,239 INFO L273 TraceCheckUtils]: 67: Hoare triple {20028#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20029#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:23,239 INFO L273 TraceCheckUtils]: 68: Hoare triple {20029#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20029#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:23,241 INFO L273 TraceCheckUtils]: 69: Hoare triple {20029#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20029#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:23,245 INFO L273 TraceCheckUtils]: 70: Hoare triple {20029#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20030#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:23,245 INFO L273 TraceCheckUtils]: 71: Hoare triple {20030#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20030#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:23,248 INFO L273 TraceCheckUtils]: 72: Hoare triple {20030#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20030#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:23,248 INFO L273 TraceCheckUtils]: 73: Hoare triple {20030#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20031#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:23,251 INFO L273 TraceCheckUtils]: 74: Hoare triple {20031#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20031#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:23,251 INFO L273 TraceCheckUtils]: 75: Hoare triple {20031#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20031#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:23,253 INFO L273 TraceCheckUtils]: 76: Hoare triple {20031#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20032#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:23,253 INFO L273 TraceCheckUtils]: 77: Hoare triple {20032#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20032#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:23,256 INFO L273 TraceCheckUtils]: 78: Hoare triple {20032#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20032#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:23,256 INFO L273 TraceCheckUtils]: 79: Hoare triple {20032#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20033#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:23,258 INFO L273 TraceCheckUtils]: 80: Hoare triple {20033#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20033#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:23,258 INFO L273 TraceCheckUtils]: 81: Hoare triple {20033#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20033#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:23,260 INFO L273 TraceCheckUtils]: 82: Hoare triple {20033#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20034#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:23,260 INFO L273 TraceCheckUtils]: 83: Hoare triple {20034#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20034#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:23,262 INFO L273 TraceCheckUtils]: 84: Hoare triple {20034#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20034#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:23,262 INFO L273 TraceCheckUtils]: 85: Hoare triple {20034#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20035#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:23,264 INFO L273 TraceCheckUtils]: 86: Hoare triple {20035#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20035#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:23,264 INFO L273 TraceCheckUtils]: 87: Hoare triple {20035#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20035#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:23,266 INFO L273 TraceCheckUtils]: 88: Hoare triple {20035#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20036#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:23,266 INFO L273 TraceCheckUtils]: 89: Hoare triple {20036#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20036#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:23,268 INFO L273 TraceCheckUtils]: 90: Hoare triple {20036#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20036#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:23,268 INFO L273 TraceCheckUtils]: 91: Hoare triple {20036#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20037#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:23,270 INFO L273 TraceCheckUtils]: 92: Hoare triple {20037#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20037#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:23,270 INFO L273 TraceCheckUtils]: 93: Hoare triple {20037#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20037#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:23,272 INFO L273 TraceCheckUtils]: 94: Hoare triple {20037#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20038#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:23,272 INFO L273 TraceCheckUtils]: 95: Hoare triple {20038#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20038#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:23,275 INFO L273 TraceCheckUtils]: 96: Hoare triple {20038#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20038#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:23,277 INFO L273 TraceCheckUtils]: 97: Hoare triple {20038#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20039#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:23,277 INFO L273 TraceCheckUtils]: 98: Hoare triple {20039#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {20039#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:23,279 INFO L273 TraceCheckUtils]: 99: Hoare triple {20039#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {20039#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:23,282 INFO L273 TraceCheckUtils]: 100: Hoare triple {20039#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {20040#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:23,284 INFO L273 TraceCheckUtils]: 101: Hoare triple {20040#(<= main_~i~0 33)} assume !(~i~0 < 100000); {20008#false} is VALID [2018-11-23 11:59:23,284 INFO L273 TraceCheckUtils]: 102: Hoare triple {20008#false} havoc ~x~0;~x~0 := 0; {20008#false} is VALID [2018-11-23 11:59:23,284 INFO L273 TraceCheckUtils]: 103: Hoare triple {20008#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {20008#false} is VALID [2018-11-23 11:59:23,284 INFO L256 TraceCheckUtils]: 104: Hoare triple {20008#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {20008#false} is VALID [2018-11-23 11:59:23,284 INFO L273 TraceCheckUtils]: 105: Hoare triple {20008#false} ~cond := #in~cond; {20008#false} is VALID [2018-11-23 11:59:23,284 INFO L273 TraceCheckUtils]: 106: Hoare triple {20008#false} assume 0 == ~cond; {20008#false} is VALID [2018-11-23 11:59:23,284 INFO L273 TraceCheckUtils]: 107: Hoare triple {20008#false} assume !false; {20008#false} is VALID [2018-11-23 11:59:23,292 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:23,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:23,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 34 [2018-11-23 11:59:23,312 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2018-11-23 11:59:23,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:23,312 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states. [2018-11-23 11:59:23,452 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-23 11:59:23,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-11-23 11:59:23,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-11-23 11:59:23,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:59:23,454 INFO L87 Difference]: Start difference. First operand 150 states and 217 transitions. Second operand 34 states. [2018-11-23 11:59:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,287 INFO L93 Difference]: Finished difference Result 174 states and 249 transitions. [2018-11-23 11:59:24,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-11-23 11:59:24,287 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 108 [2018-11-23 11:59:24,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:59:24,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 249 transitions. [2018-11-23 11:59:24,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 11:59:24,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 249 transitions. [2018-11-23 11:59:24,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 34 states and 249 transitions. [2018-11-23 11:59:24,544 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:24,547 INFO L225 Difference]: With dead ends: 174 [2018-11-23 11:59:24,547 INFO L226 Difference]: Without dead ends: 157 [2018-11-23 11:59:24,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 11:59:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-11-23 11:59:24,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2018-11-23 11:59:24,577 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:24,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand 154 states. [2018-11-23 11:59:24,577 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand 154 states. [2018-11-23 11:59:24,577 INFO L87 Difference]: Start difference. First operand 157 states. Second operand 154 states. [2018-11-23 11:59:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,580 INFO L93 Difference]: Finished difference Result 157 states and 228 transitions. [2018-11-23 11:59:24,580 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 228 transitions. [2018-11-23 11:59:24,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:24,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:24,581 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand 157 states. [2018-11-23 11:59:24,581 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 157 states. [2018-11-23 11:59:24,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:24,583 INFO L93 Difference]: Finished difference Result 157 states and 228 transitions. [2018-11-23 11:59:24,583 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 228 transitions. [2018-11-23 11:59:24,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:24,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:24,584 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:24,584 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:24,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-11-23 11:59:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 223 transitions. [2018-11-23 11:59:24,586 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 223 transitions. Word has length 108 [2018-11-23 11:59:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:24,586 INFO L480 AbstractCegarLoop]: Abstraction has 154 states and 223 transitions. [2018-11-23 11:59:24,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-11-23 11:59:24,586 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 223 transitions. [2018-11-23 11:59:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-11-23 11:59:24,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:24,587 INFO L402 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:24,587 INFO L423 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:24,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:24,588 INFO L82 PathProgramCache]: Analyzing trace with hash -2118069156, now seen corresponding path program 32 times [2018-11-23 11:59:24,588 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:24,588 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:24,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:24,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:24,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:24,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:25,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {21095#true} call ULTIMATE.init(); {21095#true} is VALID [2018-11-23 11:59:25,388 INFO L273 TraceCheckUtils]: 1: Hoare triple {21095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21095#true} is VALID [2018-11-23 11:59:25,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {21095#true} assume true; {21095#true} is VALID [2018-11-23 11:59:25,389 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21095#true} {21095#true} #88#return; {21095#true} is VALID [2018-11-23 11:59:25,389 INFO L256 TraceCheckUtils]: 4: Hoare triple {21095#true} call #t~ret13 := main(); {21095#true} is VALID [2018-11-23 11:59:25,389 INFO L273 TraceCheckUtils]: 5: Hoare triple {21095#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {21095#true} is VALID [2018-11-23 11:59:25,389 INFO L273 TraceCheckUtils]: 6: Hoare triple {21095#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {21095#true} is VALID [2018-11-23 11:59:25,390 INFO L273 TraceCheckUtils]: 7: Hoare triple {21095#true} ~i~0 := 2; {21097#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,391 INFO L273 TraceCheckUtils]: 8: Hoare triple {21097#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21097#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,391 INFO L273 TraceCheckUtils]: 9: Hoare triple {21097#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21097#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,391 INFO L273 TraceCheckUtils]: 10: Hoare triple {21097#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21098#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,392 INFO L273 TraceCheckUtils]: 11: Hoare triple {21098#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21098#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,392 INFO L273 TraceCheckUtils]: 12: Hoare triple {21098#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21098#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,392 INFO L273 TraceCheckUtils]: 13: Hoare triple {21098#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21099#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,393 INFO L273 TraceCheckUtils]: 14: Hoare triple {21099#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21099#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,393 INFO L273 TraceCheckUtils]: 15: Hoare triple {21099#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21099#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,394 INFO L273 TraceCheckUtils]: 16: Hoare triple {21099#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21100#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,394 INFO L273 TraceCheckUtils]: 17: Hoare triple {21100#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21100#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,395 INFO L273 TraceCheckUtils]: 18: Hoare triple {21100#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21100#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,396 INFO L273 TraceCheckUtils]: 19: Hoare triple {21100#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21101#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,396 INFO L273 TraceCheckUtils]: 20: Hoare triple {21101#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21101#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,397 INFO L273 TraceCheckUtils]: 21: Hoare triple {21101#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21101#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,397 INFO L273 TraceCheckUtils]: 22: Hoare triple {21101#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21102#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,398 INFO L273 TraceCheckUtils]: 23: Hoare triple {21102#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21102#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,398 INFO L273 TraceCheckUtils]: 24: Hoare triple {21102#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21102#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,399 INFO L273 TraceCheckUtils]: 25: Hoare triple {21102#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21103#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,400 INFO L273 TraceCheckUtils]: 26: Hoare triple {21103#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21103#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,400 INFO L273 TraceCheckUtils]: 27: Hoare triple {21103#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21103#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,401 INFO L273 TraceCheckUtils]: 28: Hoare triple {21103#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21104#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,401 INFO L273 TraceCheckUtils]: 29: Hoare triple {21104#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21104#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,402 INFO L273 TraceCheckUtils]: 30: Hoare triple {21104#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21104#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,403 INFO L273 TraceCheckUtils]: 31: Hoare triple {21104#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21105#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,403 INFO L273 TraceCheckUtils]: 32: Hoare triple {21105#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21105#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,404 INFO L273 TraceCheckUtils]: 33: Hoare triple {21105#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21105#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,404 INFO L273 TraceCheckUtils]: 34: Hoare triple {21105#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21106#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,405 INFO L273 TraceCheckUtils]: 35: Hoare triple {21106#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21106#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,405 INFO L273 TraceCheckUtils]: 36: Hoare triple {21106#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21106#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,406 INFO L273 TraceCheckUtils]: 37: Hoare triple {21106#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21107#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,407 INFO L273 TraceCheckUtils]: 38: Hoare triple {21107#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21107#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,407 INFO L273 TraceCheckUtils]: 39: Hoare triple {21107#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21107#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,408 INFO L273 TraceCheckUtils]: 40: Hoare triple {21107#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21108#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,408 INFO L273 TraceCheckUtils]: 41: Hoare triple {21108#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21108#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {21108#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21108#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,409 INFO L273 TraceCheckUtils]: 43: Hoare triple {21108#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21109#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,410 INFO L273 TraceCheckUtils]: 44: Hoare triple {21109#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21109#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,410 INFO L273 TraceCheckUtils]: 45: Hoare triple {21109#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21109#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,411 INFO L273 TraceCheckUtils]: 46: Hoare triple {21109#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21110#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:25,412 INFO L273 TraceCheckUtils]: 47: Hoare triple {21110#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21110#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:25,412 INFO L273 TraceCheckUtils]: 48: Hoare triple {21110#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21110#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:25,413 INFO L273 TraceCheckUtils]: 49: Hoare triple {21110#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21111#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:25,417 INFO L273 TraceCheckUtils]: 50: Hoare triple {21111#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21111#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:25,417 INFO L273 TraceCheckUtils]: 51: Hoare triple {21111#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21111#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:25,418 INFO L273 TraceCheckUtils]: 52: Hoare triple {21111#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21112#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:25,418 INFO L273 TraceCheckUtils]: 53: Hoare triple {21112#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21112#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:25,418 INFO L273 TraceCheckUtils]: 54: Hoare triple {21112#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21112#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:25,419 INFO L273 TraceCheckUtils]: 55: Hoare triple {21112#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21113#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:25,419 INFO L273 TraceCheckUtils]: 56: Hoare triple {21113#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21113#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:25,419 INFO L273 TraceCheckUtils]: 57: Hoare triple {21113#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21113#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:25,420 INFO L273 TraceCheckUtils]: 58: Hoare triple {21113#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21114#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:25,421 INFO L273 TraceCheckUtils]: 59: Hoare triple {21114#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21114#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:25,421 INFO L273 TraceCheckUtils]: 60: Hoare triple {21114#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21114#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:25,422 INFO L273 TraceCheckUtils]: 61: Hoare triple {21114#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21115#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:25,422 INFO L273 TraceCheckUtils]: 62: Hoare triple {21115#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21115#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:25,423 INFO L273 TraceCheckUtils]: 63: Hoare triple {21115#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21115#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:25,423 INFO L273 TraceCheckUtils]: 64: Hoare triple {21115#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21116#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:25,424 INFO L273 TraceCheckUtils]: 65: Hoare triple {21116#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21116#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:25,424 INFO L273 TraceCheckUtils]: 66: Hoare triple {21116#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21116#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:25,425 INFO L273 TraceCheckUtils]: 67: Hoare triple {21116#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21117#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:25,426 INFO L273 TraceCheckUtils]: 68: Hoare triple {21117#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21117#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:25,426 INFO L273 TraceCheckUtils]: 69: Hoare triple {21117#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21117#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:25,427 INFO L273 TraceCheckUtils]: 70: Hoare triple {21117#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21118#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:25,427 INFO L273 TraceCheckUtils]: 71: Hoare triple {21118#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21118#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:25,428 INFO L273 TraceCheckUtils]: 72: Hoare triple {21118#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21118#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:25,429 INFO L273 TraceCheckUtils]: 73: Hoare triple {21118#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21119#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:25,429 INFO L273 TraceCheckUtils]: 74: Hoare triple {21119#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21119#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:25,430 INFO L273 TraceCheckUtils]: 75: Hoare triple {21119#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21119#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:25,430 INFO L273 TraceCheckUtils]: 76: Hoare triple {21119#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21120#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:25,431 INFO L273 TraceCheckUtils]: 77: Hoare triple {21120#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21120#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:25,431 INFO L273 TraceCheckUtils]: 78: Hoare triple {21120#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21120#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:25,432 INFO L273 TraceCheckUtils]: 79: Hoare triple {21120#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21121#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:25,433 INFO L273 TraceCheckUtils]: 80: Hoare triple {21121#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21121#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:25,433 INFO L273 TraceCheckUtils]: 81: Hoare triple {21121#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21121#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:25,434 INFO L273 TraceCheckUtils]: 82: Hoare triple {21121#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21122#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:25,434 INFO L273 TraceCheckUtils]: 83: Hoare triple {21122#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21122#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:25,435 INFO L273 TraceCheckUtils]: 84: Hoare triple {21122#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21122#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:25,436 INFO L273 TraceCheckUtils]: 85: Hoare triple {21122#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21123#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:25,436 INFO L273 TraceCheckUtils]: 86: Hoare triple {21123#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21123#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:25,437 INFO L273 TraceCheckUtils]: 87: Hoare triple {21123#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21123#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:25,437 INFO L273 TraceCheckUtils]: 88: Hoare triple {21123#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21124#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:25,438 INFO L273 TraceCheckUtils]: 89: Hoare triple {21124#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21124#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:25,438 INFO L273 TraceCheckUtils]: 90: Hoare triple {21124#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21124#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:25,439 INFO L273 TraceCheckUtils]: 91: Hoare triple {21124#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21125#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:25,440 INFO L273 TraceCheckUtils]: 92: Hoare triple {21125#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21125#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:25,440 INFO L273 TraceCheckUtils]: 93: Hoare triple {21125#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21125#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:25,441 INFO L273 TraceCheckUtils]: 94: Hoare triple {21125#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21126#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:25,441 INFO L273 TraceCheckUtils]: 95: Hoare triple {21126#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21126#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:25,442 INFO L273 TraceCheckUtils]: 96: Hoare triple {21126#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21126#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:25,443 INFO L273 TraceCheckUtils]: 97: Hoare triple {21126#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21127#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:25,443 INFO L273 TraceCheckUtils]: 98: Hoare triple {21127#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21127#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:25,444 INFO L273 TraceCheckUtils]: 99: Hoare triple {21127#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21127#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:25,444 INFO L273 TraceCheckUtils]: 100: Hoare triple {21127#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21128#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:25,445 INFO L273 TraceCheckUtils]: 101: Hoare triple {21128#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21128#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:25,445 INFO L273 TraceCheckUtils]: 102: Hoare triple {21128#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21128#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:25,446 INFO L273 TraceCheckUtils]: 103: Hoare triple {21128#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21129#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:25,447 INFO L273 TraceCheckUtils]: 104: Hoare triple {21129#(<= main_~i~0 34)} assume !(~i~0 < 100000); {21096#false} is VALID [2018-11-23 11:59:25,447 INFO L273 TraceCheckUtils]: 105: Hoare triple {21096#false} havoc ~x~0;~x~0 := 0; {21096#false} is VALID [2018-11-23 11:59:25,447 INFO L273 TraceCheckUtils]: 106: Hoare triple {21096#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {21096#false} is VALID [2018-11-23 11:59:25,447 INFO L256 TraceCheckUtils]: 107: Hoare triple {21096#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {21096#false} is VALID [2018-11-23 11:59:25,447 INFO L273 TraceCheckUtils]: 108: Hoare triple {21096#false} ~cond := #in~cond; {21096#false} is VALID [2018-11-23 11:59:25,448 INFO L273 TraceCheckUtils]: 109: Hoare triple {21096#false} assume 0 == ~cond; {21096#false} is VALID [2018-11-23 11:59:25,448 INFO L273 TraceCheckUtils]: 110: Hoare triple {21096#false} assume !false; {21096#false} is VALID [2018-11-23 11:59:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:25,457 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:25,457 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-23 11:59:25,465 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:25,534 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:25,534 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:25,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:25,779 INFO L256 TraceCheckUtils]: 0: Hoare triple {21095#true} call ULTIMATE.init(); {21095#true} is VALID [2018-11-23 11:59:25,779 INFO L273 TraceCheckUtils]: 1: Hoare triple {21095#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {21095#true} is VALID [2018-11-23 11:59:25,779 INFO L273 TraceCheckUtils]: 2: Hoare triple {21095#true} assume true; {21095#true} is VALID [2018-11-23 11:59:25,779 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {21095#true} {21095#true} #88#return; {21095#true} is VALID [2018-11-23 11:59:25,779 INFO L256 TraceCheckUtils]: 4: Hoare triple {21095#true} call #t~ret13 := main(); {21095#true} is VALID [2018-11-23 11:59:25,780 INFO L273 TraceCheckUtils]: 5: Hoare triple {21095#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {21095#true} is VALID [2018-11-23 11:59:25,780 INFO L273 TraceCheckUtils]: 6: Hoare triple {21095#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {21095#true} is VALID [2018-11-23 11:59:25,780 INFO L273 TraceCheckUtils]: 7: Hoare triple {21095#true} ~i~0 := 2; {21097#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,780 INFO L273 TraceCheckUtils]: 8: Hoare triple {21097#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21097#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,781 INFO L273 TraceCheckUtils]: 9: Hoare triple {21097#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21097#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:25,781 INFO L273 TraceCheckUtils]: 10: Hoare triple {21097#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21098#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,781 INFO L273 TraceCheckUtils]: 11: Hoare triple {21098#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21098#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,782 INFO L273 TraceCheckUtils]: 12: Hoare triple {21098#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21098#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:25,782 INFO L273 TraceCheckUtils]: 13: Hoare triple {21098#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21099#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {21099#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21099#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,783 INFO L273 TraceCheckUtils]: 15: Hoare triple {21099#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21099#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:25,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {21099#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21100#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,784 INFO L273 TraceCheckUtils]: 17: Hoare triple {21100#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21100#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,785 INFO L273 TraceCheckUtils]: 18: Hoare triple {21100#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21100#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:25,785 INFO L273 TraceCheckUtils]: 19: Hoare triple {21100#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21101#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,786 INFO L273 TraceCheckUtils]: 20: Hoare triple {21101#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21101#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,786 INFO L273 TraceCheckUtils]: 21: Hoare triple {21101#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21101#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:25,787 INFO L273 TraceCheckUtils]: 22: Hoare triple {21101#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21102#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,788 INFO L273 TraceCheckUtils]: 23: Hoare triple {21102#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21102#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,788 INFO L273 TraceCheckUtils]: 24: Hoare triple {21102#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21102#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:25,789 INFO L273 TraceCheckUtils]: 25: Hoare triple {21102#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21103#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,789 INFO L273 TraceCheckUtils]: 26: Hoare triple {21103#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21103#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,790 INFO L273 TraceCheckUtils]: 27: Hoare triple {21103#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21103#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:25,791 INFO L273 TraceCheckUtils]: 28: Hoare triple {21103#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21104#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,791 INFO L273 TraceCheckUtils]: 29: Hoare triple {21104#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21104#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,792 INFO L273 TraceCheckUtils]: 30: Hoare triple {21104#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21104#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:25,792 INFO L273 TraceCheckUtils]: 31: Hoare triple {21104#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21105#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,793 INFO L273 TraceCheckUtils]: 32: Hoare triple {21105#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21105#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,793 INFO L273 TraceCheckUtils]: 33: Hoare triple {21105#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21105#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:25,794 INFO L273 TraceCheckUtils]: 34: Hoare triple {21105#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21106#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,795 INFO L273 TraceCheckUtils]: 35: Hoare triple {21106#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21106#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,795 INFO L273 TraceCheckUtils]: 36: Hoare triple {21106#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21106#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:25,796 INFO L273 TraceCheckUtils]: 37: Hoare triple {21106#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21107#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,796 INFO L273 TraceCheckUtils]: 38: Hoare triple {21107#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21107#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,797 INFO L273 TraceCheckUtils]: 39: Hoare triple {21107#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21107#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:25,797 INFO L273 TraceCheckUtils]: 40: Hoare triple {21107#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21108#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,798 INFO L273 TraceCheckUtils]: 41: Hoare triple {21108#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21108#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,798 INFO L273 TraceCheckUtils]: 42: Hoare triple {21108#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21108#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:25,799 INFO L273 TraceCheckUtils]: 43: Hoare triple {21108#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21109#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,800 INFO L273 TraceCheckUtils]: 44: Hoare triple {21109#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21109#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,800 INFO L273 TraceCheckUtils]: 45: Hoare triple {21109#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21109#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:25,801 INFO L273 TraceCheckUtils]: 46: Hoare triple {21109#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21110#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:25,801 INFO L273 TraceCheckUtils]: 47: Hoare triple {21110#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21110#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:25,802 INFO L273 TraceCheckUtils]: 48: Hoare triple {21110#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21110#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:25,803 INFO L273 TraceCheckUtils]: 49: Hoare triple {21110#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21111#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:25,803 INFO L273 TraceCheckUtils]: 50: Hoare triple {21111#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21111#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:25,804 INFO L273 TraceCheckUtils]: 51: Hoare triple {21111#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21111#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:25,804 INFO L273 TraceCheckUtils]: 52: Hoare triple {21111#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21112#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:25,805 INFO L273 TraceCheckUtils]: 53: Hoare triple {21112#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21112#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:25,805 INFO L273 TraceCheckUtils]: 54: Hoare triple {21112#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21112#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:25,806 INFO L273 TraceCheckUtils]: 55: Hoare triple {21112#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21113#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:25,807 INFO L273 TraceCheckUtils]: 56: Hoare triple {21113#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21113#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:25,807 INFO L273 TraceCheckUtils]: 57: Hoare triple {21113#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21113#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:25,808 INFO L273 TraceCheckUtils]: 58: Hoare triple {21113#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21114#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:25,808 INFO L273 TraceCheckUtils]: 59: Hoare triple {21114#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21114#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:25,809 INFO L273 TraceCheckUtils]: 60: Hoare triple {21114#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21114#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:25,810 INFO L273 TraceCheckUtils]: 61: Hoare triple {21114#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21115#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:25,810 INFO L273 TraceCheckUtils]: 62: Hoare triple {21115#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21115#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:25,811 INFO L273 TraceCheckUtils]: 63: Hoare triple {21115#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21115#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:25,811 INFO L273 TraceCheckUtils]: 64: Hoare triple {21115#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21116#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:25,812 INFO L273 TraceCheckUtils]: 65: Hoare triple {21116#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21116#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:25,812 INFO L273 TraceCheckUtils]: 66: Hoare triple {21116#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21116#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:25,813 INFO L273 TraceCheckUtils]: 67: Hoare triple {21116#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21117#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:25,813 INFO L273 TraceCheckUtils]: 68: Hoare triple {21117#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21117#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:25,814 INFO L273 TraceCheckUtils]: 69: Hoare triple {21117#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21117#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:25,815 INFO L273 TraceCheckUtils]: 70: Hoare triple {21117#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21118#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:25,815 INFO L273 TraceCheckUtils]: 71: Hoare triple {21118#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21118#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:25,816 INFO L273 TraceCheckUtils]: 72: Hoare triple {21118#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21118#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:25,816 INFO L273 TraceCheckUtils]: 73: Hoare triple {21118#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21119#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:25,817 INFO L273 TraceCheckUtils]: 74: Hoare triple {21119#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21119#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:25,817 INFO L273 TraceCheckUtils]: 75: Hoare triple {21119#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21119#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:25,818 INFO L273 TraceCheckUtils]: 76: Hoare triple {21119#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21120#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:25,819 INFO L273 TraceCheckUtils]: 77: Hoare triple {21120#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21120#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:25,819 INFO L273 TraceCheckUtils]: 78: Hoare triple {21120#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21120#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:25,820 INFO L273 TraceCheckUtils]: 79: Hoare triple {21120#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21121#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:25,820 INFO L273 TraceCheckUtils]: 80: Hoare triple {21121#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21121#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:25,821 INFO L273 TraceCheckUtils]: 81: Hoare triple {21121#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21121#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:25,822 INFO L273 TraceCheckUtils]: 82: Hoare triple {21121#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21122#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:25,842 INFO L273 TraceCheckUtils]: 83: Hoare triple {21122#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21122#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:25,855 INFO L273 TraceCheckUtils]: 84: Hoare triple {21122#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21122#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:25,858 INFO L273 TraceCheckUtils]: 85: Hoare triple {21122#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21123#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:25,858 INFO L273 TraceCheckUtils]: 86: Hoare triple {21123#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21123#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:25,860 INFO L273 TraceCheckUtils]: 87: Hoare triple {21123#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21123#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:25,860 INFO L273 TraceCheckUtils]: 88: Hoare triple {21123#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21124#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:25,862 INFO L273 TraceCheckUtils]: 89: Hoare triple {21124#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21124#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:25,862 INFO L273 TraceCheckUtils]: 90: Hoare triple {21124#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21124#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:25,862 INFO L273 TraceCheckUtils]: 91: Hoare triple {21124#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21125#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:25,863 INFO L273 TraceCheckUtils]: 92: Hoare triple {21125#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21125#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:25,863 INFO L273 TraceCheckUtils]: 93: Hoare triple {21125#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21125#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:25,863 INFO L273 TraceCheckUtils]: 94: Hoare triple {21125#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21126#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:25,864 INFO L273 TraceCheckUtils]: 95: Hoare triple {21126#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21126#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:25,864 INFO L273 TraceCheckUtils]: 96: Hoare triple {21126#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21126#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:25,864 INFO L273 TraceCheckUtils]: 97: Hoare triple {21126#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21127#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:25,865 INFO L273 TraceCheckUtils]: 98: Hoare triple {21127#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21127#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:25,865 INFO L273 TraceCheckUtils]: 99: Hoare triple {21127#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21127#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:25,865 INFO L273 TraceCheckUtils]: 100: Hoare triple {21127#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21128#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:25,866 INFO L273 TraceCheckUtils]: 101: Hoare triple {21128#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {21128#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:25,866 INFO L273 TraceCheckUtils]: 102: Hoare triple {21128#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {21128#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:25,867 INFO L273 TraceCheckUtils]: 103: Hoare triple {21128#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {21129#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:25,868 INFO L273 TraceCheckUtils]: 104: Hoare triple {21129#(<= main_~i~0 34)} assume !(~i~0 < 100000); {21096#false} is VALID [2018-11-23 11:59:25,868 INFO L273 TraceCheckUtils]: 105: Hoare triple {21096#false} havoc ~x~0;~x~0 := 0; {21096#false} is VALID [2018-11-23 11:59:25,868 INFO L273 TraceCheckUtils]: 106: Hoare triple {21096#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {21096#false} is VALID [2018-11-23 11:59:25,868 INFO L256 TraceCheckUtils]: 107: Hoare triple {21096#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {21096#false} is VALID [2018-11-23 11:59:25,869 INFO L273 TraceCheckUtils]: 108: Hoare triple {21096#false} ~cond := #in~cond; {21096#false} is VALID [2018-11-23 11:59:25,869 INFO L273 TraceCheckUtils]: 109: Hoare triple {21096#false} assume 0 == ~cond; {21096#false} is VALID [2018-11-23 11:59:25,869 INFO L273 TraceCheckUtils]: 110: Hoare triple {21096#false} assume !false; {21096#false} is VALID [2018-11-23 11:59:25,878 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:25,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:25,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 35 [2018-11-23 11:59:25,897 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 111 [2018-11-23 11:59:25,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:25,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states. [2018-11-23 11:59:26,037 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:26,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-11-23 11:59:26,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-11-23 11:59:26,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:59:26,039 INFO L87 Difference]: Start difference. First operand 154 states and 223 transitions. Second operand 35 states. [2018-11-23 11:59:26,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:26,795 INFO L93 Difference]: Finished difference Result 178 states and 255 transitions. [2018-11-23 11:59:26,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-11-23 11:59:26,795 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 111 [2018-11-23 11:59:26,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:59:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 255 transitions. [2018-11-23 11:59:26,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 11:59:26,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 255 transitions. [2018-11-23 11:59:26,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 35 states and 255 transitions. [2018-11-23 11:59:27,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:27,044 INFO L225 Difference]: With dead ends: 178 [2018-11-23 11:59:27,044 INFO L226 Difference]: Without dead ends: 161 [2018-11-23 11:59:27,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-11-23 11:59:27,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-11-23 11:59:27,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2018-11-23 11:59:27,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:27,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand 158 states. [2018-11-23 11:59:27,074 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand 158 states. [2018-11-23 11:59:27,075 INFO L87 Difference]: Start difference. First operand 161 states. Second operand 158 states. [2018-11-23 11:59:27,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:27,078 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2018-11-23 11:59:27,078 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2018-11-23 11:59:27,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:27,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:27,078 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 161 states. [2018-11-23 11:59:27,078 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 161 states. [2018-11-23 11:59:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:27,081 INFO L93 Difference]: Finished difference Result 161 states and 234 transitions. [2018-11-23 11:59:27,081 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 234 transitions. [2018-11-23 11:59:27,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:27,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:27,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:27,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:27,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-11-23 11:59:27,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 229 transitions. [2018-11-23 11:59:27,084 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 229 transitions. Word has length 111 [2018-11-23 11:59:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:27,085 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 229 transitions. [2018-11-23 11:59:27,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-11-23 11:59:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 229 transitions. [2018-11-23 11:59:27,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-11-23 11:59:27,085 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:27,086 INFO L402 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:27,086 INFO L423 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:27,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:27,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1383898943, now seen corresponding path program 33 times [2018-11-23 11:59:27,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:27,086 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:27,087 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:27,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:27,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:28,021 INFO L256 TraceCheckUtils]: 0: Hoare triple {22211#true} call ULTIMATE.init(); {22211#true} is VALID [2018-11-23 11:59:28,022 INFO L273 TraceCheckUtils]: 1: Hoare triple {22211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22211#true} is VALID [2018-11-23 11:59:28,022 INFO L273 TraceCheckUtils]: 2: Hoare triple {22211#true} assume true; {22211#true} is VALID [2018-11-23 11:59:28,022 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22211#true} {22211#true} #88#return; {22211#true} is VALID [2018-11-23 11:59:28,022 INFO L256 TraceCheckUtils]: 4: Hoare triple {22211#true} call #t~ret13 := main(); {22211#true} is VALID [2018-11-23 11:59:28,022 INFO L273 TraceCheckUtils]: 5: Hoare triple {22211#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {22211#true} is VALID [2018-11-23 11:59:28,023 INFO L273 TraceCheckUtils]: 6: Hoare triple {22211#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {22211#true} is VALID [2018-11-23 11:59:28,023 INFO L273 TraceCheckUtils]: 7: Hoare triple {22211#true} ~i~0 := 2; {22213#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:28,024 INFO L273 TraceCheckUtils]: 8: Hoare triple {22213#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22213#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:28,024 INFO L273 TraceCheckUtils]: 9: Hoare triple {22213#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22213#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:28,024 INFO L273 TraceCheckUtils]: 10: Hoare triple {22213#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22214#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:28,025 INFO L273 TraceCheckUtils]: 11: Hoare triple {22214#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22214#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:28,025 INFO L273 TraceCheckUtils]: 12: Hoare triple {22214#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22214#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:28,025 INFO L273 TraceCheckUtils]: 13: Hoare triple {22214#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22215#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:28,026 INFO L273 TraceCheckUtils]: 14: Hoare triple {22215#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22215#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:28,026 INFO L273 TraceCheckUtils]: 15: Hoare triple {22215#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22215#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:28,027 INFO L273 TraceCheckUtils]: 16: Hoare triple {22215#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22216#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:28,027 INFO L273 TraceCheckUtils]: 17: Hoare triple {22216#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22216#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:28,028 INFO L273 TraceCheckUtils]: 18: Hoare triple {22216#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22216#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:28,029 INFO L273 TraceCheckUtils]: 19: Hoare triple {22216#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22217#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:28,029 INFO L273 TraceCheckUtils]: 20: Hoare triple {22217#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22217#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:28,030 INFO L273 TraceCheckUtils]: 21: Hoare triple {22217#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22217#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:28,030 INFO L273 TraceCheckUtils]: 22: Hoare triple {22217#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22218#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:28,031 INFO L273 TraceCheckUtils]: 23: Hoare triple {22218#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22218#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:28,031 INFO L273 TraceCheckUtils]: 24: Hoare triple {22218#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22218#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:28,032 INFO L273 TraceCheckUtils]: 25: Hoare triple {22218#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22219#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:28,033 INFO L273 TraceCheckUtils]: 26: Hoare triple {22219#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22219#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:28,033 INFO L273 TraceCheckUtils]: 27: Hoare triple {22219#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22219#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:28,034 INFO L273 TraceCheckUtils]: 28: Hoare triple {22219#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22220#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:28,034 INFO L273 TraceCheckUtils]: 29: Hoare triple {22220#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22220#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:28,035 INFO L273 TraceCheckUtils]: 30: Hoare triple {22220#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22220#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:28,036 INFO L273 TraceCheckUtils]: 31: Hoare triple {22220#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22221#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:28,036 INFO L273 TraceCheckUtils]: 32: Hoare triple {22221#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22221#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:28,037 INFO L273 TraceCheckUtils]: 33: Hoare triple {22221#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22221#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:28,037 INFO L273 TraceCheckUtils]: 34: Hoare triple {22221#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22222#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:28,038 INFO L273 TraceCheckUtils]: 35: Hoare triple {22222#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22222#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:28,038 INFO L273 TraceCheckUtils]: 36: Hoare triple {22222#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22222#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:28,039 INFO L273 TraceCheckUtils]: 37: Hoare triple {22222#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22223#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:28,040 INFO L273 TraceCheckUtils]: 38: Hoare triple {22223#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22223#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:28,040 INFO L273 TraceCheckUtils]: 39: Hoare triple {22223#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22223#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:28,041 INFO L273 TraceCheckUtils]: 40: Hoare triple {22223#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22224#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:28,041 INFO L273 TraceCheckUtils]: 41: Hoare triple {22224#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22224#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:28,042 INFO L273 TraceCheckUtils]: 42: Hoare triple {22224#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22224#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:28,042 INFO L273 TraceCheckUtils]: 43: Hoare triple {22224#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22225#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:28,043 INFO L273 TraceCheckUtils]: 44: Hoare triple {22225#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22225#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:28,043 INFO L273 TraceCheckUtils]: 45: Hoare triple {22225#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22225#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:28,044 INFO L273 TraceCheckUtils]: 46: Hoare triple {22225#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22226#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:28,045 INFO L273 TraceCheckUtils]: 47: Hoare triple {22226#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22226#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:28,045 INFO L273 TraceCheckUtils]: 48: Hoare triple {22226#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22226#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:28,046 INFO L273 TraceCheckUtils]: 49: Hoare triple {22226#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22227#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:28,046 INFO L273 TraceCheckUtils]: 50: Hoare triple {22227#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22227#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:28,047 INFO L273 TraceCheckUtils]: 51: Hoare triple {22227#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22227#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:28,048 INFO L273 TraceCheckUtils]: 52: Hoare triple {22227#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22228#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:28,048 INFO L273 TraceCheckUtils]: 53: Hoare triple {22228#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22228#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:28,049 INFO L273 TraceCheckUtils]: 54: Hoare triple {22228#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22228#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:28,049 INFO L273 TraceCheckUtils]: 55: Hoare triple {22228#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22229#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:28,050 INFO L273 TraceCheckUtils]: 56: Hoare triple {22229#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22229#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:28,050 INFO L273 TraceCheckUtils]: 57: Hoare triple {22229#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22229#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:28,051 INFO L273 TraceCheckUtils]: 58: Hoare triple {22229#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22230#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:28,052 INFO L273 TraceCheckUtils]: 59: Hoare triple {22230#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22230#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:28,052 INFO L273 TraceCheckUtils]: 60: Hoare triple {22230#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22230#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:28,053 INFO L273 TraceCheckUtils]: 61: Hoare triple {22230#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22231#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:28,053 INFO L273 TraceCheckUtils]: 62: Hoare triple {22231#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22231#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:28,054 INFO L273 TraceCheckUtils]: 63: Hoare triple {22231#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22231#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:28,054 INFO L273 TraceCheckUtils]: 64: Hoare triple {22231#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22232#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:28,055 INFO L273 TraceCheckUtils]: 65: Hoare triple {22232#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22232#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:28,055 INFO L273 TraceCheckUtils]: 66: Hoare triple {22232#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22232#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:28,056 INFO L273 TraceCheckUtils]: 67: Hoare triple {22232#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22233#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:28,057 INFO L273 TraceCheckUtils]: 68: Hoare triple {22233#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22233#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:28,057 INFO L273 TraceCheckUtils]: 69: Hoare triple {22233#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22233#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:28,058 INFO L273 TraceCheckUtils]: 70: Hoare triple {22233#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22234#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:28,058 INFO L273 TraceCheckUtils]: 71: Hoare triple {22234#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22234#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:28,059 INFO L273 TraceCheckUtils]: 72: Hoare triple {22234#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22234#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:28,060 INFO L273 TraceCheckUtils]: 73: Hoare triple {22234#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22235#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:28,060 INFO L273 TraceCheckUtils]: 74: Hoare triple {22235#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22235#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:28,061 INFO L273 TraceCheckUtils]: 75: Hoare triple {22235#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22235#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:28,061 INFO L273 TraceCheckUtils]: 76: Hoare triple {22235#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22236#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:28,062 INFO L273 TraceCheckUtils]: 77: Hoare triple {22236#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22236#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:28,062 INFO L273 TraceCheckUtils]: 78: Hoare triple {22236#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22236#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:28,063 INFO L273 TraceCheckUtils]: 79: Hoare triple {22236#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22237#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:28,064 INFO L273 TraceCheckUtils]: 80: Hoare triple {22237#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22237#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:28,064 INFO L273 TraceCheckUtils]: 81: Hoare triple {22237#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22237#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:28,065 INFO L273 TraceCheckUtils]: 82: Hoare triple {22237#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22238#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:28,065 INFO L273 TraceCheckUtils]: 83: Hoare triple {22238#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22238#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:28,066 INFO L273 TraceCheckUtils]: 84: Hoare triple {22238#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22238#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:28,067 INFO L273 TraceCheckUtils]: 85: Hoare triple {22238#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22239#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:28,067 INFO L273 TraceCheckUtils]: 86: Hoare triple {22239#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22239#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:28,068 INFO L273 TraceCheckUtils]: 87: Hoare triple {22239#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22239#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:28,068 INFO L273 TraceCheckUtils]: 88: Hoare triple {22239#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22240#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:28,069 INFO L273 TraceCheckUtils]: 89: Hoare triple {22240#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22240#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:28,069 INFO L273 TraceCheckUtils]: 90: Hoare triple {22240#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22240#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:28,070 INFO L273 TraceCheckUtils]: 91: Hoare triple {22240#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22241#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:28,071 INFO L273 TraceCheckUtils]: 92: Hoare triple {22241#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22241#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:28,071 INFO L273 TraceCheckUtils]: 93: Hoare triple {22241#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22241#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:28,072 INFO L273 TraceCheckUtils]: 94: Hoare triple {22241#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22242#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:28,072 INFO L273 TraceCheckUtils]: 95: Hoare triple {22242#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22242#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:28,073 INFO L273 TraceCheckUtils]: 96: Hoare triple {22242#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22242#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:28,073 INFO L273 TraceCheckUtils]: 97: Hoare triple {22242#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22243#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:28,074 INFO L273 TraceCheckUtils]: 98: Hoare triple {22243#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22243#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:28,074 INFO L273 TraceCheckUtils]: 99: Hoare triple {22243#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22243#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:28,075 INFO L273 TraceCheckUtils]: 100: Hoare triple {22243#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22244#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:28,076 INFO L273 TraceCheckUtils]: 101: Hoare triple {22244#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22244#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:28,076 INFO L273 TraceCheckUtils]: 102: Hoare triple {22244#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22244#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:28,077 INFO L273 TraceCheckUtils]: 103: Hoare triple {22244#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22245#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:28,077 INFO L273 TraceCheckUtils]: 104: Hoare triple {22245#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22245#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:28,078 INFO L273 TraceCheckUtils]: 105: Hoare triple {22245#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22245#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:28,079 INFO L273 TraceCheckUtils]: 106: Hoare triple {22245#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22246#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:28,079 INFO L273 TraceCheckUtils]: 107: Hoare triple {22246#(<= main_~i~0 35)} assume !(~i~0 < 100000); {22212#false} is VALID [2018-11-23 11:59:28,080 INFO L273 TraceCheckUtils]: 108: Hoare triple {22212#false} havoc ~x~0;~x~0 := 0; {22212#false} is VALID [2018-11-23 11:59:28,080 INFO L273 TraceCheckUtils]: 109: Hoare triple {22212#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {22212#false} is VALID [2018-11-23 11:59:28,080 INFO L256 TraceCheckUtils]: 110: Hoare triple {22212#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {22212#false} is VALID [2018-11-23 11:59:28,080 INFO L273 TraceCheckUtils]: 111: Hoare triple {22212#false} ~cond := #in~cond; {22212#false} is VALID [2018-11-23 11:59:28,080 INFO L273 TraceCheckUtils]: 112: Hoare triple {22212#false} assume 0 == ~cond; {22212#false} is VALID [2018-11-23 11:59:28,080 INFO L273 TraceCheckUtils]: 113: Hoare triple {22212#false} assume !false; {22212#false} is VALID [2018-11-23 11:59:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:28,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:28,090 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-23 11:59:28,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:28,190 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 34 check-sat command(s) [2018-11-23 11:59:28,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:28,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:28,221 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:28,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {22211#true} call ULTIMATE.init(); {22211#true} is VALID [2018-11-23 11:59:28,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {22211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {22211#true} is VALID [2018-11-23 11:59:28,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {22211#true} assume true; {22211#true} is VALID [2018-11-23 11:59:28,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {22211#true} {22211#true} #88#return; {22211#true} is VALID [2018-11-23 11:59:28,619 INFO L256 TraceCheckUtils]: 4: Hoare triple {22211#true} call #t~ret13 := main(); {22211#true} is VALID [2018-11-23 11:59:28,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {22211#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {22211#true} is VALID [2018-11-23 11:59:28,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {22211#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {22211#true} is VALID [2018-11-23 11:59:28,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {22211#true} ~i~0 := 2; {22213#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:28,621 INFO L273 TraceCheckUtils]: 8: Hoare triple {22213#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22213#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:28,621 INFO L273 TraceCheckUtils]: 9: Hoare triple {22213#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22213#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:28,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {22213#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22214#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:28,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {22214#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22214#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:28,625 INFO L273 TraceCheckUtils]: 12: Hoare triple {22214#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22214#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:28,625 INFO L273 TraceCheckUtils]: 13: Hoare triple {22214#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22215#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:28,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {22215#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22215#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:28,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {22215#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22215#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:28,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {22215#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22216#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:28,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {22216#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22216#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:28,631 INFO L273 TraceCheckUtils]: 18: Hoare triple {22216#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22216#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:28,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {22216#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22217#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:28,633 INFO L273 TraceCheckUtils]: 20: Hoare triple {22217#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22217#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:28,635 INFO L273 TraceCheckUtils]: 21: Hoare triple {22217#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22217#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:28,635 INFO L273 TraceCheckUtils]: 22: Hoare triple {22217#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22218#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:28,637 INFO L273 TraceCheckUtils]: 23: Hoare triple {22218#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22218#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:28,637 INFO L273 TraceCheckUtils]: 24: Hoare triple {22218#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22218#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:28,639 INFO L273 TraceCheckUtils]: 25: Hoare triple {22218#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22219#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:28,639 INFO L273 TraceCheckUtils]: 26: Hoare triple {22219#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22219#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:28,641 INFO L273 TraceCheckUtils]: 27: Hoare triple {22219#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22219#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:28,641 INFO L273 TraceCheckUtils]: 28: Hoare triple {22219#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22220#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:28,643 INFO L273 TraceCheckUtils]: 29: Hoare triple {22220#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22220#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:28,643 INFO L273 TraceCheckUtils]: 30: Hoare triple {22220#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22220#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:28,645 INFO L273 TraceCheckUtils]: 31: Hoare triple {22220#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22221#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:28,645 INFO L273 TraceCheckUtils]: 32: Hoare triple {22221#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22221#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:28,647 INFO L273 TraceCheckUtils]: 33: Hoare triple {22221#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22221#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:28,647 INFO L273 TraceCheckUtils]: 34: Hoare triple {22221#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22222#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:28,649 INFO L273 TraceCheckUtils]: 35: Hoare triple {22222#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22222#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:28,649 INFO L273 TraceCheckUtils]: 36: Hoare triple {22222#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22222#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:28,651 INFO L273 TraceCheckUtils]: 37: Hoare triple {22222#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22223#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:28,651 INFO L273 TraceCheckUtils]: 38: Hoare triple {22223#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22223#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:28,653 INFO L273 TraceCheckUtils]: 39: Hoare triple {22223#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22223#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:28,653 INFO L273 TraceCheckUtils]: 40: Hoare triple {22223#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22224#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:28,656 INFO L273 TraceCheckUtils]: 41: Hoare triple {22224#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22224#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:28,656 INFO L273 TraceCheckUtils]: 42: Hoare triple {22224#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22224#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:28,658 INFO L273 TraceCheckUtils]: 43: Hoare triple {22224#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22225#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:28,658 INFO L273 TraceCheckUtils]: 44: Hoare triple {22225#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22225#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:28,660 INFO L273 TraceCheckUtils]: 45: Hoare triple {22225#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22225#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:28,660 INFO L273 TraceCheckUtils]: 46: Hoare triple {22225#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22226#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:28,662 INFO L273 TraceCheckUtils]: 47: Hoare triple {22226#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22226#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:28,662 INFO L273 TraceCheckUtils]: 48: Hoare triple {22226#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22226#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:28,664 INFO L273 TraceCheckUtils]: 49: Hoare triple {22226#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22227#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:28,664 INFO L273 TraceCheckUtils]: 50: Hoare triple {22227#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22227#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:28,666 INFO L273 TraceCheckUtils]: 51: Hoare triple {22227#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22227#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:28,666 INFO L273 TraceCheckUtils]: 52: Hoare triple {22227#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22228#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:28,668 INFO L273 TraceCheckUtils]: 53: Hoare triple {22228#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22228#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:28,668 INFO L273 TraceCheckUtils]: 54: Hoare triple {22228#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22228#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:28,670 INFO L273 TraceCheckUtils]: 55: Hoare triple {22228#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22229#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:28,670 INFO L273 TraceCheckUtils]: 56: Hoare triple {22229#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22229#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:28,672 INFO L273 TraceCheckUtils]: 57: Hoare triple {22229#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22229#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:28,672 INFO L273 TraceCheckUtils]: 58: Hoare triple {22229#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22230#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:28,674 INFO L273 TraceCheckUtils]: 59: Hoare triple {22230#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22230#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:28,674 INFO L273 TraceCheckUtils]: 60: Hoare triple {22230#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22230#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:28,676 INFO L273 TraceCheckUtils]: 61: Hoare triple {22230#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22231#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:28,676 INFO L273 TraceCheckUtils]: 62: Hoare triple {22231#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22231#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:28,676 INFO L273 TraceCheckUtils]: 63: Hoare triple {22231#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22231#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:28,677 INFO L273 TraceCheckUtils]: 64: Hoare triple {22231#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22232#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:28,678 INFO L273 TraceCheckUtils]: 65: Hoare triple {22232#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22232#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:28,678 INFO L273 TraceCheckUtils]: 66: Hoare triple {22232#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22232#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:28,678 INFO L273 TraceCheckUtils]: 67: Hoare triple {22232#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22233#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:28,679 INFO L273 TraceCheckUtils]: 68: Hoare triple {22233#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22233#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:28,679 INFO L273 TraceCheckUtils]: 69: Hoare triple {22233#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22233#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:28,680 INFO L273 TraceCheckUtils]: 70: Hoare triple {22233#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22234#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:28,680 INFO L273 TraceCheckUtils]: 71: Hoare triple {22234#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22234#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:28,682 INFO L273 TraceCheckUtils]: 72: Hoare triple {22234#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22234#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:28,682 INFO L273 TraceCheckUtils]: 73: Hoare triple {22234#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22235#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:28,684 INFO L273 TraceCheckUtils]: 74: Hoare triple {22235#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22235#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:28,684 INFO L273 TraceCheckUtils]: 75: Hoare triple {22235#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22235#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:28,686 INFO L273 TraceCheckUtils]: 76: Hoare triple {22235#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22236#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:28,686 INFO L273 TraceCheckUtils]: 77: Hoare triple {22236#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22236#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:28,688 INFO L273 TraceCheckUtils]: 78: Hoare triple {22236#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22236#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:28,688 INFO L273 TraceCheckUtils]: 79: Hoare triple {22236#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22237#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:28,691 INFO L273 TraceCheckUtils]: 80: Hoare triple {22237#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22237#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:28,691 INFO L273 TraceCheckUtils]: 81: Hoare triple {22237#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22237#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:28,693 INFO L273 TraceCheckUtils]: 82: Hoare triple {22237#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22238#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:28,693 INFO L273 TraceCheckUtils]: 83: Hoare triple {22238#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22238#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:28,695 INFO L273 TraceCheckUtils]: 84: Hoare triple {22238#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22238#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:28,695 INFO L273 TraceCheckUtils]: 85: Hoare triple {22238#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22239#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:28,697 INFO L273 TraceCheckUtils]: 86: Hoare triple {22239#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22239#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:28,697 INFO L273 TraceCheckUtils]: 87: Hoare triple {22239#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22239#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:28,699 INFO L273 TraceCheckUtils]: 88: Hoare triple {22239#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22240#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:28,699 INFO L273 TraceCheckUtils]: 89: Hoare triple {22240#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22240#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:28,701 INFO L273 TraceCheckUtils]: 90: Hoare triple {22240#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22240#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:28,701 INFO L273 TraceCheckUtils]: 91: Hoare triple {22240#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22241#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:28,703 INFO L273 TraceCheckUtils]: 92: Hoare triple {22241#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22241#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:28,703 INFO L273 TraceCheckUtils]: 93: Hoare triple {22241#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22241#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:28,706 INFO L273 TraceCheckUtils]: 94: Hoare triple {22241#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22242#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:28,706 INFO L273 TraceCheckUtils]: 95: Hoare triple {22242#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22242#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:28,708 INFO L273 TraceCheckUtils]: 96: Hoare triple {22242#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22242#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:28,708 INFO L273 TraceCheckUtils]: 97: Hoare triple {22242#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22243#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:28,710 INFO L273 TraceCheckUtils]: 98: Hoare triple {22243#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22243#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:28,710 INFO L273 TraceCheckUtils]: 99: Hoare triple {22243#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22243#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:28,712 INFO L273 TraceCheckUtils]: 100: Hoare triple {22243#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22244#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:28,712 INFO L273 TraceCheckUtils]: 101: Hoare triple {22244#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22244#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:28,714 INFO L273 TraceCheckUtils]: 102: Hoare triple {22244#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22244#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:28,714 INFO L273 TraceCheckUtils]: 103: Hoare triple {22244#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22245#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:28,716 INFO L273 TraceCheckUtils]: 104: Hoare triple {22245#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {22245#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:28,716 INFO L273 TraceCheckUtils]: 105: Hoare triple {22245#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {22245#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:28,718 INFO L273 TraceCheckUtils]: 106: Hoare triple {22245#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {22246#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:28,718 INFO L273 TraceCheckUtils]: 107: Hoare triple {22246#(<= main_~i~0 35)} assume !(~i~0 < 100000); {22212#false} is VALID [2018-11-23 11:59:28,718 INFO L273 TraceCheckUtils]: 108: Hoare triple {22212#false} havoc ~x~0;~x~0 := 0; {22212#false} is VALID [2018-11-23 11:59:28,718 INFO L273 TraceCheckUtils]: 109: Hoare triple {22212#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {22212#false} is VALID [2018-11-23 11:59:28,718 INFO L256 TraceCheckUtils]: 110: Hoare triple {22212#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {22212#false} is VALID [2018-11-23 11:59:28,718 INFO L273 TraceCheckUtils]: 111: Hoare triple {22212#false} ~cond := #in~cond; {22212#false} is VALID [2018-11-23 11:59:28,719 INFO L273 TraceCheckUtils]: 112: Hoare triple {22212#false} assume 0 == ~cond; {22212#false} is VALID [2018-11-23 11:59:28,719 INFO L273 TraceCheckUtils]: 113: Hoare triple {22212#false} assume !false; {22212#false} is VALID [2018-11-23 11:59:28,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:28,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:28,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36] total 36 [2018-11-23 11:59:28,745 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 114 [2018-11-23 11:59:28,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:28,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2018-11-23 11:59:28,870 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:28,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-11-23 11:59:28,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-11-23 11:59:28,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:59:28,871 INFO L87 Difference]: Start difference. First operand 158 states and 229 transitions. Second operand 36 states. [2018-11-23 11:59:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:30,096 INFO L93 Difference]: Finished difference Result 182 states and 261 transitions. [2018-11-23 11:59:30,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-11-23 11:59:30,097 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 114 [2018-11-23 11:59:30,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:59:30,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 261 transitions. [2018-11-23 11:59:30,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 11:59:30,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 261 transitions. [2018-11-23 11:59:30,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 261 transitions. [2018-11-23 11:59:30,354 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 261 edges. 261 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:30,357 INFO L225 Difference]: With dead ends: 182 [2018-11-23 11:59:30,358 INFO L226 Difference]: Without dead ends: 165 [2018-11-23 11:59:30,358 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 11:59:30,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-11-23 11:59:30,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2018-11-23 11:59:30,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:30,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand 162 states. [2018-11-23 11:59:30,415 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 162 states. [2018-11-23 11:59:30,415 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 162 states. [2018-11-23 11:59:30,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:30,418 INFO L93 Difference]: Finished difference Result 165 states and 240 transitions. [2018-11-23 11:59:30,418 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 240 transitions. [2018-11-23 11:59:30,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:30,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:30,418 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand 165 states. [2018-11-23 11:59:30,418 INFO L87 Difference]: Start difference. First operand 162 states. Second operand 165 states. [2018-11-23 11:59:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:30,421 INFO L93 Difference]: Finished difference Result 165 states and 240 transitions. [2018-11-23 11:59:30,421 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 240 transitions. [2018-11-23 11:59:30,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:30,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:30,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:30,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:30,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-11-23 11:59:30,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 235 transitions. [2018-11-23 11:59:30,425 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 235 transitions. Word has length 114 [2018-11-23 11:59:30,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:30,426 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 235 transitions. [2018-11-23 11:59:30,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-11-23 11:59:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 235 transitions. [2018-11-23 11:59:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-11-23 11:59:30,427 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:30,427 INFO L402 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:30,427 INFO L423 AbstractCegarLoop]: === Iteration 36 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:30,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:30,427 INFO L82 PathProgramCache]: Analyzing trace with hash 307445308, now seen corresponding path program 34 times [2018-11-23 11:59:30,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:30,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:30,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:30,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:30,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:31,995 INFO L256 TraceCheckUtils]: 0: Hoare triple {23355#true} call ULTIMATE.init(); {23355#true} is VALID [2018-11-23 11:59:31,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {23355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23355#true} is VALID [2018-11-23 11:59:31,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {23355#true} assume true; {23355#true} is VALID [2018-11-23 11:59:31,996 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23355#true} {23355#true} #88#return; {23355#true} is VALID [2018-11-23 11:59:31,996 INFO L256 TraceCheckUtils]: 4: Hoare triple {23355#true} call #t~ret13 := main(); {23355#true} is VALID [2018-11-23 11:59:31,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {23355#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {23355#true} is VALID [2018-11-23 11:59:31,997 INFO L273 TraceCheckUtils]: 6: Hoare triple {23355#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {23355#true} is VALID [2018-11-23 11:59:31,997 INFO L273 TraceCheckUtils]: 7: Hoare triple {23355#true} ~i~0 := 2; {23357#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:31,997 INFO L273 TraceCheckUtils]: 8: Hoare triple {23357#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23357#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:31,998 INFO L273 TraceCheckUtils]: 9: Hoare triple {23357#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23357#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:31,998 INFO L273 TraceCheckUtils]: 10: Hoare triple {23357#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23358#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:31,999 INFO L273 TraceCheckUtils]: 11: Hoare triple {23358#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23358#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:31,999 INFO L273 TraceCheckUtils]: 12: Hoare triple {23358#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23358#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:31,999 INFO L273 TraceCheckUtils]: 13: Hoare triple {23358#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23359#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:32,000 INFO L273 TraceCheckUtils]: 14: Hoare triple {23359#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23359#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:32,000 INFO L273 TraceCheckUtils]: 15: Hoare triple {23359#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23359#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:32,000 INFO L273 TraceCheckUtils]: 16: Hoare triple {23359#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23360#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:32,001 INFO L273 TraceCheckUtils]: 17: Hoare triple {23360#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23360#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:32,001 INFO L273 TraceCheckUtils]: 18: Hoare triple {23360#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23360#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:32,002 INFO L273 TraceCheckUtils]: 19: Hoare triple {23360#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23361#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:32,003 INFO L273 TraceCheckUtils]: 20: Hoare triple {23361#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23361#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:32,003 INFO L273 TraceCheckUtils]: 21: Hoare triple {23361#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23361#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:32,004 INFO L273 TraceCheckUtils]: 22: Hoare triple {23361#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23362#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:32,004 INFO L273 TraceCheckUtils]: 23: Hoare triple {23362#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23362#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:32,005 INFO L273 TraceCheckUtils]: 24: Hoare triple {23362#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23362#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:32,006 INFO L273 TraceCheckUtils]: 25: Hoare triple {23362#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23363#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:32,006 INFO L273 TraceCheckUtils]: 26: Hoare triple {23363#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23363#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:32,007 INFO L273 TraceCheckUtils]: 27: Hoare triple {23363#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23363#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:32,007 INFO L273 TraceCheckUtils]: 28: Hoare triple {23363#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23364#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:32,008 INFO L273 TraceCheckUtils]: 29: Hoare triple {23364#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23364#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:32,008 INFO L273 TraceCheckUtils]: 30: Hoare triple {23364#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23364#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:32,009 INFO L273 TraceCheckUtils]: 31: Hoare triple {23364#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23365#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:32,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {23365#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23365#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:32,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {23365#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23365#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:32,011 INFO L273 TraceCheckUtils]: 34: Hoare triple {23365#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23366#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:32,011 INFO L273 TraceCheckUtils]: 35: Hoare triple {23366#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23366#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:32,012 INFO L273 TraceCheckUtils]: 36: Hoare triple {23366#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23366#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:32,013 INFO L273 TraceCheckUtils]: 37: Hoare triple {23366#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23367#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:32,013 INFO L273 TraceCheckUtils]: 38: Hoare triple {23367#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23367#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:32,014 INFO L273 TraceCheckUtils]: 39: Hoare triple {23367#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23367#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:32,014 INFO L273 TraceCheckUtils]: 40: Hoare triple {23367#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23368#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:32,015 INFO L273 TraceCheckUtils]: 41: Hoare triple {23368#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23368#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:32,015 INFO L273 TraceCheckUtils]: 42: Hoare triple {23368#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23368#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:32,016 INFO L273 TraceCheckUtils]: 43: Hoare triple {23368#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23369#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:32,017 INFO L273 TraceCheckUtils]: 44: Hoare triple {23369#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23369#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:32,017 INFO L273 TraceCheckUtils]: 45: Hoare triple {23369#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23369#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:32,018 INFO L273 TraceCheckUtils]: 46: Hoare triple {23369#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23370#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:32,018 INFO L273 TraceCheckUtils]: 47: Hoare triple {23370#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23370#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:32,019 INFO L273 TraceCheckUtils]: 48: Hoare triple {23370#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23370#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:32,019 INFO L273 TraceCheckUtils]: 49: Hoare triple {23370#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23371#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:32,020 INFO L273 TraceCheckUtils]: 50: Hoare triple {23371#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23371#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:32,020 INFO L273 TraceCheckUtils]: 51: Hoare triple {23371#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23371#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:32,021 INFO L273 TraceCheckUtils]: 52: Hoare triple {23371#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23372#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:32,022 INFO L273 TraceCheckUtils]: 53: Hoare triple {23372#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23372#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:32,022 INFO L273 TraceCheckUtils]: 54: Hoare triple {23372#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23372#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:32,023 INFO L273 TraceCheckUtils]: 55: Hoare triple {23372#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23373#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:32,023 INFO L273 TraceCheckUtils]: 56: Hoare triple {23373#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23373#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:32,024 INFO L273 TraceCheckUtils]: 57: Hoare triple {23373#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23373#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:32,025 INFO L273 TraceCheckUtils]: 58: Hoare triple {23373#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23374#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:32,025 INFO L273 TraceCheckUtils]: 59: Hoare triple {23374#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23374#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:32,026 INFO L273 TraceCheckUtils]: 60: Hoare triple {23374#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23374#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:32,026 INFO L273 TraceCheckUtils]: 61: Hoare triple {23374#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23375#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:32,027 INFO L273 TraceCheckUtils]: 62: Hoare triple {23375#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23375#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:32,027 INFO L273 TraceCheckUtils]: 63: Hoare triple {23375#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23375#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:32,028 INFO L273 TraceCheckUtils]: 64: Hoare triple {23375#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23376#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:32,029 INFO L273 TraceCheckUtils]: 65: Hoare triple {23376#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23376#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:32,029 INFO L273 TraceCheckUtils]: 66: Hoare triple {23376#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23376#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:32,030 INFO L273 TraceCheckUtils]: 67: Hoare triple {23376#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23377#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:32,030 INFO L273 TraceCheckUtils]: 68: Hoare triple {23377#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23377#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:32,031 INFO L273 TraceCheckUtils]: 69: Hoare triple {23377#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23377#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:32,032 INFO L273 TraceCheckUtils]: 70: Hoare triple {23377#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23378#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:32,032 INFO L273 TraceCheckUtils]: 71: Hoare triple {23378#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23378#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:32,033 INFO L273 TraceCheckUtils]: 72: Hoare triple {23378#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23378#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:32,033 INFO L273 TraceCheckUtils]: 73: Hoare triple {23378#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23379#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:32,034 INFO L273 TraceCheckUtils]: 74: Hoare triple {23379#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23379#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:32,034 INFO L273 TraceCheckUtils]: 75: Hoare triple {23379#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23379#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:32,035 INFO L273 TraceCheckUtils]: 76: Hoare triple {23379#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23380#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:32,035 INFO L273 TraceCheckUtils]: 77: Hoare triple {23380#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23380#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:32,036 INFO L273 TraceCheckUtils]: 78: Hoare triple {23380#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23380#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:32,037 INFO L273 TraceCheckUtils]: 79: Hoare triple {23380#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23381#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:32,037 INFO L273 TraceCheckUtils]: 80: Hoare triple {23381#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23381#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:32,038 INFO L273 TraceCheckUtils]: 81: Hoare triple {23381#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23381#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:32,038 INFO L273 TraceCheckUtils]: 82: Hoare triple {23381#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23382#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:32,039 INFO L273 TraceCheckUtils]: 83: Hoare triple {23382#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23382#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:32,039 INFO L273 TraceCheckUtils]: 84: Hoare triple {23382#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23382#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:32,040 INFO L273 TraceCheckUtils]: 85: Hoare triple {23382#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23383#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:32,041 INFO L273 TraceCheckUtils]: 86: Hoare triple {23383#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23383#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:32,041 INFO L273 TraceCheckUtils]: 87: Hoare triple {23383#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23383#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:32,042 INFO L273 TraceCheckUtils]: 88: Hoare triple {23383#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23384#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:32,042 INFO L273 TraceCheckUtils]: 89: Hoare triple {23384#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23384#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:32,043 INFO L273 TraceCheckUtils]: 90: Hoare triple {23384#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23384#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:32,044 INFO L273 TraceCheckUtils]: 91: Hoare triple {23384#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23385#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:32,044 INFO L273 TraceCheckUtils]: 92: Hoare triple {23385#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23385#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:32,045 INFO L273 TraceCheckUtils]: 93: Hoare triple {23385#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23385#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:32,045 INFO L273 TraceCheckUtils]: 94: Hoare triple {23385#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23386#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:32,046 INFO L273 TraceCheckUtils]: 95: Hoare triple {23386#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23386#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:32,046 INFO L273 TraceCheckUtils]: 96: Hoare triple {23386#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23386#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:32,047 INFO L273 TraceCheckUtils]: 97: Hoare triple {23386#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23387#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:32,048 INFO L273 TraceCheckUtils]: 98: Hoare triple {23387#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23387#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:32,048 INFO L273 TraceCheckUtils]: 99: Hoare triple {23387#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23387#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:32,049 INFO L273 TraceCheckUtils]: 100: Hoare triple {23387#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23388#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:32,049 INFO L273 TraceCheckUtils]: 101: Hoare triple {23388#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23388#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:32,050 INFO L273 TraceCheckUtils]: 102: Hoare triple {23388#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23388#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:32,051 INFO L273 TraceCheckUtils]: 103: Hoare triple {23388#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23389#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:32,051 INFO L273 TraceCheckUtils]: 104: Hoare triple {23389#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23389#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:32,052 INFO L273 TraceCheckUtils]: 105: Hoare triple {23389#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23389#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:32,052 INFO L273 TraceCheckUtils]: 106: Hoare triple {23389#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23390#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:32,053 INFO L273 TraceCheckUtils]: 107: Hoare triple {23390#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23390#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:32,053 INFO L273 TraceCheckUtils]: 108: Hoare triple {23390#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23390#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:32,054 INFO L273 TraceCheckUtils]: 109: Hoare triple {23390#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23391#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:32,055 INFO L273 TraceCheckUtils]: 110: Hoare triple {23391#(<= main_~i~0 36)} assume !(~i~0 < 100000); {23356#false} is VALID [2018-11-23 11:59:32,055 INFO L273 TraceCheckUtils]: 111: Hoare triple {23356#false} havoc ~x~0;~x~0 := 0; {23356#false} is VALID [2018-11-23 11:59:32,055 INFO L273 TraceCheckUtils]: 112: Hoare triple {23356#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {23356#false} is VALID [2018-11-23 11:59:32,055 INFO L256 TraceCheckUtils]: 113: Hoare triple {23356#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {23356#false} is VALID [2018-11-23 11:59:32,055 INFO L273 TraceCheckUtils]: 114: Hoare triple {23356#false} ~cond := #in~cond; {23356#false} is VALID [2018-11-23 11:59:32,056 INFO L273 TraceCheckUtils]: 115: Hoare triple {23356#false} assume 0 == ~cond; {23356#false} is VALID [2018-11-23 11:59:32,056 INFO L273 TraceCheckUtils]: 116: Hoare triple {23356#false} assume !false; {23356#false} is VALID [2018-11-23 11:59:32,066 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:32,066 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:32,067 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-23 11:59:32,074 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:32,143 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:32,143 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:32,194 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:32,430 INFO L256 TraceCheckUtils]: 0: Hoare triple {23355#true} call ULTIMATE.init(); {23355#true} is VALID [2018-11-23 11:59:32,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {23355#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {23355#true} is VALID [2018-11-23 11:59:32,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {23355#true} assume true; {23355#true} is VALID [2018-11-23 11:59:32,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {23355#true} {23355#true} #88#return; {23355#true} is VALID [2018-11-23 11:59:32,431 INFO L256 TraceCheckUtils]: 4: Hoare triple {23355#true} call #t~ret13 := main(); {23355#true} is VALID [2018-11-23 11:59:32,431 INFO L273 TraceCheckUtils]: 5: Hoare triple {23355#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {23355#true} is VALID [2018-11-23 11:59:32,431 INFO L273 TraceCheckUtils]: 6: Hoare triple {23355#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {23355#true} is VALID [2018-11-23 11:59:32,432 INFO L273 TraceCheckUtils]: 7: Hoare triple {23355#true} ~i~0 := 2; {23357#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:32,432 INFO L273 TraceCheckUtils]: 8: Hoare triple {23357#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23357#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:32,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {23357#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23357#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:32,433 INFO L273 TraceCheckUtils]: 10: Hoare triple {23357#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23358#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:32,433 INFO L273 TraceCheckUtils]: 11: Hoare triple {23358#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23358#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:32,433 INFO L273 TraceCheckUtils]: 12: Hoare triple {23358#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23358#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:32,434 INFO L273 TraceCheckUtils]: 13: Hoare triple {23358#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23359#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:32,434 INFO L273 TraceCheckUtils]: 14: Hoare triple {23359#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23359#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:32,435 INFO L273 TraceCheckUtils]: 15: Hoare triple {23359#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23359#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:32,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {23359#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23360#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:32,436 INFO L273 TraceCheckUtils]: 17: Hoare triple {23360#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23360#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:32,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {23360#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23360#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:32,437 INFO L273 TraceCheckUtils]: 19: Hoare triple {23360#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23361#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:32,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {23361#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23361#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:32,438 INFO L273 TraceCheckUtils]: 21: Hoare triple {23361#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23361#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:32,439 INFO L273 TraceCheckUtils]: 22: Hoare triple {23361#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23362#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:32,440 INFO L273 TraceCheckUtils]: 23: Hoare triple {23362#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23362#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:32,440 INFO L273 TraceCheckUtils]: 24: Hoare triple {23362#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23362#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:32,441 INFO L273 TraceCheckUtils]: 25: Hoare triple {23362#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23363#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:32,441 INFO L273 TraceCheckUtils]: 26: Hoare triple {23363#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23363#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:32,442 INFO L273 TraceCheckUtils]: 27: Hoare triple {23363#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23363#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:32,442 INFO L273 TraceCheckUtils]: 28: Hoare triple {23363#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23364#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:32,443 INFO L273 TraceCheckUtils]: 29: Hoare triple {23364#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23364#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:32,444 INFO L273 TraceCheckUtils]: 30: Hoare triple {23364#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23364#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:32,444 INFO L273 TraceCheckUtils]: 31: Hoare triple {23364#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23365#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:32,445 INFO L273 TraceCheckUtils]: 32: Hoare triple {23365#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23365#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:32,445 INFO L273 TraceCheckUtils]: 33: Hoare triple {23365#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23365#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:32,446 INFO L273 TraceCheckUtils]: 34: Hoare triple {23365#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23366#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:32,446 INFO L273 TraceCheckUtils]: 35: Hoare triple {23366#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23366#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:32,447 INFO L273 TraceCheckUtils]: 36: Hoare triple {23366#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23366#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:32,448 INFO L273 TraceCheckUtils]: 37: Hoare triple {23366#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23367#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:32,448 INFO L273 TraceCheckUtils]: 38: Hoare triple {23367#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23367#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:32,449 INFO L273 TraceCheckUtils]: 39: Hoare triple {23367#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23367#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:32,449 INFO L273 TraceCheckUtils]: 40: Hoare triple {23367#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23368#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:32,450 INFO L273 TraceCheckUtils]: 41: Hoare triple {23368#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23368#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:32,450 INFO L273 TraceCheckUtils]: 42: Hoare triple {23368#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23368#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:32,451 INFO L273 TraceCheckUtils]: 43: Hoare triple {23368#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23369#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:32,452 INFO L273 TraceCheckUtils]: 44: Hoare triple {23369#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23369#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:32,452 INFO L273 TraceCheckUtils]: 45: Hoare triple {23369#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23369#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:32,453 INFO L273 TraceCheckUtils]: 46: Hoare triple {23369#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23370#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:32,453 INFO L273 TraceCheckUtils]: 47: Hoare triple {23370#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23370#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:32,454 INFO L273 TraceCheckUtils]: 48: Hoare triple {23370#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23370#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:32,455 INFO L273 TraceCheckUtils]: 49: Hoare triple {23370#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23371#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:32,455 INFO L273 TraceCheckUtils]: 50: Hoare triple {23371#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23371#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:32,456 INFO L273 TraceCheckUtils]: 51: Hoare triple {23371#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23371#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:32,456 INFO L273 TraceCheckUtils]: 52: Hoare triple {23371#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23372#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:32,457 INFO L273 TraceCheckUtils]: 53: Hoare triple {23372#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23372#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:32,457 INFO L273 TraceCheckUtils]: 54: Hoare triple {23372#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23372#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:32,458 INFO L273 TraceCheckUtils]: 55: Hoare triple {23372#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23373#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:32,459 INFO L273 TraceCheckUtils]: 56: Hoare triple {23373#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23373#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:32,459 INFO L273 TraceCheckUtils]: 57: Hoare triple {23373#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23373#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:32,460 INFO L273 TraceCheckUtils]: 58: Hoare triple {23373#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23374#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:32,460 INFO L273 TraceCheckUtils]: 59: Hoare triple {23374#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23374#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:32,461 INFO L273 TraceCheckUtils]: 60: Hoare triple {23374#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23374#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:32,462 INFO L273 TraceCheckUtils]: 61: Hoare triple {23374#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23375#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:32,462 INFO L273 TraceCheckUtils]: 62: Hoare triple {23375#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23375#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:32,463 INFO L273 TraceCheckUtils]: 63: Hoare triple {23375#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23375#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:32,463 INFO L273 TraceCheckUtils]: 64: Hoare triple {23375#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23376#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:32,464 INFO L273 TraceCheckUtils]: 65: Hoare triple {23376#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23376#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:32,464 INFO L273 TraceCheckUtils]: 66: Hoare triple {23376#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23376#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:32,465 INFO L273 TraceCheckUtils]: 67: Hoare triple {23376#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23377#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:32,465 INFO L273 TraceCheckUtils]: 68: Hoare triple {23377#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23377#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:32,466 INFO L273 TraceCheckUtils]: 69: Hoare triple {23377#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23377#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:32,467 INFO L273 TraceCheckUtils]: 70: Hoare triple {23377#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23378#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:32,467 INFO L273 TraceCheckUtils]: 71: Hoare triple {23378#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23378#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:32,468 INFO L273 TraceCheckUtils]: 72: Hoare triple {23378#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23378#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:32,468 INFO L273 TraceCheckUtils]: 73: Hoare triple {23378#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23379#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:32,469 INFO L273 TraceCheckUtils]: 74: Hoare triple {23379#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23379#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:32,469 INFO L273 TraceCheckUtils]: 75: Hoare triple {23379#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23379#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:32,470 INFO L273 TraceCheckUtils]: 76: Hoare triple {23379#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23380#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:32,471 INFO L273 TraceCheckUtils]: 77: Hoare triple {23380#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23380#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:32,471 INFO L273 TraceCheckUtils]: 78: Hoare triple {23380#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23380#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:32,472 INFO L273 TraceCheckUtils]: 79: Hoare triple {23380#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23381#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:32,472 INFO L273 TraceCheckUtils]: 80: Hoare triple {23381#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23381#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:32,473 INFO L273 TraceCheckUtils]: 81: Hoare triple {23381#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23381#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:32,474 INFO L273 TraceCheckUtils]: 82: Hoare triple {23381#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23382#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:32,474 INFO L273 TraceCheckUtils]: 83: Hoare triple {23382#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23382#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:32,475 INFO L273 TraceCheckUtils]: 84: Hoare triple {23382#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23382#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:32,475 INFO L273 TraceCheckUtils]: 85: Hoare triple {23382#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23383#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:32,476 INFO L273 TraceCheckUtils]: 86: Hoare triple {23383#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23383#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:32,476 INFO L273 TraceCheckUtils]: 87: Hoare triple {23383#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23383#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:32,477 INFO L273 TraceCheckUtils]: 88: Hoare triple {23383#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23384#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:32,478 INFO L273 TraceCheckUtils]: 89: Hoare triple {23384#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23384#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:32,478 INFO L273 TraceCheckUtils]: 90: Hoare triple {23384#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23384#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:32,479 INFO L273 TraceCheckUtils]: 91: Hoare triple {23384#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23385#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:32,479 INFO L273 TraceCheckUtils]: 92: Hoare triple {23385#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23385#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:32,480 INFO L273 TraceCheckUtils]: 93: Hoare triple {23385#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23385#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:32,481 INFO L273 TraceCheckUtils]: 94: Hoare triple {23385#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23386#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:32,481 INFO L273 TraceCheckUtils]: 95: Hoare triple {23386#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23386#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:32,482 INFO L273 TraceCheckUtils]: 96: Hoare triple {23386#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23386#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:32,482 INFO L273 TraceCheckUtils]: 97: Hoare triple {23386#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23387#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:32,483 INFO L273 TraceCheckUtils]: 98: Hoare triple {23387#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23387#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:32,483 INFO L273 TraceCheckUtils]: 99: Hoare triple {23387#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23387#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:32,484 INFO L273 TraceCheckUtils]: 100: Hoare triple {23387#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23388#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:32,484 INFO L273 TraceCheckUtils]: 101: Hoare triple {23388#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23388#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:32,485 INFO L273 TraceCheckUtils]: 102: Hoare triple {23388#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23388#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:32,486 INFO L273 TraceCheckUtils]: 103: Hoare triple {23388#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23389#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:32,486 INFO L273 TraceCheckUtils]: 104: Hoare triple {23389#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23389#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:32,487 INFO L273 TraceCheckUtils]: 105: Hoare triple {23389#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23389#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:32,487 INFO L273 TraceCheckUtils]: 106: Hoare triple {23389#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23390#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:32,488 INFO L273 TraceCheckUtils]: 107: Hoare triple {23390#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {23390#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:32,488 INFO L273 TraceCheckUtils]: 108: Hoare triple {23390#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {23390#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:32,489 INFO L273 TraceCheckUtils]: 109: Hoare triple {23390#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {23391#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:32,490 INFO L273 TraceCheckUtils]: 110: Hoare triple {23391#(<= main_~i~0 36)} assume !(~i~0 < 100000); {23356#false} is VALID [2018-11-23 11:59:32,490 INFO L273 TraceCheckUtils]: 111: Hoare triple {23356#false} havoc ~x~0;~x~0 := 0; {23356#false} is VALID [2018-11-23 11:59:32,490 INFO L273 TraceCheckUtils]: 112: Hoare triple {23356#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {23356#false} is VALID [2018-11-23 11:59:32,490 INFO L256 TraceCheckUtils]: 113: Hoare triple {23356#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {23356#false} is VALID [2018-11-23 11:59:32,491 INFO L273 TraceCheckUtils]: 114: Hoare triple {23356#false} ~cond := #in~cond; {23356#false} is VALID [2018-11-23 11:59:32,491 INFO L273 TraceCheckUtils]: 115: Hoare triple {23356#false} assume 0 == ~cond; {23356#false} is VALID [2018-11-23 11:59:32,491 INFO L273 TraceCheckUtils]: 116: Hoare triple {23356#false} assume !false; {23356#false} is VALID [2018-11-23 11:59:32,500 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:32,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:32,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37] total 37 [2018-11-23 11:59:32,520 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 117 [2018-11-23 11:59:32,520 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:32,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states. [2018-11-23 11:59:32,658 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-23 11:59:32,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-11-23 11:59:32,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-11-23 11:59:32,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:59:32,659 INFO L87 Difference]: Start difference. First operand 162 states and 235 transitions. Second operand 37 states. [2018-11-23 11:59:34,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:34,045 INFO L93 Difference]: Finished difference Result 186 states and 267 transitions. [2018-11-23 11:59:34,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-11-23 11:59:34,045 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 117 [2018-11-23 11:59:34,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:34,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:59:34,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 267 transitions. [2018-11-23 11:59:34,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 11:59:34,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 267 transitions. [2018-11-23 11:59:34,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 267 transitions. [2018-11-23 11:59:34,301 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-23 11:59:34,305 INFO L225 Difference]: With dead ends: 186 [2018-11-23 11:59:34,305 INFO L226 Difference]: Without dead ends: 169 [2018-11-23 11:59:34,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-11-23 11:59:34,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-11-23 11:59:34,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-11-23 11:59:34,338 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:34,338 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand 166 states. [2018-11-23 11:59:34,339 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand 166 states. [2018-11-23 11:59:34,339 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 166 states. [2018-11-23 11:59:34,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:34,342 INFO L93 Difference]: Finished difference Result 169 states and 246 transitions. [2018-11-23 11:59:34,342 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 246 transitions. [2018-11-23 11:59:34,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:34,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:34,342 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 169 states. [2018-11-23 11:59:34,342 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 169 states. [2018-11-23 11:59:34,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:34,345 INFO L93 Difference]: Finished difference Result 169 states and 246 transitions. [2018-11-23 11:59:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 246 transitions. [2018-11-23 11:59:34,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:34,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:34,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:34,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:34,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-23 11:59:34,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 241 transitions. [2018-11-23 11:59:34,350 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 241 transitions. Word has length 117 [2018-11-23 11:59:34,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:34,350 INFO L480 AbstractCegarLoop]: Abstraction has 166 states and 241 transitions. [2018-11-23 11:59:34,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-11-23 11:59:34,350 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 241 transitions. [2018-11-23 11:59:34,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-11-23 11:59:34,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:34,351 INFO L402 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:34,351 INFO L423 AbstractCegarLoop]: === Iteration 37 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:34,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1412289823, now seen corresponding path program 35 times [2018-11-23 11:59:34,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:34,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:34,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:34,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:34,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:35,889 INFO L256 TraceCheckUtils]: 0: Hoare triple {24527#true} call ULTIMATE.init(); {24527#true} is VALID [2018-11-23 11:59:35,889 INFO L273 TraceCheckUtils]: 1: Hoare triple {24527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24527#true} is VALID [2018-11-23 11:59:35,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {24527#true} assume true; {24527#true} is VALID [2018-11-23 11:59:35,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24527#true} {24527#true} #88#return; {24527#true} is VALID [2018-11-23 11:59:35,890 INFO L256 TraceCheckUtils]: 4: Hoare triple {24527#true} call #t~ret13 := main(); {24527#true} is VALID [2018-11-23 11:59:35,890 INFO L273 TraceCheckUtils]: 5: Hoare triple {24527#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {24527#true} is VALID [2018-11-23 11:59:35,890 INFO L273 TraceCheckUtils]: 6: Hoare triple {24527#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {24527#true} is VALID [2018-11-23 11:59:35,891 INFO L273 TraceCheckUtils]: 7: Hoare triple {24527#true} ~i~0 := 2; {24529#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:35,891 INFO L273 TraceCheckUtils]: 8: Hoare triple {24529#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24529#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:35,892 INFO L273 TraceCheckUtils]: 9: Hoare triple {24529#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24529#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:35,892 INFO L273 TraceCheckUtils]: 10: Hoare triple {24529#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24530#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:35,893 INFO L273 TraceCheckUtils]: 11: Hoare triple {24530#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24530#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:35,893 INFO L273 TraceCheckUtils]: 12: Hoare triple {24530#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24530#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:35,894 INFO L273 TraceCheckUtils]: 13: Hoare triple {24530#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24531#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:35,895 INFO L273 TraceCheckUtils]: 14: Hoare triple {24531#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24531#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:35,895 INFO L273 TraceCheckUtils]: 15: Hoare triple {24531#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24531#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:35,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {24531#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24532#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:35,896 INFO L273 TraceCheckUtils]: 17: Hoare triple {24532#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24532#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:35,897 INFO L273 TraceCheckUtils]: 18: Hoare triple {24532#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24532#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:35,898 INFO L273 TraceCheckUtils]: 19: Hoare triple {24532#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24533#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:35,898 INFO L273 TraceCheckUtils]: 20: Hoare triple {24533#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24533#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:35,899 INFO L273 TraceCheckUtils]: 21: Hoare triple {24533#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24533#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:35,899 INFO L273 TraceCheckUtils]: 22: Hoare triple {24533#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24534#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:35,900 INFO L273 TraceCheckUtils]: 23: Hoare triple {24534#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24534#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:35,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {24534#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24534#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:35,901 INFO L273 TraceCheckUtils]: 25: Hoare triple {24534#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24535#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:35,902 INFO L273 TraceCheckUtils]: 26: Hoare triple {24535#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24535#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:35,902 INFO L273 TraceCheckUtils]: 27: Hoare triple {24535#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24535#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:35,903 INFO L273 TraceCheckUtils]: 28: Hoare triple {24535#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24536#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:35,903 INFO L273 TraceCheckUtils]: 29: Hoare triple {24536#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24536#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:35,904 INFO L273 TraceCheckUtils]: 30: Hoare triple {24536#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24536#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:35,904 INFO L273 TraceCheckUtils]: 31: Hoare triple {24536#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24537#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:35,905 INFO L273 TraceCheckUtils]: 32: Hoare triple {24537#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24537#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:35,905 INFO L273 TraceCheckUtils]: 33: Hoare triple {24537#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24537#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:35,906 INFO L273 TraceCheckUtils]: 34: Hoare triple {24537#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24538#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:35,907 INFO L273 TraceCheckUtils]: 35: Hoare triple {24538#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24538#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:35,907 INFO L273 TraceCheckUtils]: 36: Hoare triple {24538#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24538#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:35,908 INFO L273 TraceCheckUtils]: 37: Hoare triple {24538#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24539#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:35,908 INFO L273 TraceCheckUtils]: 38: Hoare triple {24539#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24539#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:35,909 INFO L273 TraceCheckUtils]: 39: Hoare triple {24539#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24539#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:35,910 INFO L273 TraceCheckUtils]: 40: Hoare triple {24539#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24540#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:35,910 INFO L273 TraceCheckUtils]: 41: Hoare triple {24540#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24540#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:35,911 INFO L273 TraceCheckUtils]: 42: Hoare triple {24540#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24540#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:35,911 INFO L273 TraceCheckUtils]: 43: Hoare triple {24540#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24541#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:35,912 INFO L273 TraceCheckUtils]: 44: Hoare triple {24541#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24541#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:35,912 INFO L273 TraceCheckUtils]: 45: Hoare triple {24541#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24541#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:35,913 INFO L273 TraceCheckUtils]: 46: Hoare triple {24541#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24542#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:35,914 INFO L273 TraceCheckUtils]: 47: Hoare triple {24542#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24542#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:35,914 INFO L273 TraceCheckUtils]: 48: Hoare triple {24542#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24542#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:35,915 INFO L273 TraceCheckUtils]: 49: Hoare triple {24542#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24543#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:35,915 INFO L273 TraceCheckUtils]: 50: Hoare triple {24543#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24543#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:35,916 INFO L273 TraceCheckUtils]: 51: Hoare triple {24543#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24543#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:35,917 INFO L273 TraceCheckUtils]: 52: Hoare triple {24543#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24544#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:35,917 INFO L273 TraceCheckUtils]: 53: Hoare triple {24544#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24544#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:35,918 INFO L273 TraceCheckUtils]: 54: Hoare triple {24544#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24544#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:35,918 INFO L273 TraceCheckUtils]: 55: Hoare triple {24544#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24545#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:35,919 INFO L273 TraceCheckUtils]: 56: Hoare triple {24545#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24545#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:35,919 INFO L273 TraceCheckUtils]: 57: Hoare triple {24545#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24545#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:35,920 INFO L273 TraceCheckUtils]: 58: Hoare triple {24545#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24546#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:35,921 INFO L273 TraceCheckUtils]: 59: Hoare triple {24546#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24546#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:35,921 INFO L273 TraceCheckUtils]: 60: Hoare triple {24546#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24546#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:35,922 INFO L273 TraceCheckUtils]: 61: Hoare triple {24546#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24547#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:35,922 INFO L273 TraceCheckUtils]: 62: Hoare triple {24547#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24547#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:35,923 INFO L273 TraceCheckUtils]: 63: Hoare triple {24547#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24547#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:35,924 INFO L273 TraceCheckUtils]: 64: Hoare triple {24547#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24548#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:35,924 INFO L273 TraceCheckUtils]: 65: Hoare triple {24548#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24548#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:35,925 INFO L273 TraceCheckUtils]: 66: Hoare triple {24548#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24548#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:35,925 INFO L273 TraceCheckUtils]: 67: Hoare triple {24548#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24549#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:35,926 INFO L273 TraceCheckUtils]: 68: Hoare triple {24549#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24549#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:35,926 INFO L273 TraceCheckUtils]: 69: Hoare triple {24549#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24549#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:35,927 INFO L273 TraceCheckUtils]: 70: Hoare triple {24549#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24550#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:35,927 INFO L273 TraceCheckUtils]: 71: Hoare triple {24550#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24550#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:35,928 INFO L273 TraceCheckUtils]: 72: Hoare triple {24550#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24550#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:35,929 INFO L273 TraceCheckUtils]: 73: Hoare triple {24550#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24551#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:35,929 INFO L273 TraceCheckUtils]: 74: Hoare triple {24551#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24551#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:35,930 INFO L273 TraceCheckUtils]: 75: Hoare triple {24551#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24551#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:35,930 INFO L273 TraceCheckUtils]: 76: Hoare triple {24551#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24552#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:35,931 INFO L273 TraceCheckUtils]: 77: Hoare triple {24552#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24552#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:35,931 INFO L273 TraceCheckUtils]: 78: Hoare triple {24552#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24552#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:35,932 INFO L273 TraceCheckUtils]: 79: Hoare triple {24552#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24553#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:35,933 INFO L273 TraceCheckUtils]: 80: Hoare triple {24553#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24553#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:35,933 INFO L273 TraceCheckUtils]: 81: Hoare triple {24553#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24553#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:35,934 INFO L273 TraceCheckUtils]: 82: Hoare triple {24553#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24554#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:35,934 INFO L273 TraceCheckUtils]: 83: Hoare triple {24554#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24554#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:35,935 INFO L273 TraceCheckUtils]: 84: Hoare triple {24554#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24554#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:35,936 INFO L273 TraceCheckUtils]: 85: Hoare triple {24554#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24555#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:35,936 INFO L273 TraceCheckUtils]: 86: Hoare triple {24555#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24555#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:35,937 INFO L273 TraceCheckUtils]: 87: Hoare triple {24555#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24555#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:35,937 INFO L273 TraceCheckUtils]: 88: Hoare triple {24555#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24556#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:35,938 INFO L273 TraceCheckUtils]: 89: Hoare triple {24556#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24556#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:35,938 INFO L273 TraceCheckUtils]: 90: Hoare triple {24556#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24556#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:35,939 INFO L273 TraceCheckUtils]: 91: Hoare triple {24556#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24557#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:35,940 INFO L273 TraceCheckUtils]: 92: Hoare triple {24557#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24557#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:35,940 INFO L273 TraceCheckUtils]: 93: Hoare triple {24557#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24557#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:35,941 INFO L273 TraceCheckUtils]: 94: Hoare triple {24557#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24558#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:35,941 INFO L273 TraceCheckUtils]: 95: Hoare triple {24558#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24558#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:35,942 INFO L273 TraceCheckUtils]: 96: Hoare triple {24558#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24558#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:35,943 INFO L273 TraceCheckUtils]: 97: Hoare triple {24558#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24559#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:35,943 INFO L273 TraceCheckUtils]: 98: Hoare triple {24559#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24559#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:35,944 INFO L273 TraceCheckUtils]: 99: Hoare triple {24559#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24559#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:35,944 INFO L273 TraceCheckUtils]: 100: Hoare triple {24559#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24560#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:35,945 INFO L273 TraceCheckUtils]: 101: Hoare triple {24560#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24560#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:35,945 INFO L273 TraceCheckUtils]: 102: Hoare triple {24560#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24560#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:35,946 INFO L273 TraceCheckUtils]: 103: Hoare triple {24560#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24561#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:35,947 INFO L273 TraceCheckUtils]: 104: Hoare triple {24561#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24561#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:35,947 INFO L273 TraceCheckUtils]: 105: Hoare triple {24561#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24561#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:35,948 INFO L273 TraceCheckUtils]: 106: Hoare triple {24561#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24562#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:35,948 INFO L273 TraceCheckUtils]: 107: Hoare triple {24562#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24562#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:35,949 INFO L273 TraceCheckUtils]: 108: Hoare triple {24562#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24562#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:35,950 INFO L273 TraceCheckUtils]: 109: Hoare triple {24562#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24563#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:35,950 INFO L273 TraceCheckUtils]: 110: Hoare triple {24563#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24563#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:35,951 INFO L273 TraceCheckUtils]: 111: Hoare triple {24563#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24563#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:35,951 INFO L273 TraceCheckUtils]: 112: Hoare triple {24563#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24564#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:35,952 INFO L273 TraceCheckUtils]: 113: Hoare triple {24564#(<= main_~i~0 37)} assume !(~i~0 < 100000); {24528#false} is VALID [2018-11-23 11:59:35,952 INFO L273 TraceCheckUtils]: 114: Hoare triple {24528#false} havoc ~x~0;~x~0 := 0; {24528#false} is VALID [2018-11-23 11:59:35,952 INFO L273 TraceCheckUtils]: 115: Hoare triple {24528#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {24528#false} is VALID [2018-11-23 11:59:35,953 INFO L256 TraceCheckUtils]: 116: Hoare triple {24528#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {24528#false} is VALID [2018-11-23 11:59:35,953 INFO L273 TraceCheckUtils]: 117: Hoare triple {24528#false} ~cond := #in~cond; {24528#false} is VALID [2018-11-23 11:59:35,953 INFO L273 TraceCheckUtils]: 118: Hoare triple {24528#false} assume 0 == ~cond; {24528#false} is VALID [2018-11-23 11:59:35,953 INFO L273 TraceCheckUtils]: 119: Hoare triple {24528#false} assume !false; {24528#false} is VALID [2018-11-23 11:59:35,963 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:35,963 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:35,963 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-23 11:59:35,971 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:36,062 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 36 check-sat command(s) [2018-11-23 11:59:36,063 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:36,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:36,355 INFO L256 TraceCheckUtils]: 0: Hoare triple {24527#true} call ULTIMATE.init(); {24527#true} is VALID [2018-11-23 11:59:36,356 INFO L273 TraceCheckUtils]: 1: Hoare triple {24527#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {24527#true} is VALID [2018-11-23 11:59:36,356 INFO L273 TraceCheckUtils]: 2: Hoare triple {24527#true} assume true; {24527#true} is VALID [2018-11-23 11:59:36,356 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {24527#true} {24527#true} #88#return; {24527#true} is VALID [2018-11-23 11:59:36,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {24527#true} call #t~ret13 := main(); {24527#true} is VALID [2018-11-23 11:59:36,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {24527#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {24527#true} is VALID [2018-11-23 11:59:36,356 INFO L273 TraceCheckUtils]: 6: Hoare triple {24527#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {24527#true} is VALID [2018-11-23 11:59:36,356 INFO L273 TraceCheckUtils]: 7: Hoare triple {24527#true} ~i~0 := 2; {24529#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:36,357 INFO L273 TraceCheckUtils]: 8: Hoare triple {24529#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24529#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:36,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {24529#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24529#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:36,358 INFO L273 TraceCheckUtils]: 10: Hoare triple {24529#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24530#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:36,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {24530#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24530#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:36,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {24530#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24530#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:36,359 INFO L273 TraceCheckUtils]: 13: Hoare triple {24530#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24531#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:36,359 INFO L273 TraceCheckUtils]: 14: Hoare triple {24531#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24531#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:36,359 INFO L273 TraceCheckUtils]: 15: Hoare triple {24531#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24531#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:36,360 INFO L273 TraceCheckUtils]: 16: Hoare triple {24531#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24532#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:36,360 INFO L273 TraceCheckUtils]: 17: Hoare triple {24532#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24532#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:36,361 INFO L273 TraceCheckUtils]: 18: Hoare triple {24532#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24532#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:36,361 INFO L273 TraceCheckUtils]: 19: Hoare triple {24532#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24533#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:36,362 INFO L273 TraceCheckUtils]: 20: Hoare triple {24533#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24533#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:36,362 INFO L273 TraceCheckUtils]: 21: Hoare triple {24533#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24533#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:36,363 INFO L273 TraceCheckUtils]: 22: Hoare triple {24533#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24534#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:36,364 INFO L273 TraceCheckUtils]: 23: Hoare triple {24534#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24534#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:36,364 INFO L273 TraceCheckUtils]: 24: Hoare triple {24534#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24534#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:36,365 INFO L273 TraceCheckUtils]: 25: Hoare triple {24534#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24535#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:36,365 INFO L273 TraceCheckUtils]: 26: Hoare triple {24535#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24535#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:36,366 INFO L273 TraceCheckUtils]: 27: Hoare triple {24535#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24535#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:36,367 INFO L273 TraceCheckUtils]: 28: Hoare triple {24535#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24536#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:36,367 INFO L273 TraceCheckUtils]: 29: Hoare triple {24536#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24536#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:36,368 INFO L273 TraceCheckUtils]: 30: Hoare triple {24536#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24536#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:36,368 INFO L273 TraceCheckUtils]: 31: Hoare triple {24536#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24537#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:36,369 INFO L273 TraceCheckUtils]: 32: Hoare triple {24537#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24537#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:36,369 INFO L273 TraceCheckUtils]: 33: Hoare triple {24537#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24537#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:36,370 INFO L273 TraceCheckUtils]: 34: Hoare triple {24537#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24538#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:36,371 INFO L273 TraceCheckUtils]: 35: Hoare triple {24538#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24538#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:36,371 INFO L273 TraceCheckUtils]: 36: Hoare triple {24538#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24538#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:36,372 INFO L273 TraceCheckUtils]: 37: Hoare triple {24538#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24539#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:36,372 INFO L273 TraceCheckUtils]: 38: Hoare triple {24539#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24539#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:36,373 INFO L273 TraceCheckUtils]: 39: Hoare triple {24539#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24539#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:36,374 INFO L273 TraceCheckUtils]: 40: Hoare triple {24539#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24540#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:36,374 INFO L273 TraceCheckUtils]: 41: Hoare triple {24540#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24540#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:36,375 INFO L273 TraceCheckUtils]: 42: Hoare triple {24540#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24540#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:36,375 INFO L273 TraceCheckUtils]: 43: Hoare triple {24540#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24541#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:36,376 INFO L273 TraceCheckUtils]: 44: Hoare triple {24541#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24541#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:36,376 INFO L273 TraceCheckUtils]: 45: Hoare triple {24541#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24541#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:36,377 INFO L273 TraceCheckUtils]: 46: Hoare triple {24541#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24542#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:36,378 INFO L273 TraceCheckUtils]: 47: Hoare triple {24542#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24542#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:36,378 INFO L273 TraceCheckUtils]: 48: Hoare triple {24542#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24542#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:36,379 INFO L273 TraceCheckUtils]: 49: Hoare triple {24542#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24543#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:36,379 INFO L273 TraceCheckUtils]: 50: Hoare triple {24543#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24543#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:36,380 INFO L273 TraceCheckUtils]: 51: Hoare triple {24543#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24543#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:36,380 INFO L273 TraceCheckUtils]: 52: Hoare triple {24543#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24544#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:36,381 INFO L273 TraceCheckUtils]: 53: Hoare triple {24544#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24544#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:36,381 INFO L273 TraceCheckUtils]: 54: Hoare triple {24544#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24544#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:36,382 INFO L273 TraceCheckUtils]: 55: Hoare triple {24544#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24545#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:36,383 INFO L273 TraceCheckUtils]: 56: Hoare triple {24545#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24545#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:36,383 INFO L273 TraceCheckUtils]: 57: Hoare triple {24545#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24545#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:36,384 INFO L273 TraceCheckUtils]: 58: Hoare triple {24545#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24546#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:36,384 INFO L273 TraceCheckUtils]: 59: Hoare triple {24546#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24546#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:36,385 INFO L273 TraceCheckUtils]: 60: Hoare triple {24546#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24546#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:36,386 INFO L273 TraceCheckUtils]: 61: Hoare triple {24546#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24547#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:36,386 INFO L273 TraceCheckUtils]: 62: Hoare triple {24547#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24547#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:36,387 INFO L273 TraceCheckUtils]: 63: Hoare triple {24547#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24547#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:36,387 INFO L273 TraceCheckUtils]: 64: Hoare triple {24547#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24548#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:36,388 INFO L273 TraceCheckUtils]: 65: Hoare triple {24548#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24548#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:36,388 INFO L273 TraceCheckUtils]: 66: Hoare triple {24548#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24548#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:36,389 INFO L273 TraceCheckUtils]: 67: Hoare triple {24548#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24549#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:36,390 INFO L273 TraceCheckUtils]: 68: Hoare triple {24549#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24549#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:36,390 INFO L273 TraceCheckUtils]: 69: Hoare triple {24549#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24549#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:36,391 INFO L273 TraceCheckUtils]: 70: Hoare triple {24549#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24550#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:36,391 INFO L273 TraceCheckUtils]: 71: Hoare triple {24550#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24550#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:36,392 INFO L273 TraceCheckUtils]: 72: Hoare triple {24550#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24550#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:36,393 INFO L273 TraceCheckUtils]: 73: Hoare triple {24550#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24551#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:36,393 INFO L273 TraceCheckUtils]: 74: Hoare triple {24551#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24551#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:36,394 INFO L273 TraceCheckUtils]: 75: Hoare triple {24551#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24551#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:36,394 INFO L273 TraceCheckUtils]: 76: Hoare triple {24551#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24552#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:36,395 INFO L273 TraceCheckUtils]: 77: Hoare triple {24552#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24552#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:36,395 INFO L273 TraceCheckUtils]: 78: Hoare triple {24552#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24552#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:36,396 INFO L273 TraceCheckUtils]: 79: Hoare triple {24552#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24553#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:36,396 INFO L273 TraceCheckUtils]: 80: Hoare triple {24553#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24553#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:36,397 INFO L273 TraceCheckUtils]: 81: Hoare triple {24553#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24553#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:36,398 INFO L273 TraceCheckUtils]: 82: Hoare triple {24553#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24554#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:36,398 INFO L273 TraceCheckUtils]: 83: Hoare triple {24554#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24554#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:36,399 INFO L273 TraceCheckUtils]: 84: Hoare triple {24554#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24554#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:36,399 INFO L273 TraceCheckUtils]: 85: Hoare triple {24554#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24555#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:36,400 INFO L273 TraceCheckUtils]: 86: Hoare triple {24555#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24555#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:36,400 INFO L273 TraceCheckUtils]: 87: Hoare triple {24555#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24555#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:36,401 INFO L273 TraceCheckUtils]: 88: Hoare triple {24555#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24556#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:36,402 INFO L273 TraceCheckUtils]: 89: Hoare triple {24556#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24556#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:36,402 INFO L273 TraceCheckUtils]: 90: Hoare triple {24556#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24556#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:36,403 INFO L273 TraceCheckUtils]: 91: Hoare triple {24556#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24557#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:36,403 INFO L273 TraceCheckUtils]: 92: Hoare triple {24557#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24557#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:36,404 INFO L273 TraceCheckUtils]: 93: Hoare triple {24557#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24557#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:36,405 INFO L273 TraceCheckUtils]: 94: Hoare triple {24557#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24558#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:36,405 INFO L273 TraceCheckUtils]: 95: Hoare triple {24558#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24558#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:36,406 INFO L273 TraceCheckUtils]: 96: Hoare triple {24558#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24558#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:36,406 INFO L273 TraceCheckUtils]: 97: Hoare triple {24558#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24559#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:36,407 INFO L273 TraceCheckUtils]: 98: Hoare triple {24559#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24559#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:36,407 INFO L273 TraceCheckUtils]: 99: Hoare triple {24559#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24559#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:36,408 INFO L273 TraceCheckUtils]: 100: Hoare triple {24559#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24560#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:36,409 INFO L273 TraceCheckUtils]: 101: Hoare triple {24560#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24560#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:36,409 INFO L273 TraceCheckUtils]: 102: Hoare triple {24560#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24560#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:36,410 INFO L273 TraceCheckUtils]: 103: Hoare triple {24560#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24561#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:36,410 INFO L273 TraceCheckUtils]: 104: Hoare triple {24561#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24561#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:36,411 INFO L273 TraceCheckUtils]: 105: Hoare triple {24561#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24561#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:36,412 INFO L273 TraceCheckUtils]: 106: Hoare triple {24561#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24562#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:36,412 INFO L273 TraceCheckUtils]: 107: Hoare triple {24562#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24562#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:36,413 INFO L273 TraceCheckUtils]: 108: Hoare triple {24562#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24562#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:36,413 INFO L273 TraceCheckUtils]: 109: Hoare triple {24562#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24563#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:36,414 INFO L273 TraceCheckUtils]: 110: Hoare triple {24563#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {24563#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:36,414 INFO L273 TraceCheckUtils]: 111: Hoare triple {24563#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {24563#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:36,415 INFO L273 TraceCheckUtils]: 112: Hoare triple {24563#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {24564#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:36,416 INFO L273 TraceCheckUtils]: 113: Hoare triple {24564#(<= main_~i~0 37)} assume !(~i~0 < 100000); {24528#false} is VALID [2018-11-23 11:59:36,416 INFO L273 TraceCheckUtils]: 114: Hoare triple {24528#false} havoc ~x~0;~x~0 := 0; {24528#false} is VALID [2018-11-23 11:59:36,416 INFO L273 TraceCheckUtils]: 115: Hoare triple {24528#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {24528#false} is VALID [2018-11-23 11:59:36,416 INFO L256 TraceCheckUtils]: 116: Hoare triple {24528#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {24528#false} is VALID [2018-11-23 11:59:36,416 INFO L273 TraceCheckUtils]: 117: Hoare triple {24528#false} ~cond := #in~cond; {24528#false} is VALID [2018-11-23 11:59:36,417 INFO L273 TraceCheckUtils]: 118: Hoare triple {24528#false} assume 0 == ~cond; {24528#false} is VALID [2018-11-23 11:59:36,417 INFO L273 TraceCheckUtils]: 119: Hoare triple {24528#false} assume !false; {24528#false} is VALID [2018-11-23 11:59:36,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:36,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:36,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 38] total 38 [2018-11-23 11:59:36,446 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 120 [2018-11-23 11:59:36,447 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:36,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states. [2018-11-23 11:59:36,567 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-23 11:59:36,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-11-23 11:59:36,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-11-23 11:59:36,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:59:36,569 INFO L87 Difference]: Start difference. First operand 166 states and 241 transitions. Second operand 38 states. [2018-11-23 11:59:37,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:37,899 INFO L93 Difference]: Finished difference Result 190 states and 273 transitions. [2018-11-23 11:59:37,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 11:59:37,899 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 120 [2018-11-23 11:59:37,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:37,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:59:37,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 273 transitions. [2018-11-23 11:59:37,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 11:59:37,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 273 transitions. [2018-11-23 11:59:37,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 273 transitions. [2018-11-23 11:59:38,161 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:38,165 INFO L225 Difference]: With dead ends: 190 [2018-11-23 11:59:38,165 INFO L226 Difference]: Without dead ends: 173 [2018-11-23 11:59:38,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 11:59:38,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-11-23 11:59:38,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2018-11-23 11:59:38,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:38,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand 170 states. [2018-11-23 11:59:38,195 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand 170 states. [2018-11-23 11:59:38,195 INFO L87 Difference]: Start difference. First operand 173 states. Second operand 170 states. [2018-11-23 11:59:38,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:38,197 INFO L93 Difference]: Finished difference Result 173 states and 252 transitions. [2018-11-23 11:59:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 252 transitions. [2018-11-23 11:59:38,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:38,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:38,198 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand 173 states. [2018-11-23 11:59:38,198 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 173 states. [2018-11-23 11:59:38,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:38,200 INFO L93 Difference]: Finished difference Result 173 states and 252 transitions. [2018-11-23 11:59:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 252 transitions. [2018-11-23 11:59:38,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:38,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:38,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:38,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-11-23 11:59:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 247 transitions. [2018-11-23 11:59:38,203 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 247 transitions. Word has length 120 [2018-11-23 11:59:38,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:38,204 INFO L480 AbstractCegarLoop]: Abstraction has 170 states and 247 transitions. [2018-11-23 11:59:38,204 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-11-23 11:59:38,204 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 247 transitions. [2018-11-23 11:59:38,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-11-23 11:59:38,204 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:38,204 INFO L402 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:38,205 INFO L423 AbstractCegarLoop]: === Iteration 38 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:38,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:38,205 INFO L82 PathProgramCache]: Analyzing trace with hash 623296540, now seen corresponding path program 36 times [2018-11-23 11:59:38,205 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:38,205 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:38,205 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:38,206 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:38,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:38,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:39,554 INFO L256 TraceCheckUtils]: 0: Hoare triple {25727#true} call ULTIMATE.init(); {25727#true} is VALID [2018-11-23 11:59:39,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {25727#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25727#true} is VALID [2018-11-23 11:59:39,555 INFO L273 TraceCheckUtils]: 2: Hoare triple {25727#true} assume true; {25727#true} is VALID [2018-11-23 11:59:39,555 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25727#true} {25727#true} #88#return; {25727#true} is VALID [2018-11-23 11:59:39,555 INFO L256 TraceCheckUtils]: 4: Hoare triple {25727#true} call #t~ret13 := main(); {25727#true} is VALID [2018-11-23 11:59:39,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {25727#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {25727#true} is VALID [2018-11-23 11:59:39,556 INFO L273 TraceCheckUtils]: 6: Hoare triple {25727#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {25727#true} is VALID [2018-11-23 11:59:39,556 INFO L273 TraceCheckUtils]: 7: Hoare triple {25727#true} ~i~0 := 2; {25729#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:39,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {25729#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25729#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:39,557 INFO L273 TraceCheckUtils]: 9: Hoare triple {25729#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25729#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:39,557 INFO L273 TraceCheckUtils]: 10: Hoare triple {25729#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25730#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:39,558 INFO L273 TraceCheckUtils]: 11: Hoare triple {25730#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25730#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:39,558 INFO L273 TraceCheckUtils]: 12: Hoare triple {25730#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25730#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:39,558 INFO L273 TraceCheckUtils]: 13: Hoare triple {25730#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25731#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:39,581 INFO L273 TraceCheckUtils]: 14: Hoare triple {25731#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25731#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:39,590 INFO L273 TraceCheckUtils]: 15: Hoare triple {25731#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25731#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:39,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {25731#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25732#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:39,591 INFO L273 TraceCheckUtils]: 17: Hoare triple {25732#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25732#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:39,591 INFO L273 TraceCheckUtils]: 18: Hoare triple {25732#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25732#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:39,592 INFO L273 TraceCheckUtils]: 19: Hoare triple {25732#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25733#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:39,592 INFO L273 TraceCheckUtils]: 20: Hoare triple {25733#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25733#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:39,592 INFO L273 TraceCheckUtils]: 21: Hoare triple {25733#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25733#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:39,593 INFO L273 TraceCheckUtils]: 22: Hoare triple {25733#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25734#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:39,593 INFO L273 TraceCheckUtils]: 23: Hoare triple {25734#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25734#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:39,593 INFO L273 TraceCheckUtils]: 24: Hoare triple {25734#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25734#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:39,594 INFO L273 TraceCheckUtils]: 25: Hoare triple {25734#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25735#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:39,595 INFO L273 TraceCheckUtils]: 26: Hoare triple {25735#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25735#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:39,595 INFO L273 TraceCheckUtils]: 27: Hoare triple {25735#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25735#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:39,596 INFO L273 TraceCheckUtils]: 28: Hoare triple {25735#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25736#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:39,596 INFO L273 TraceCheckUtils]: 29: Hoare triple {25736#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25736#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:39,597 INFO L273 TraceCheckUtils]: 30: Hoare triple {25736#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25736#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:39,598 INFO L273 TraceCheckUtils]: 31: Hoare triple {25736#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25737#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:39,598 INFO L273 TraceCheckUtils]: 32: Hoare triple {25737#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25737#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:39,599 INFO L273 TraceCheckUtils]: 33: Hoare triple {25737#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25737#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:39,599 INFO L273 TraceCheckUtils]: 34: Hoare triple {25737#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25738#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:39,600 INFO L273 TraceCheckUtils]: 35: Hoare triple {25738#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25738#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:39,600 INFO L273 TraceCheckUtils]: 36: Hoare triple {25738#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25738#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:39,601 INFO L273 TraceCheckUtils]: 37: Hoare triple {25738#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25739#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:39,602 INFO L273 TraceCheckUtils]: 38: Hoare triple {25739#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25739#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:39,602 INFO L273 TraceCheckUtils]: 39: Hoare triple {25739#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25739#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:39,603 INFO L273 TraceCheckUtils]: 40: Hoare triple {25739#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25740#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:39,603 INFO L273 TraceCheckUtils]: 41: Hoare triple {25740#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25740#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:39,604 INFO L273 TraceCheckUtils]: 42: Hoare triple {25740#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25740#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:39,605 INFO L273 TraceCheckUtils]: 43: Hoare triple {25740#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25741#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:39,605 INFO L273 TraceCheckUtils]: 44: Hoare triple {25741#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25741#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:39,606 INFO L273 TraceCheckUtils]: 45: Hoare triple {25741#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25741#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:39,606 INFO L273 TraceCheckUtils]: 46: Hoare triple {25741#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25742#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:39,607 INFO L273 TraceCheckUtils]: 47: Hoare triple {25742#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25742#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:39,607 INFO L273 TraceCheckUtils]: 48: Hoare triple {25742#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25742#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:39,608 INFO L273 TraceCheckUtils]: 49: Hoare triple {25742#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25743#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:39,608 INFO L273 TraceCheckUtils]: 50: Hoare triple {25743#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25743#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:39,609 INFO L273 TraceCheckUtils]: 51: Hoare triple {25743#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25743#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:39,610 INFO L273 TraceCheckUtils]: 52: Hoare triple {25743#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25744#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:39,610 INFO L273 TraceCheckUtils]: 53: Hoare triple {25744#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25744#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:39,611 INFO L273 TraceCheckUtils]: 54: Hoare triple {25744#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25744#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:39,611 INFO L273 TraceCheckUtils]: 55: Hoare triple {25744#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25745#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:39,612 INFO L273 TraceCheckUtils]: 56: Hoare triple {25745#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25745#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:39,612 INFO L273 TraceCheckUtils]: 57: Hoare triple {25745#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25745#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:39,613 INFO L273 TraceCheckUtils]: 58: Hoare triple {25745#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25746#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:39,614 INFO L273 TraceCheckUtils]: 59: Hoare triple {25746#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25746#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:39,614 INFO L273 TraceCheckUtils]: 60: Hoare triple {25746#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25746#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:39,615 INFO L273 TraceCheckUtils]: 61: Hoare triple {25746#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25747#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:39,615 INFO L273 TraceCheckUtils]: 62: Hoare triple {25747#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25747#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:39,616 INFO L273 TraceCheckUtils]: 63: Hoare triple {25747#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25747#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:39,617 INFO L273 TraceCheckUtils]: 64: Hoare triple {25747#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25748#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:39,617 INFO L273 TraceCheckUtils]: 65: Hoare triple {25748#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25748#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:39,618 INFO L273 TraceCheckUtils]: 66: Hoare triple {25748#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25748#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:39,618 INFO L273 TraceCheckUtils]: 67: Hoare triple {25748#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25749#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:39,619 INFO L273 TraceCheckUtils]: 68: Hoare triple {25749#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25749#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:39,619 INFO L273 TraceCheckUtils]: 69: Hoare triple {25749#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25749#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:39,620 INFO L273 TraceCheckUtils]: 70: Hoare triple {25749#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25750#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:39,621 INFO L273 TraceCheckUtils]: 71: Hoare triple {25750#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25750#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:39,621 INFO L273 TraceCheckUtils]: 72: Hoare triple {25750#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25750#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:39,622 INFO L273 TraceCheckUtils]: 73: Hoare triple {25750#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25751#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:39,622 INFO L273 TraceCheckUtils]: 74: Hoare triple {25751#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25751#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:39,623 INFO L273 TraceCheckUtils]: 75: Hoare triple {25751#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25751#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:39,624 INFO L273 TraceCheckUtils]: 76: Hoare triple {25751#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25752#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:39,624 INFO L273 TraceCheckUtils]: 77: Hoare triple {25752#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25752#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:39,625 INFO L273 TraceCheckUtils]: 78: Hoare triple {25752#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25752#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:39,625 INFO L273 TraceCheckUtils]: 79: Hoare triple {25752#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25753#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:39,626 INFO L273 TraceCheckUtils]: 80: Hoare triple {25753#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25753#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:39,626 INFO L273 TraceCheckUtils]: 81: Hoare triple {25753#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25753#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:39,627 INFO L273 TraceCheckUtils]: 82: Hoare triple {25753#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25754#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:39,628 INFO L273 TraceCheckUtils]: 83: Hoare triple {25754#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25754#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:39,628 INFO L273 TraceCheckUtils]: 84: Hoare triple {25754#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25754#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:39,629 INFO L273 TraceCheckUtils]: 85: Hoare triple {25754#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25755#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:39,629 INFO L273 TraceCheckUtils]: 86: Hoare triple {25755#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25755#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:39,630 INFO L273 TraceCheckUtils]: 87: Hoare triple {25755#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25755#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:39,631 INFO L273 TraceCheckUtils]: 88: Hoare triple {25755#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25756#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:39,631 INFO L273 TraceCheckUtils]: 89: Hoare triple {25756#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25756#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:39,632 INFO L273 TraceCheckUtils]: 90: Hoare triple {25756#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25756#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:39,632 INFO L273 TraceCheckUtils]: 91: Hoare triple {25756#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25757#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:39,633 INFO L273 TraceCheckUtils]: 92: Hoare triple {25757#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25757#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:39,633 INFO L273 TraceCheckUtils]: 93: Hoare triple {25757#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25757#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:39,634 INFO L273 TraceCheckUtils]: 94: Hoare triple {25757#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25758#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:39,635 INFO L273 TraceCheckUtils]: 95: Hoare triple {25758#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25758#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:39,635 INFO L273 TraceCheckUtils]: 96: Hoare triple {25758#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25758#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:39,636 INFO L273 TraceCheckUtils]: 97: Hoare triple {25758#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25759#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:39,636 INFO L273 TraceCheckUtils]: 98: Hoare triple {25759#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25759#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:39,637 INFO L273 TraceCheckUtils]: 99: Hoare triple {25759#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25759#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:39,638 INFO L273 TraceCheckUtils]: 100: Hoare triple {25759#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25760#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:39,638 INFO L273 TraceCheckUtils]: 101: Hoare triple {25760#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25760#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:39,639 INFO L273 TraceCheckUtils]: 102: Hoare triple {25760#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25760#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:39,639 INFO L273 TraceCheckUtils]: 103: Hoare triple {25760#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25761#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:39,640 INFO L273 TraceCheckUtils]: 104: Hoare triple {25761#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25761#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:39,640 INFO L273 TraceCheckUtils]: 105: Hoare triple {25761#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25761#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:39,641 INFO L273 TraceCheckUtils]: 106: Hoare triple {25761#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25762#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:39,642 INFO L273 TraceCheckUtils]: 107: Hoare triple {25762#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25762#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:39,642 INFO L273 TraceCheckUtils]: 108: Hoare triple {25762#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25762#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:39,643 INFO L273 TraceCheckUtils]: 109: Hoare triple {25762#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25763#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:39,643 INFO L273 TraceCheckUtils]: 110: Hoare triple {25763#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25763#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:39,644 INFO L273 TraceCheckUtils]: 111: Hoare triple {25763#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25763#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:39,644 INFO L273 TraceCheckUtils]: 112: Hoare triple {25763#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25764#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:39,645 INFO L273 TraceCheckUtils]: 113: Hoare triple {25764#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25764#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:39,645 INFO L273 TraceCheckUtils]: 114: Hoare triple {25764#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25764#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:39,646 INFO L273 TraceCheckUtils]: 115: Hoare triple {25764#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25765#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:39,647 INFO L273 TraceCheckUtils]: 116: Hoare triple {25765#(<= main_~i~0 38)} assume !(~i~0 < 100000); {25728#false} is VALID [2018-11-23 11:59:39,647 INFO L273 TraceCheckUtils]: 117: Hoare triple {25728#false} havoc ~x~0;~x~0 := 0; {25728#false} is VALID [2018-11-23 11:59:39,647 INFO L273 TraceCheckUtils]: 118: Hoare triple {25728#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {25728#false} is VALID [2018-11-23 11:59:39,647 INFO L256 TraceCheckUtils]: 119: Hoare triple {25728#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {25728#false} is VALID [2018-11-23 11:59:39,648 INFO L273 TraceCheckUtils]: 120: Hoare triple {25728#false} ~cond := #in~cond; {25728#false} is VALID [2018-11-23 11:59:39,648 INFO L273 TraceCheckUtils]: 121: Hoare triple {25728#false} assume 0 == ~cond; {25728#false} is VALID [2018-11-23 11:59:39,648 INFO L273 TraceCheckUtils]: 122: Hoare triple {25728#false} assume !false; {25728#false} is VALID [2018-11-23 11:59:39,664 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:39,664 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:39,664 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-23 11:59:39,673 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 11:59:39,783 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 37 check-sat command(s) [2018-11-23 11:59:39,784 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:39,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:39,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:40,766 INFO L256 TraceCheckUtils]: 0: Hoare triple {25727#true} call ULTIMATE.init(); {25727#true} is VALID [2018-11-23 11:59:40,766 INFO L273 TraceCheckUtils]: 1: Hoare triple {25727#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {25727#true} is VALID [2018-11-23 11:59:40,766 INFO L273 TraceCheckUtils]: 2: Hoare triple {25727#true} assume true; {25727#true} is VALID [2018-11-23 11:59:40,767 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {25727#true} {25727#true} #88#return; {25727#true} is VALID [2018-11-23 11:59:40,767 INFO L256 TraceCheckUtils]: 4: Hoare triple {25727#true} call #t~ret13 := main(); {25727#true} is VALID [2018-11-23 11:59:40,767 INFO L273 TraceCheckUtils]: 5: Hoare triple {25727#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {25727#true} is VALID [2018-11-23 11:59:40,767 INFO L273 TraceCheckUtils]: 6: Hoare triple {25727#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {25727#true} is VALID [2018-11-23 11:59:40,768 INFO L273 TraceCheckUtils]: 7: Hoare triple {25727#true} ~i~0 := 2; {25729#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:40,768 INFO L273 TraceCheckUtils]: 8: Hoare triple {25729#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25729#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:40,768 INFO L273 TraceCheckUtils]: 9: Hoare triple {25729#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25729#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:40,769 INFO L273 TraceCheckUtils]: 10: Hoare triple {25729#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25730#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:40,769 INFO L273 TraceCheckUtils]: 11: Hoare triple {25730#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25730#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:40,769 INFO L273 TraceCheckUtils]: 12: Hoare triple {25730#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25730#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:40,770 INFO L273 TraceCheckUtils]: 13: Hoare triple {25730#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25731#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:40,771 INFO L273 TraceCheckUtils]: 14: Hoare triple {25731#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25731#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:40,771 INFO L273 TraceCheckUtils]: 15: Hoare triple {25731#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25731#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:40,772 INFO L273 TraceCheckUtils]: 16: Hoare triple {25731#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25732#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:40,772 INFO L273 TraceCheckUtils]: 17: Hoare triple {25732#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25732#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:40,773 INFO L273 TraceCheckUtils]: 18: Hoare triple {25732#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25732#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:40,773 INFO L273 TraceCheckUtils]: 19: Hoare triple {25732#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25733#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:40,774 INFO L273 TraceCheckUtils]: 20: Hoare triple {25733#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25733#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:40,775 INFO L273 TraceCheckUtils]: 21: Hoare triple {25733#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25733#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:40,775 INFO L273 TraceCheckUtils]: 22: Hoare triple {25733#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25734#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:40,776 INFO L273 TraceCheckUtils]: 23: Hoare triple {25734#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25734#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:40,776 INFO L273 TraceCheckUtils]: 24: Hoare triple {25734#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25734#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:40,777 INFO L273 TraceCheckUtils]: 25: Hoare triple {25734#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25735#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:40,777 INFO L273 TraceCheckUtils]: 26: Hoare triple {25735#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25735#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:40,778 INFO L273 TraceCheckUtils]: 27: Hoare triple {25735#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25735#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:40,779 INFO L273 TraceCheckUtils]: 28: Hoare triple {25735#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25736#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:40,779 INFO L273 TraceCheckUtils]: 29: Hoare triple {25736#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25736#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:40,780 INFO L273 TraceCheckUtils]: 30: Hoare triple {25736#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25736#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:40,780 INFO L273 TraceCheckUtils]: 31: Hoare triple {25736#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25737#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:40,781 INFO L273 TraceCheckUtils]: 32: Hoare triple {25737#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25737#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:40,781 INFO L273 TraceCheckUtils]: 33: Hoare triple {25737#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25737#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:40,782 INFO L273 TraceCheckUtils]: 34: Hoare triple {25737#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25738#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:40,783 INFO L273 TraceCheckUtils]: 35: Hoare triple {25738#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25738#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:40,783 INFO L273 TraceCheckUtils]: 36: Hoare triple {25738#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25738#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:40,784 INFO L273 TraceCheckUtils]: 37: Hoare triple {25738#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25739#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:40,784 INFO L273 TraceCheckUtils]: 38: Hoare triple {25739#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25739#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:40,785 INFO L273 TraceCheckUtils]: 39: Hoare triple {25739#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25739#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:40,786 INFO L273 TraceCheckUtils]: 40: Hoare triple {25739#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25740#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:40,786 INFO L273 TraceCheckUtils]: 41: Hoare triple {25740#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25740#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:40,787 INFO L273 TraceCheckUtils]: 42: Hoare triple {25740#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25740#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:40,787 INFO L273 TraceCheckUtils]: 43: Hoare triple {25740#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25741#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:40,788 INFO L273 TraceCheckUtils]: 44: Hoare triple {25741#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25741#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:40,788 INFO L273 TraceCheckUtils]: 45: Hoare triple {25741#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25741#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:40,789 INFO L273 TraceCheckUtils]: 46: Hoare triple {25741#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25742#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:40,790 INFO L273 TraceCheckUtils]: 47: Hoare triple {25742#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25742#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:40,790 INFO L273 TraceCheckUtils]: 48: Hoare triple {25742#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25742#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:40,791 INFO L273 TraceCheckUtils]: 49: Hoare triple {25742#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25743#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:40,791 INFO L273 TraceCheckUtils]: 50: Hoare triple {25743#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25743#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:40,792 INFO L273 TraceCheckUtils]: 51: Hoare triple {25743#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25743#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:40,793 INFO L273 TraceCheckUtils]: 52: Hoare triple {25743#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25744#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:40,793 INFO L273 TraceCheckUtils]: 53: Hoare triple {25744#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25744#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:40,794 INFO L273 TraceCheckUtils]: 54: Hoare triple {25744#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25744#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:40,794 INFO L273 TraceCheckUtils]: 55: Hoare triple {25744#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25745#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:40,795 INFO L273 TraceCheckUtils]: 56: Hoare triple {25745#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25745#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:40,795 INFO L273 TraceCheckUtils]: 57: Hoare triple {25745#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25745#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:40,796 INFO L273 TraceCheckUtils]: 58: Hoare triple {25745#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25746#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:40,797 INFO L273 TraceCheckUtils]: 59: Hoare triple {25746#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25746#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:40,797 INFO L273 TraceCheckUtils]: 60: Hoare triple {25746#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25746#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:40,798 INFO L273 TraceCheckUtils]: 61: Hoare triple {25746#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25747#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:40,798 INFO L273 TraceCheckUtils]: 62: Hoare triple {25747#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25747#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:40,799 INFO L273 TraceCheckUtils]: 63: Hoare triple {25747#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25747#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:40,799 INFO L273 TraceCheckUtils]: 64: Hoare triple {25747#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25748#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:40,800 INFO L273 TraceCheckUtils]: 65: Hoare triple {25748#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25748#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:40,801 INFO L273 TraceCheckUtils]: 66: Hoare triple {25748#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25748#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:40,801 INFO L273 TraceCheckUtils]: 67: Hoare triple {25748#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25749#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:40,802 INFO L273 TraceCheckUtils]: 68: Hoare triple {25749#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25749#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:40,802 INFO L273 TraceCheckUtils]: 69: Hoare triple {25749#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25749#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:40,803 INFO L273 TraceCheckUtils]: 70: Hoare triple {25749#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25750#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:40,803 INFO L273 TraceCheckUtils]: 71: Hoare triple {25750#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25750#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:40,804 INFO L273 TraceCheckUtils]: 72: Hoare triple {25750#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25750#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:40,805 INFO L273 TraceCheckUtils]: 73: Hoare triple {25750#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25751#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:40,805 INFO L273 TraceCheckUtils]: 74: Hoare triple {25751#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25751#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:40,806 INFO L273 TraceCheckUtils]: 75: Hoare triple {25751#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25751#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:40,806 INFO L273 TraceCheckUtils]: 76: Hoare triple {25751#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25752#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:40,807 INFO L273 TraceCheckUtils]: 77: Hoare triple {25752#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25752#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:40,807 INFO L273 TraceCheckUtils]: 78: Hoare triple {25752#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25752#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:40,808 INFO L273 TraceCheckUtils]: 79: Hoare triple {25752#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25753#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:40,809 INFO L273 TraceCheckUtils]: 80: Hoare triple {25753#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25753#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:40,809 INFO L273 TraceCheckUtils]: 81: Hoare triple {25753#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25753#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:40,810 INFO L273 TraceCheckUtils]: 82: Hoare triple {25753#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25754#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:40,810 INFO L273 TraceCheckUtils]: 83: Hoare triple {25754#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25754#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:40,811 INFO L273 TraceCheckUtils]: 84: Hoare triple {25754#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25754#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:40,812 INFO L273 TraceCheckUtils]: 85: Hoare triple {25754#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25755#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:40,812 INFO L273 TraceCheckUtils]: 86: Hoare triple {25755#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25755#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:40,813 INFO L273 TraceCheckUtils]: 87: Hoare triple {25755#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25755#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:40,813 INFO L273 TraceCheckUtils]: 88: Hoare triple {25755#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25756#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:40,814 INFO L273 TraceCheckUtils]: 89: Hoare triple {25756#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25756#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:40,814 INFO L273 TraceCheckUtils]: 90: Hoare triple {25756#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25756#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:40,815 INFO L273 TraceCheckUtils]: 91: Hoare triple {25756#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25757#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:40,816 INFO L273 TraceCheckUtils]: 92: Hoare triple {25757#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25757#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:40,816 INFO L273 TraceCheckUtils]: 93: Hoare triple {25757#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25757#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:40,817 INFO L273 TraceCheckUtils]: 94: Hoare triple {25757#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25758#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:40,817 INFO L273 TraceCheckUtils]: 95: Hoare triple {25758#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25758#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:40,818 INFO L273 TraceCheckUtils]: 96: Hoare triple {25758#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25758#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:40,819 INFO L273 TraceCheckUtils]: 97: Hoare triple {25758#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25759#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:40,819 INFO L273 TraceCheckUtils]: 98: Hoare triple {25759#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25759#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:40,820 INFO L273 TraceCheckUtils]: 99: Hoare triple {25759#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25759#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:40,820 INFO L273 TraceCheckUtils]: 100: Hoare triple {25759#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25760#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:40,821 INFO L273 TraceCheckUtils]: 101: Hoare triple {25760#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25760#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:40,821 INFO L273 TraceCheckUtils]: 102: Hoare triple {25760#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25760#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:40,822 INFO L273 TraceCheckUtils]: 103: Hoare triple {25760#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25761#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:40,823 INFO L273 TraceCheckUtils]: 104: Hoare triple {25761#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25761#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:40,823 INFO L273 TraceCheckUtils]: 105: Hoare triple {25761#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25761#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:40,824 INFO L273 TraceCheckUtils]: 106: Hoare triple {25761#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25762#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:40,824 INFO L273 TraceCheckUtils]: 107: Hoare triple {25762#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25762#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:40,825 INFO L273 TraceCheckUtils]: 108: Hoare triple {25762#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25762#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:40,826 INFO L273 TraceCheckUtils]: 109: Hoare triple {25762#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25763#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:40,826 INFO L273 TraceCheckUtils]: 110: Hoare triple {25763#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25763#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:40,827 INFO L273 TraceCheckUtils]: 111: Hoare triple {25763#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25763#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:40,827 INFO L273 TraceCheckUtils]: 112: Hoare triple {25763#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25764#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:40,828 INFO L273 TraceCheckUtils]: 113: Hoare triple {25764#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {25764#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:40,828 INFO L273 TraceCheckUtils]: 114: Hoare triple {25764#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {25764#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:40,829 INFO L273 TraceCheckUtils]: 115: Hoare triple {25764#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {25765#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:40,830 INFO L273 TraceCheckUtils]: 116: Hoare triple {25765#(<= main_~i~0 38)} assume !(~i~0 < 100000); {25728#false} is VALID [2018-11-23 11:59:40,830 INFO L273 TraceCheckUtils]: 117: Hoare triple {25728#false} havoc ~x~0;~x~0 := 0; {25728#false} is VALID [2018-11-23 11:59:40,830 INFO L273 TraceCheckUtils]: 118: Hoare triple {25728#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {25728#false} is VALID [2018-11-23 11:59:40,830 INFO L256 TraceCheckUtils]: 119: Hoare triple {25728#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {25728#false} is VALID [2018-11-23 11:59:40,830 INFO L273 TraceCheckUtils]: 120: Hoare triple {25728#false} ~cond := #in~cond; {25728#false} is VALID [2018-11-23 11:59:40,831 INFO L273 TraceCheckUtils]: 121: Hoare triple {25728#false} assume 0 == ~cond; {25728#false} is VALID [2018-11-23 11:59:40,831 INFO L273 TraceCheckUtils]: 122: Hoare triple {25728#false} assume !false; {25728#false} is VALID [2018-11-23 11:59:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:40,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:40,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39] total 39 [2018-11-23 11:59:40,862 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 123 [2018-11-23 11:59:40,862 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:40,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states. [2018-11-23 11:59:40,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:40,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-11-23 11:59:40,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-11-23 11:59:40,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:59:40,982 INFO L87 Difference]: Start difference. First operand 170 states and 247 transitions. Second operand 39 states. [2018-11-23 11:59:42,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:42,366 INFO L93 Difference]: Finished difference Result 194 states and 279 transitions. [2018-11-23 11:59:42,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-11-23 11:59:42,366 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 123 [2018-11-23 11:59:42,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:59:42,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 279 transitions. [2018-11-23 11:59:42,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:59:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 279 transitions. [2018-11-23 11:59:42,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 39 states and 279 transitions. [2018-11-23 11:59:42,627 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 279 edges. 279 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:42,632 INFO L225 Difference]: With dead ends: 194 [2018-11-23 11:59:42,632 INFO L226 Difference]: Without dead ends: 177 [2018-11-23 11:59:42,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 11:59:42,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-11-23 11:59:42,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2018-11-23 11:59:42,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:42,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand 174 states. [2018-11-23 11:59:42,699 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand 174 states. [2018-11-23 11:59:42,700 INFO L87 Difference]: Start difference. First operand 177 states. Second operand 174 states. [2018-11-23 11:59:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:42,703 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2018-11-23 11:59:42,703 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 258 transitions. [2018-11-23 11:59:42,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:42,704 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:42,704 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand 177 states. [2018-11-23 11:59:42,704 INFO L87 Difference]: Start difference. First operand 174 states. Second operand 177 states. [2018-11-23 11:59:42,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:42,707 INFO L93 Difference]: Finished difference Result 177 states and 258 transitions. [2018-11-23 11:59:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 258 transitions. [2018-11-23 11:59:42,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:42,708 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:42,708 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:42,708 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:42,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-11-23 11:59:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 253 transitions. [2018-11-23 11:59:42,712 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 253 transitions. Word has length 123 [2018-11-23 11:59:42,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:42,712 INFO L480 AbstractCegarLoop]: Abstraction has 174 states and 253 transitions. [2018-11-23 11:59:42,712 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-11-23 11:59:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 253 transitions. [2018-11-23 11:59:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-11-23 11:59:42,713 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:42,713 INFO L402 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:42,714 INFO L423 AbstractCegarLoop]: === Iteration 39 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:42,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:42,714 INFO L82 PathProgramCache]: Analyzing trace with hash 2133384449, now seen corresponding path program 37 times [2018-11-23 11:59:42,714 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:42,714 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:42,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:42,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:42,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:42,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:43,601 INFO L256 TraceCheckUtils]: 0: Hoare triple {26955#true} call ULTIMATE.init(); {26955#true} is VALID [2018-11-23 11:59:43,602 INFO L273 TraceCheckUtils]: 1: Hoare triple {26955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26955#true} is VALID [2018-11-23 11:59:43,602 INFO L273 TraceCheckUtils]: 2: Hoare triple {26955#true} assume true; {26955#true} is VALID [2018-11-23 11:59:43,602 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26955#true} {26955#true} #88#return; {26955#true} is VALID [2018-11-23 11:59:43,602 INFO L256 TraceCheckUtils]: 4: Hoare triple {26955#true} call #t~ret13 := main(); {26955#true} is VALID [2018-11-23 11:59:43,603 INFO L273 TraceCheckUtils]: 5: Hoare triple {26955#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {26955#true} is VALID [2018-11-23 11:59:43,603 INFO L273 TraceCheckUtils]: 6: Hoare triple {26955#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {26955#true} is VALID [2018-11-23 11:59:43,603 INFO L273 TraceCheckUtils]: 7: Hoare triple {26955#true} ~i~0 := 2; {26957#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,604 INFO L273 TraceCheckUtils]: 8: Hoare triple {26957#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26957#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,604 INFO L273 TraceCheckUtils]: 9: Hoare triple {26957#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26957#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:43,605 INFO L273 TraceCheckUtils]: 10: Hoare triple {26957#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26958#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,605 INFO L273 TraceCheckUtils]: 11: Hoare triple {26958#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26958#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,605 INFO L273 TraceCheckUtils]: 12: Hoare triple {26958#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26958#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:43,606 INFO L273 TraceCheckUtils]: 13: Hoare triple {26958#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26959#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,606 INFO L273 TraceCheckUtils]: 14: Hoare triple {26959#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26959#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,607 INFO L273 TraceCheckUtils]: 15: Hoare triple {26959#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26959#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:43,607 INFO L273 TraceCheckUtils]: 16: Hoare triple {26959#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26960#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,608 INFO L273 TraceCheckUtils]: 17: Hoare triple {26960#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26960#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {26960#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26960#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:43,609 INFO L273 TraceCheckUtils]: 19: Hoare triple {26960#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26961#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,610 INFO L273 TraceCheckUtils]: 20: Hoare triple {26961#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26961#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,610 INFO L273 TraceCheckUtils]: 21: Hoare triple {26961#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26961#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:43,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {26961#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26962#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {26962#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26962#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,612 INFO L273 TraceCheckUtils]: 24: Hoare triple {26962#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26962#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:43,613 INFO L273 TraceCheckUtils]: 25: Hoare triple {26962#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26963#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:43,613 INFO L273 TraceCheckUtils]: 26: Hoare triple {26963#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26963#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:43,614 INFO L273 TraceCheckUtils]: 27: Hoare triple {26963#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26963#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:43,614 INFO L273 TraceCheckUtils]: 28: Hoare triple {26963#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26964#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:43,615 INFO L273 TraceCheckUtils]: 29: Hoare triple {26964#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26964#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:43,615 INFO L273 TraceCheckUtils]: 30: Hoare triple {26964#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26964#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:43,616 INFO L273 TraceCheckUtils]: 31: Hoare triple {26964#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26965#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:43,617 INFO L273 TraceCheckUtils]: 32: Hoare triple {26965#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26965#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:43,617 INFO L273 TraceCheckUtils]: 33: Hoare triple {26965#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26965#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:43,618 INFO L273 TraceCheckUtils]: 34: Hoare triple {26965#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26966#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:43,618 INFO L273 TraceCheckUtils]: 35: Hoare triple {26966#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26966#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:43,619 INFO L273 TraceCheckUtils]: 36: Hoare triple {26966#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26966#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:43,620 INFO L273 TraceCheckUtils]: 37: Hoare triple {26966#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26967#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:43,620 INFO L273 TraceCheckUtils]: 38: Hoare triple {26967#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26967#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:43,621 INFO L273 TraceCheckUtils]: 39: Hoare triple {26967#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26967#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:43,621 INFO L273 TraceCheckUtils]: 40: Hoare triple {26967#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26968#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:43,622 INFO L273 TraceCheckUtils]: 41: Hoare triple {26968#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26968#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:43,622 INFO L273 TraceCheckUtils]: 42: Hoare triple {26968#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26968#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:43,623 INFO L273 TraceCheckUtils]: 43: Hoare triple {26968#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26969#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:43,624 INFO L273 TraceCheckUtils]: 44: Hoare triple {26969#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26969#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:43,624 INFO L273 TraceCheckUtils]: 45: Hoare triple {26969#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26969#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:43,625 INFO L273 TraceCheckUtils]: 46: Hoare triple {26969#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26970#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:43,625 INFO L273 TraceCheckUtils]: 47: Hoare triple {26970#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26970#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:43,626 INFO L273 TraceCheckUtils]: 48: Hoare triple {26970#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26970#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:43,626 INFO L273 TraceCheckUtils]: 49: Hoare triple {26970#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26971#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:43,627 INFO L273 TraceCheckUtils]: 50: Hoare triple {26971#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26971#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:43,628 INFO L273 TraceCheckUtils]: 51: Hoare triple {26971#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26971#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:43,628 INFO L273 TraceCheckUtils]: 52: Hoare triple {26971#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26972#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:43,629 INFO L273 TraceCheckUtils]: 53: Hoare triple {26972#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26972#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:43,629 INFO L273 TraceCheckUtils]: 54: Hoare triple {26972#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26972#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:43,630 INFO L273 TraceCheckUtils]: 55: Hoare triple {26972#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26973#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:43,630 INFO L273 TraceCheckUtils]: 56: Hoare triple {26973#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26973#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:43,631 INFO L273 TraceCheckUtils]: 57: Hoare triple {26973#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26973#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:43,632 INFO L273 TraceCheckUtils]: 58: Hoare triple {26973#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26974#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:43,632 INFO L273 TraceCheckUtils]: 59: Hoare triple {26974#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26974#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:43,633 INFO L273 TraceCheckUtils]: 60: Hoare triple {26974#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26974#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:43,633 INFO L273 TraceCheckUtils]: 61: Hoare triple {26974#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26975#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:43,634 INFO L273 TraceCheckUtils]: 62: Hoare triple {26975#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26975#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:43,634 INFO L273 TraceCheckUtils]: 63: Hoare triple {26975#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26975#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:43,635 INFO L273 TraceCheckUtils]: 64: Hoare triple {26975#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26976#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:43,636 INFO L273 TraceCheckUtils]: 65: Hoare triple {26976#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26976#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:43,636 INFO L273 TraceCheckUtils]: 66: Hoare triple {26976#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26976#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:43,637 INFO L273 TraceCheckUtils]: 67: Hoare triple {26976#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26977#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:43,637 INFO L273 TraceCheckUtils]: 68: Hoare triple {26977#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26977#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:43,638 INFO L273 TraceCheckUtils]: 69: Hoare triple {26977#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26977#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:43,639 INFO L273 TraceCheckUtils]: 70: Hoare triple {26977#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26978#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:43,639 INFO L273 TraceCheckUtils]: 71: Hoare triple {26978#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26978#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:43,640 INFO L273 TraceCheckUtils]: 72: Hoare triple {26978#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26978#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:43,640 INFO L273 TraceCheckUtils]: 73: Hoare triple {26978#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26979#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:43,641 INFO L273 TraceCheckUtils]: 74: Hoare triple {26979#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26979#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:43,641 INFO L273 TraceCheckUtils]: 75: Hoare triple {26979#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26979#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:43,642 INFO L273 TraceCheckUtils]: 76: Hoare triple {26979#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26980#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:43,643 INFO L273 TraceCheckUtils]: 77: Hoare triple {26980#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26980#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:43,643 INFO L273 TraceCheckUtils]: 78: Hoare triple {26980#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26980#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:43,644 INFO L273 TraceCheckUtils]: 79: Hoare triple {26980#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26981#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:43,644 INFO L273 TraceCheckUtils]: 80: Hoare triple {26981#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26981#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:43,645 INFO L273 TraceCheckUtils]: 81: Hoare triple {26981#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26981#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:43,646 INFO L273 TraceCheckUtils]: 82: Hoare triple {26981#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26982#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:43,646 INFO L273 TraceCheckUtils]: 83: Hoare triple {26982#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26982#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:43,647 INFO L273 TraceCheckUtils]: 84: Hoare triple {26982#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26982#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:43,647 INFO L273 TraceCheckUtils]: 85: Hoare triple {26982#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26983#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:43,648 INFO L273 TraceCheckUtils]: 86: Hoare triple {26983#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26983#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:43,648 INFO L273 TraceCheckUtils]: 87: Hoare triple {26983#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26983#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:43,649 INFO L273 TraceCheckUtils]: 88: Hoare triple {26983#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26984#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:43,650 INFO L273 TraceCheckUtils]: 89: Hoare triple {26984#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26984#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:43,650 INFO L273 TraceCheckUtils]: 90: Hoare triple {26984#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26984#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:43,651 INFO L273 TraceCheckUtils]: 91: Hoare triple {26984#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26985#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:43,651 INFO L273 TraceCheckUtils]: 92: Hoare triple {26985#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26985#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:43,652 INFO L273 TraceCheckUtils]: 93: Hoare triple {26985#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26985#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:43,653 INFO L273 TraceCheckUtils]: 94: Hoare triple {26985#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26986#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:43,653 INFO L273 TraceCheckUtils]: 95: Hoare triple {26986#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26986#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:43,653 INFO L273 TraceCheckUtils]: 96: Hoare triple {26986#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26986#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:43,654 INFO L273 TraceCheckUtils]: 97: Hoare triple {26986#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26987#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:43,655 INFO L273 TraceCheckUtils]: 98: Hoare triple {26987#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26987#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:43,655 INFO L273 TraceCheckUtils]: 99: Hoare triple {26987#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26987#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:43,656 INFO L273 TraceCheckUtils]: 100: Hoare triple {26987#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26988#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:43,656 INFO L273 TraceCheckUtils]: 101: Hoare triple {26988#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26988#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:43,657 INFO L273 TraceCheckUtils]: 102: Hoare triple {26988#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26988#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:43,658 INFO L273 TraceCheckUtils]: 103: Hoare triple {26988#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26989#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:43,658 INFO L273 TraceCheckUtils]: 104: Hoare triple {26989#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26989#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:43,659 INFO L273 TraceCheckUtils]: 105: Hoare triple {26989#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26989#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:43,659 INFO L273 TraceCheckUtils]: 106: Hoare triple {26989#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26990#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:43,660 INFO L273 TraceCheckUtils]: 107: Hoare triple {26990#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26990#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:43,660 INFO L273 TraceCheckUtils]: 108: Hoare triple {26990#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26990#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:43,661 INFO L273 TraceCheckUtils]: 109: Hoare triple {26990#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26991#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:43,662 INFO L273 TraceCheckUtils]: 110: Hoare triple {26991#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26991#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:43,662 INFO L273 TraceCheckUtils]: 111: Hoare triple {26991#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26991#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:43,663 INFO L273 TraceCheckUtils]: 112: Hoare triple {26991#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26992#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:43,663 INFO L273 TraceCheckUtils]: 113: Hoare triple {26992#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26992#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:43,664 INFO L273 TraceCheckUtils]: 114: Hoare triple {26992#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26992#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:43,664 INFO L273 TraceCheckUtils]: 115: Hoare triple {26992#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26993#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:43,665 INFO L273 TraceCheckUtils]: 116: Hoare triple {26993#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26993#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:43,665 INFO L273 TraceCheckUtils]: 117: Hoare triple {26993#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26993#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:43,666 INFO L273 TraceCheckUtils]: 118: Hoare triple {26993#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26994#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:43,667 INFO L273 TraceCheckUtils]: 119: Hoare triple {26994#(<= main_~i~0 39)} assume !(~i~0 < 100000); {26956#false} is VALID [2018-11-23 11:59:43,667 INFO L273 TraceCheckUtils]: 120: Hoare triple {26956#false} havoc ~x~0;~x~0 := 0; {26956#false} is VALID [2018-11-23 11:59:43,667 INFO L273 TraceCheckUtils]: 121: Hoare triple {26956#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {26956#false} is VALID [2018-11-23 11:59:43,667 INFO L256 TraceCheckUtils]: 122: Hoare triple {26956#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {26956#false} is VALID [2018-11-23 11:59:43,668 INFO L273 TraceCheckUtils]: 123: Hoare triple {26956#false} ~cond := #in~cond; {26956#false} is VALID [2018-11-23 11:59:43,668 INFO L273 TraceCheckUtils]: 124: Hoare triple {26956#false} assume 0 == ~cond; {26956#false} is VALID [2018-11-23 11:59:43,668 INFO L273 TraceCheckUtils]: 125: Hoare triple {26956#false} assume !false; {26956#false} is VALID [2018-11-23 11:59:43,680 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:43,680 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:43,680 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-23 11:59:43,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:43,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:43,786 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:44,313 INFO L256 TraceCheckUtils]: 0: Hoare triple {26955#true} call ULTIMATE.init(); {26955#true} is VALID [2018-11-23 11:59:44,313 INFO L273 TraceCheckUtils]: 1: Hoare triple {26955#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {26955#true} is VALID [2018-11-23 11:59:44,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {26955#true} assume true; {26955#true} is VALID [2018-11-23 11:59:44,314 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {26955#true} {26955#true} #88#return; {26955#true} is VALID [2018-11-23 11:59:44,314 INFO L256 TraceCheckUtils]: 4: Hoare triple {26955#true} call #t~ret13 := main(); {26955#true} is VALID [2018-11-23 11:59:44,314 INFO L273 TraceCheckUtils]: 5: Hoare triple {26955#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {26955#true} is VALID [2018-11-23 11:59:44,314 INFO L273 TraceCheckUtils]: 6: Hoare triple {26955#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {26955#true} is VALID [2018-11-23 11:59:44,315 INFO L273 TraceCheckUtils]: 7: Hoare triple {26955#true} ~i~0 := 2; {26957#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:44,315 INFO L273 TraceCheckUtils]: 8: Hoare triple {26957#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26957#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:44,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {26957#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26957#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:44,316 INFO L273 TraceCheckUtils]: 10: Hoare triple {26957#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26958#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:44,316 INFO L273 TraceCheckUtils]: 11: Hoare triple {26958#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26958#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:44,317 INFO L273 TraceCheckUtils]: 12: Hoare triple {26958#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26958#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:44,317 INFO L273 TraceCheckUtils]: 13: Hoare triple {26958#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26959#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:44,318 INFO L273 TraceCheckUtils]: 14: Hoare triple {26959#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26959#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:44,318 INFO L273 TraceCheckUtils]: 15: Hoare triple {26959#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26959#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:44,319 INFO L273 TraceCheckUtils]: 16: Hoare triple {26959#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26960#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:44,319 INFO L273 TraceCheckUtils]: 17: Hoare triple {26960#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26960#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:44,320 INFO L273 TraceCheckUtils]: 18: Hoare triple {26960#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26960#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:44,320 INFO L273 TraceCheckUtils]: 19: Hoare triple {26960#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26961#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:44,321 INFO L273 TraceCheckUtils]: 20: Hoare triple {26961#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26961#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:44,321 INFO L273 TraceCheckUtils]: 21: Hoare triple {26961#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26961#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:44,322 INFO L273 TraceCheckUtils]: 22: Hoare triple {26961#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26962#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:44,323 INFO L273 TraceCheckUtils]: 23: Hoare triple {26962#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26962#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:44,323 INFO L273 TraceCheckUtils]: 24: Hoare triple {26962#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26962#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:44,324 INFO L273 TraceCheckUtils]: 25: Hoare triple {26962#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26963#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:44,324 INFO L273 TraceCheckUtils]: 26: Hoare triple {26963#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26963#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:44,325 INFO L273 TraceCheckUtils]: 27: Hoare triple {26963#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26963#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:44,325 INFO L273 TraceCheckUtils]: 28: Hoare triple {26963#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26964#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:44,326 INFO L273 TraceCheckUtils]: 29: Hoare triple {26964#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26964#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:44,326 INFO L273 TraceCheckUtils]: 30: Hoare triple {26964#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26964#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:44,327 INFO L273 TraceCheckUtils]: 31: Hoare triple {26964#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26965#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:44,328 INFO L273 TraceCheckUtils]: 32: Hoare triple {26965#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26965#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:44,328 INFO L273 TraceCheckUtils]: 33: Hoare triple {26965#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26965#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:44,329 INFO L273 TraceCheckUtils]: 34: Hoare triple {26965#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26966#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:44,329 INFO L273 TraceCheckUtils]: 35: Hoare triple {26966#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26966#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:44,330 INFO L273 TraceCheckUtils]: 36: Hoare triple {26966#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26966#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:44,330 INFO L273 TraceCheckUtils]: 37: Hoare triple {26966#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26967#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:44,331 INFO L273 TraceCheckUtils]: 38: Hoare triple {26967#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26967#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:44,331 INFO L273 TraceCheckUtils]: 39: Hoare triple {26967#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26967#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:44,332 INFO L273 TraceCheckUtils]: 40: Hoare triple {26967#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26968#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:44,333 INFO L273 TraceCheckUtils]: 41: Hoare triple {26968#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26968#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:44,333 INFO L273 TraceCheckUtils]: 42: Hoare triple {26968#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26968#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:44,334 INFO L273 TraceCheckUtils]: 43: Hoare triple {26968#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26969#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:44,334 INFO L273 TraceCheckUtils]: 44: Hoare triple {26969#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26969#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:44,335 INFO L273 TraceCheckUtils]: 45: Hoare triple {26969#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26969#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:44,335 INFO L273 TraceCheckUtils]: 46: Hoare triple {26969#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26970#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:44,336 INFO L273 TraceCheckUtils]: 47: Hoare triple {26970#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26970#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:44,336 INFO L273 TraceCheckUtils]: 48: Hoare triple {26970#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26970#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:44,337 INFO L273 TraceCheckUtils]: 49: Hoare triple {26970#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26971#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:44,338 INFO L273 TraceCheckUtils]: 50: Hoare triple {26971#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26971#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:44,338 INFO L273 TraceCheckUtils]: 51: Hoare triple {26971#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26971#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:44,339 INFO L273 TraceCheckUtils]: 52: Hoare triple {26971#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26972#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:44,339 INFO L273 TraceCheckUtils]: 53: Hoare triple {26972#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26972#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:44,340 INFO L273 TraceCheckUtils]: 54: Hoare triple {26972#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26972#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:44,340 INFO L273 TraceCheckUtils]: 55: Hoare triple {26972#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26973#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:44,341 INFO L273 TraceCheckUtils]: 56: Hoare triple {26973#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26973#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:44,341 INFO L273 TraceCheckUtils]: 57: Hoare triple {26973#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26973#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:44,342 INFO L273 TraceCheckUtils]: 58: Hoare triple {26973#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26974#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:44,342 INFO L273 TraceCheckUtils]: 59: Hoare triple {26974#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26974#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:44,343 INFO L273 TraceCheckUtils]: 60: Hoare triple {26974#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26974#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:44,344 INFO L273 TraceCheckUtils]: 61: Hoare triple {26974#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26975#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:44,344 INFO L273 TraceCheckUtils]: 62: Hoare triple {26975#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26975#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:44,345 INFO L273 TraceCheckUtils]: 63: Hoare triple {26975#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26975#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:44,345 INFO L273 TraceCheckUtils]: 64: Hoare triple {26975#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26976#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:44,346 INFO L273 TraceCheckUtils]: 65: Hoare triple {26976#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26976#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:44,346 INFO L273 TraceCheckUtils]: 66: Hoare triple {26976#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26976#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:44,347 INFO L273 TraceCheckUtils]: 67: Hoare triple {26976#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26977#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:44,348 INFO L273 TraceCheckUtils]: 68: Hoare triple {26977#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26977#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:44,348 INFO L273 TraceCheckUtils]: 69: Hoare triple {26977#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26977#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:44,349 INFO L273 TraceCheckUtils]: 70: Hoare triple {26977#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26978#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:44,349 INFO L273 TraceCheckUtils]: 71: Hoare triple {26978#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26978#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:44,350 INFO L273 TraceCheckUtils]: 72: Hoare triple {26978#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26978#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:44,351 INFO L273 TraceCheckUtils]: 73: Hoare triple {26978#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26979#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:44,351 INFO L273 TraceCheckUtils]: 74: Hoare triple {26979#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26979#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:44,351 INFO L273 TraceCheckUtils]: 75: Hoare triple {26979#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26979#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:44,352 INFO L273 TraceCheckUtils]: 76: Hoare triple {26979#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26980#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:44,353 INFO L273 TraceCheckUtils]: 77: Hoare triple {26980#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26980#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:44,353 INFO L273 TraceCheckUtils]: 78: Hoare triple {26980#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26980#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:44,354 INFO L273 TraceCheckUtils]: 79: Hoare triple {26980#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26981#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:44,354 INFO L273 TraceCheckUtils]: 80: Hoare triple {26981#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26981#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:44,355 INFO L273 TraceCheckUtils]: 81: Hoare triple {26981#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26981#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:44,355 INFO L273 TraceCheckUtils]: 82: Hoare triple {26981#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26982#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:44,356 INFO L273 TraceCheckUtils]: 83: Hoare triple {26982#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26982#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:44,356 INFO L273 TraceCheckUtils]: 84: Hoare triple {26982#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26982#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:44,357 INFO L273 TraceCheckUtils]: 85: Hoare triple {26982#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26983#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:44,358 INFO L273 TraceCheckUtils]: 86: Hoare triple {26983#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26983#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:44,358 INFO L273 TraceCheckUtils]: 87: Hoare triple {26983#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26983#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:44,359 INFO L273 TraceCheckUtils]: 88: Hoare triple {26983#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26984#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:44,359 INFO L273 TraceCheckUtils]: 89: Hoare triple {26984#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26984#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:44,360 INFO L273 TraceCheckUtils]: 90: Hoare triple {26984#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26984#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:44,360 INFO L273 TraceCheckUtils]: 91: Hoare triple {26984#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26985#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:44,361 INFO L273 TraceCheckUtils]: 92: Hoare triple {26985#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26985#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:44,361 INFO L273 TraceCheckUtils]: 93: Hoare triple {26985#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26985#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:44,362 INFO L273 TraceCheckUtils]: 94: Hoare triple {26985#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26986#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:44,363 INFO L273 TraceCheckUtils]: 95: Hoare triple {26986#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26986#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:44,363 INFO L273 TraceCheckUtils]: 96: Hoare triple {26986#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26986#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:44,364 INFO L273 TraceCheckUtils]: 97: Hoare triple {26986#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26987#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:44,364 INFO L273 TraceCheckUtils]: 98: Hoare triple {26987#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26987#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:44,365 INFO L273 TraceCheckUtils]: 99: Hoare triple {26987#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26987#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:44,366 INFO L273 TraceCheckUtils]: 100: Hoare triple {26987#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26988#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:44,366 INFO L273 TraceCheckUtils]: 101: Hoare triple {26988#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26988#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:44,367 INFO L273 TraceCheckUtils]: 102: Hoare triple {26988#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26988#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:44,367 INFO L273 TraceCheckUtils]: 103: Hoare triple {26988#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26989#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:44,368 INFO L273 TraceCheckUtils]: 104: Hoare triple {26989#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26989#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:44,368 INFO L273 TraceCheckUtils]: 105: Hoare triple {26989#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26989#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:44,369 INFO L273 TraceCheckUtils]: 106: Hoare triple {26989#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26990#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:44,370 INFO L273 TraceCheckUtils]: 107: Hoare triple {26990#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26990#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:44,370 INFO L273 TraceCheckUtils]: 108: Hoare triple {26990#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26990#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:44,371 INFO L273 TraceCheckUtils]: 109: Hoare triple {26990#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26991#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:44,371 INFO L273 TraceCheckUtils]: 110: Hoare triple {26991#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26991#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:44,372 INFO L273 TraceCheckUtils]: 111: Hoare triple {26991#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26991#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:44,373 INFO L273 TraceCheckUtils]: 112: Hoare triple {26991#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26992#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:44,375 INFO L273 TraceCheckUtils]: 113: Hoare triple {26992#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26992#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:44,375 INFO L273 TraceCheckUtils]: 114: Hoare triple {26992#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26992#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:44,376 INFO L273 TraceCheckUtils]: 115: Hoare triple {26992#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26993#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:44,376 INFO L273 TraceCheckUtils]: 116: Hoare triple {26993#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {26993#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:44,376 INFO L273 TraceCheckUtils]: 117: Hoare triple {26993#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {26993#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:44,377 INFO L273 TraceCheckUtils]: 118: Hoare triple {26993#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {26994#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:44,377 INFO L273 TraceCheckUtils]: 119: Hoare triple {26994#(<= main_~i~0 39)} assume !(~i~0 < 100000); {26956#false} is VALID [2018-11-23 11:59:44,377 INFO L273 TraceCheckUtils]: 120: Hoare triple {26956#false} havoc ~x~0;~x~0 := 0; {26956#false} is VALID [2018-11-23 11:59:44,378 INFO L273 TraceCheckUtils]: 121: Hoare triple {26956#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {26956#false} is VALID [2018-11-23 11:59:44,378 INFO L256 TraceCheckUtils]: 122: Hoare triple {26956#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {26956#false} is VALID [2018-11-23 11:59:44,378 INFO L273 TraceCheckUtils]: 123: Hoare triple {26956#false} ~cond := #in~cond; {26956#false} is VALID [2018-11-23 11:59:44,378 INFO L273 TraceCheckUtils]: 124: Hoare triple {26956#false} assume 0 == ~cond; {26956#false} is VALID [2018-11-23 11:59:44,378 INFO L273 TraceCheckUtils]: 125: Hoare triple {26956#false} assume !false; {26956#false} is VALID [2018-11-23 11:59:44,390 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:44,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:44,409 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40] total 40 [2018-11-23 11:59:44,410 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 126 [2018-11-23 11:59:44,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:44,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states. [2018-11-23 11:59:44,543 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:44,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-11-23 11:59:44,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-11-23 11:59:44,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:59:44,545 INFO L87 Difference]: Start difference. First operand 174 states and 253 transitions. Second operand 40 states. [2018-11-23 11:59:45,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:45,938 INFO L93 Difference]: Finished difference Result 198 states and 285 transitions. [2018-11-23 11:59:45,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-11-23 11:59:45,938 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 126 [2018-11-23 11:59:45,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:45,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:59:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 285 transitions. [2018-11-23 11:59:45,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:59:45,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 285 transitions. [2018-11-23 11:59:45,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 285 transitions. [2018-11-23 11:59:46,211 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:46,215 INFO L225 Difference]: With dead ends: 198 [2018-11-23 11:59:46,215 INFO L226 Difference]: Without dead ends: 181 [2018-11-23 11:59:46,216 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:59:46,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-11-23 11:59:46,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2018-11-23 11:59:46,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:46,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand 178 states. [2018-11-23 11:59:46,245 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 178 states. [2018-11-23 11:59:46,246 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 178 states. [2018-11-23 11:59:46,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:46,249 INFO L93 Difference]: Finished difference Result 181 states and 264 transitions. [2018-11-23 11:59:46,249 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 264 transitions. [2018-11-23 11:59:46,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:46,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:46,249 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand 181 states. [2018-11-23 11:59:46,250 INFO L87 Difference]: Start difference. First operand 178 states. Second operand 181 states. [2018-11-23 11:59:46,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:46,253 INFO L93 Difference]: Finished difference Result 181 states and 264 transitions. [2018-11-23 11:59:46,253 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 264 transitions. [2018-11-23 11:59:46,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:46,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:46,253 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:46,253 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:46,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-23 11:59:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 259 transitions. [2018-11-23 11:59:46,257 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 259 transitions. Word has length 126 [2018-11-23 11:59:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:46,257 INFO L480 AbstractCegarLoop]: Abstraction has 178 states and 259 transitions. [2018-11-23 11:59:46,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-11-23 11:59:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 259 transitions. [2018-11-23 11:59:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-11-23 11:59:46,258 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:46,258 INFO L402 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:46,258 INFO L423 AbstractCegarLoop]: === Iteration 40 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:46,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:46,259 INFO L82 PathProgramCache]: Analyzing trace with hash -620144132, now seen corresponding path program 38 times [2018-11-23 11:59:46,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:46,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:46,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:46,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:59:46,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:47,180 INFO L256 TraceCheckUtils]: 0: Hoare triple {28211#true} call ULTIMATE.init(); {28211#true} is VALID [2018-11-23 11:59:47,180 INFO L273 TraceCheckUtils]: 1: Hoare triple {28211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28211#true} is VALID [2018-11-23 11:59:47,181 INFO L273 TraceCheckUtils]: 2: Hoare triple {28211#true} assume true; {28211#true} is VALID [2018-11-23 11:59:47,181 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28211#true} {28211#true} #88#return; {28211#true} is VALID [2018-11-23 11:59:47,181 INFO L256 TraceCheckUtils]: 4: Hoare triple {28211#true} call #t~ret13 := main(); {28211#true} is VALID [2018-11-23 11:59:47,181 INFO L273 TraceCheckUtils]: 5: Hoare triple {28211#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {28211#true} is VALID [2018-11-23 11:59:47,181 INFO L273 TraceCheckUtils]: 6: Hoare triple {28211#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {28211#true} is VALID [2018-11-23 11:59:47,182 INFO L273 TraceCheckUtils]: 7: Hoare triple {28211#true} ~i~0 := 2; {28213#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,182 INFO L273 TraceCheckUtils]: 8: Hoare triple {28213#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28213#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,183 INFO L273 TraceCheckUtils]: 9: Hoare triple {28213#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28213#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,183 INFO L273 TraceCheckUtils]: 10: Hoare triple {28213#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28214#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,184 INFO L273 TraceCheckUtils]: 11: Hoare triple {28214#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28214#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,184 INFO L273 TraceCheckUtils]: 12: Hoare triple {28214#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28214#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,184 INFO L273 TraceCheckUtils]: 13: Hoare triple {28214#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28215#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,185 INFO L273 TraceCheckUtils]: 14: Hoare triple {28215#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28215#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,185 INFO L273 TraceCheckUtils]: 15: Hoare triple {28215#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28215#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,186 INFO L273 TraceCheckUtils]: 16: Hoare triple {28215#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28216#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,205 INFO L273 TraceCheckUtils]: 17: Hoare triple {28216#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28216#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,213 INFO L273 TraceCheckUtils]: 18: Hoare triple {28216#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28216#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,229 INFO L273 TraceCheckUtils]: 19: Hoare triple {28216#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28217#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,235 INFO L273 TraceCheckUtils]: 20: Hoare triple {28217#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28217#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,235 INFO L273 TraceCheckUtils]: 21: Hoare triple {28217#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28217#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,236 INFO L273 TraceCheckUtils]: 22: Hoare triple {28217#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28218#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,236 INFO L273 TraceCheckUtils]: 23: Hoare triple {28218#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28218#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,236 INFO L273 TraceCheckUtils]: 24: Hoare triple {28218#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28218#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,237 INFO L273 TraceCheckUtils]: 25: Hoare triple {28218#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28219#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,237 INFO L273 TraceCheckUtils]: 26: Hoare triple {28219#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28219#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,237 INFO L273 TraceCheckUtils]: 27: Hoare triple {28219#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28219#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,238 INFO L273 TraceCheckUtils]: 28: Hoare triple {28219#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28220#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,238 INFO L273 TraceCheckUtils]: 29: Hoare triple {28220#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28220#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,238 INFO L273 TraceCheckUtils]: 30: Hoare triple {28220#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28220#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,239 INFO L273 TraceCheckUtils]: 31: Hoare triple {28220#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28221#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,239 INFO L273 TraceCheckUtils]: 32: Hoare triple {28221#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28221#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,240 INFO L273 TraceCheckUtils]: 33: Hoare triple {28221#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28221#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,240 INFO L273 TraceCheckUtils]: 34: Hoare triple {28221#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28222#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,241 INFO L273 TraceCheckUtils]: 35: Hoare triple {28222#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28222#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,241 INFO L273 TraceCheckUtils]: 36: Hoare triple {28222#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28222#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,242 INFO L273 TraceCheckUtils]: 37: Hoare triple {28222#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28223#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,243 INFO L273 TraceCheckUtils]: 38: Hoare triple {28223#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28223#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,243 INFO L273 TraceCheckUtils]: 39: Hoare triple {28223#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28223#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,244 INFO L273 TraceCheckUtils]: 40: Hoare triple {28223#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28224#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,244 INFO L273 TraceCheckUtils]: 41: Hoare triple {28224#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28224#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,245 INFO L273 TraceCheckUtils]: 42: Hoare triple {28224#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28224#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,246 INFO L273 TraceCheckUtils]: 43: Hoare triple {28224#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28225#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,246 INFO L273 TraceCheckUtils]: 44: Hoare triple {28225#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28225#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,247 INFO L273 TraceCheckUtils]: 45: Hoare triple {28225#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28225#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,247 INFO L273 TraceCheckUtils]: 46: Hoare triple {28225#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28226#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,248 INFO L273 TraceCheckUtils]: 47: Hoare triple {28226#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28226#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,248 INFO L273 TraceCheckUtils]: 48: Hoare triple {28226#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28226#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,249 INFO L273 TraceCheckUtils]: 49: Hoare triple {28226#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28227#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,250 INFO L273 TraceCheckUtils]: 50: Hoare triple {28227#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28227#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,250 INFO L273 TraceCheckUtils]: 51: Hoare triple {28227#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28227#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,251 INFO L273 TraceCheckUtils]: 52: Hoare triple {28227#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28228#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,251 INFO L273 TraceCheckUtils]: 53: Hoare triple {28228#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28228#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,252 INFO L273 TraceCheckUtils]: 54: Hoare triple {28228#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28228#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,253 INFO L273 TraceCheckUtils]: 55: Hoare triple {28228#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28229#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,253 INFO L273 TraceCheckUtils]: 56: Hoare triple {28229#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28229#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,254 INFO L273 TraceCheckUtils]: 57: Hoare triple {28229#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28229#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,254 INFO L273 TraceCheckUtils]: 58: Hoare triple {28229#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28230#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,255 INFO L273 TraceCheckUtils]: 59: Hoare triple {28230#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28230#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,255 INFO L273 TraceCheckUtils]: 60: Hoare triple {28230#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28230#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,256 INFO L273 TraceCheckUtils]: 61: Hoare triple {28230#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28231#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,256 INFO L273 TraceCheckUtils]: 62: Hoare triple {28231#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28231#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,257 INFO L273 TraceCheckUtils]: 63: Hoare triple {28231#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28231#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,258 INFO L273 TraceCheckUtils]: 64: Hoare triple {28231#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28232#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,258 INFO L273 TraceCheckUtils]: 65: Hoare triple {28232#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28232#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,259 INFO L273 TraceCheckUtils]: 66: Hoare triple {28232#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28232#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,259 INFO L273 TraceCheckUtils]: 67: Hoare triple {28232#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28233#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,260 INFO L273 TraceCheckUtils]: 68: Hoare triple {28233#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28233#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,260 INFO L273 TraceCheckUtils]: 69: Hoare triple {28233#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28233#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,261 INFO L273 TraceCheckUtils]: 70: Hoare triple {28233#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28234#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,262 INFO L273 TraceCheckUtils]: 71: Hoare triple {28234#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28234#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,262 INFO L273 TraceCheckUtils]: 72: Hoare triple {28234#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28234#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,263 INFO L273 TraceCheckUtils]: 73: Hoare triple {28234#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28235#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,263 INFO L273 TraceCheckUtils]: 74: Hoare triple {28235#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28235#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,264 INFO L273 TraceCheckUtils]: 75: Hoare triple {28235#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28235#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,265 INFO L273 TraceCheckUtils]: 76: Hoare triple {28235#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28236#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,265 INFO L273 TraceCheckUtils]: 77: Hoare triple {28236#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28236#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,266 INFO L273 TraceCheckUtils]: 78: Hoare triple {28236#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28236#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,266 INFO L273 TraceCheckUtils]: 79: Hoare triple {28236#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28237#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,267 INFO L273 TraceCheckUtils]: 80: Hoare triple {28237#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28237#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,267 INFO L273 TraceCheckUtils]: 81: Hoare triple {28237#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28237#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,268 INFO L273 TraceCheckUtils]: 82: Hoare triple {28237#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28238#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,269 INFO L273 TraceCheckUtils]: 83: Hoare triple {28238#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28238#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,269 INFO L273 TraceCheckUtils]: 84: Hoare triple {28238#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28238#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,270 INFO L273 TraceCheckUtils]: 85: Hoare triple {28238#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28239#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,270 INFO L273 TraceCheckUtils]: 86: Hoare triple {28239#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28239#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,271 INFO L273 TraceCheckUtils]: 87: Hoare triple {28239#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28239#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,272 INFO L273 TraceCheckUtils]: 88: Hoare triple {28239#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28240#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,272 INFO L273 TraceCheckUtils]: 89: Hoare triple {28240#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28240#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,273 INFO L273 TraceCheckUtils]: 90: Hoare triple {28240#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28240#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,273 INFO L273 TraceCheckUtils]: 91: Hoare triple {28240#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28241#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:47,274 INFO L273 TraceCheckUtils]: 92: Hoare triple {28241#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28241#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:47,274 INFO L273 TraceCheckUtils]: 93: Hoare triple {28241#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28241#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:47,275 INFO L273 TraceCheckUtils]: 94: Hoare triple {28241#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28242#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:47,275 INFO L273 TraceCheckUtils]: 95: Hoare triple {28242#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28242#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:47,276 INFO L273 TraceCheckUtils]: 96: Hoare triple {28242#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28242#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:47,277 INFO L273 TraceCheckUtils]: 97: Hoare triple {28242#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28243#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:47,277 INFO L273 TraceCheckUtils]: 98: Hoare triple {28243#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28243#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:47,278 INFO L273 TraceCheckUtils]: 99: Hoare triple {28243#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28243#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:47,278 INFO L273 TraceCheckUtils]: 100: Hoare triple {28243#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28244#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:47,279 INFO L273 TraceCheckUtils]: 101: Hoare triple {28244#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28244#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:47,279 INFO L273 TraceCheckUtils]: 102: Hoare triple {28244#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28244#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:47,280 INFO L273 TraceCheckUtils]: 103: Hoare triple {28244#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28245#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:47,281 INFO L273 TraceCheckUtils]: 104: Hoare triple {28245#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28245#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:47,281 INFO L273 TraceCheckUtils]: 105: Hoare triple {28245#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28245#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:47,282 INFO L273 TraceCheckUtils]: 106: Hoare triple {28245#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28246#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:47,282 INFO L273 TraceCheckUtils]: 107: Hoare triple {28246#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28246#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:47,283 INFO L273 TraceCheckUtils]: 108: Hoare triple {28246#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28246#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:47,284 INFO L273 TraceCheckUtils]: 109: Hoare triple {28246#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28247#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:47,284 INFO L273 TraceCheckUtils]: 110: Hoare triple {28247#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28247#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:47,285 INFO L273 TraceCheckUtils]: 111: Hoare triple {28247#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28247#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:47,285 INFO L273 TraceCheckUtils]: 112: Hoare triple {28247#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28248#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:47,286 INFO L273 TraceCheckUtils]: 113: Hoare triple {28248#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28248#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:47,286 INFO L273 TraceCheckUtils]: 114: Hoare triple {28248#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28248#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:47,287 INFO L273 TraceCheckUtils]: 115: Hoare triple {28248#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28249#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:47,288 INFO L273 TraceCheckUtils]: 116: Hoare triple {28249#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28249#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:47,288 INFO L273 TraceCheckUtils]: 117: Hoare triple {28249#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28249#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:47,289 INFO L273 TraceCheckUtils]: 118: Hoare triple {28249#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28250#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:47,289 INFO L273 TraceCheckUtils]: 119: Hoare triple {28250#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28250#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:47,290 INFO L273 TraceCheckUtils]: 120: Hoare triple {28250#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28250#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:47,291 INFO L273 TraceCheckUtils]: 121: Hoare triple {28250#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28251#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:47,291 INFO L273 TraceCheckUtils]: 122: Hoare triple {28251#(<= main_~i~0 40)} assume !(~i~0 < 100000); {28212#false} is VALID [2018-11-23 11:59:47,291 INFO L273 TraceCheckUtils]: 123: Hoare triple {28212#false} havoc ~x~0;~x~0 := 0; {28212#false} is VALID [2018-11-23 11:59:47,292 INFO L273 TraceCheckUtils]: 124: Hoare triple {28212#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {28212#false} is VALID [2018-11-23 11:59:47,292 INFO L256 TraceCheckUtils]: 125: Hoare triple {28212#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {28212#false} is VALID [2018-11-23 11:59:47,292 INFO L273 TraceCheckUtils]: 126: Hoare triple {28212#false} ~cond := #in~cond; {28212#false} is VALID [2018-11-23 11:59:47,292 INFO L273 TraceCheckUtils]: 127: Hoare triple {28212#false} assume 0 == ~cond; {28212#false} is VALID [2018-11-23 11:59:47,292 INFO L273 TraceCheckUtils]: 128: Hoare triple {28212#false} assume !false; {28212#false} is VALID [2018-11-23 11:59:47,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:47,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:47,304 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-23 11:59:47,312 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:59:47,380 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:59:47,381 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:47,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:47,411 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:47,827 INFO L256 TraceCheckUtils]: 0: Hoare triple {28211#true} call ULTIMATE.init(); {28211#true} is VALID [2018-11-23 11:59:47,827 INFO L273 TraceCheckUtils]: 1: Hoare triple {28211#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {28211#true} is VALID [2018-11-23 11:59:47,827 INFO L273 TraceCheckUtils]: 2: Hoare triple {28211#true} assume true; {28211#true} is VALID [2018-11-23 11:59:47,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28211#true} {28211#true} #88#return; {28211#true} is VALID [2018-11-23 11:59:47,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {28211#true} call #t~ret13 := main(); {28211#true} is VALID [2018-11-23 11:59:47,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {28211#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {28211#true} is VALID [2018-11-23 11:59:47,828 INFO L273 TraceCheckUtils]: 6: Hoare triple {28211#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {28211#true} is VALID [2018-11-23 11:59:47,829 INFO L273 TraceCheckUtils]: 7: Hoare triple {28211#true} ~i~0 := 2; {28213#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,829 INFO L273 TraceCheckUtils]: 8: Hoare triple {28213#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28213#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,829 INFO L273 TraceCheckUtils]: 9: Hoare triple {28213#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28213#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:47,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {28213#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28214#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,830 INFO L273 TraceCheckUtils]: 11: Hoare triple {28214#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28214#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,830 INFO L273 TraceCheckUtils]: 12: Hoare triple {28214#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28214#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:47,831 INFO L273 TraceCheckUtils]: 13: Hoare triple {28214#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28215#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,831 INFO L273 TraceCheckUtils]: 14: Hoare triple {28215#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28215#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,831 INFO L273 TraceCheckUtils]: 15: Hoare triple {28215#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28215#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:47,832 INFO L273 TraceCheckUtils]: 16: Hoare triple {28215#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28216#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,835 INFO L273 TraceCheckUtils]: 17: Hoare triple {28216#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28216#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,836 INFO L273 TraceCheckUtils]: 18: Hoare triple {28216#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28216#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:47,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {28216#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28217#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,837 INFO L273 TraceCheckUtils]: 20: Hoare triple {28217#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28217#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,837 INFO L273 TraceCheckUtils]: 21: Hoare triple {28217#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28217#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:47,838 INFO L273 TraceCheckUtils]: 22: Hoare triple {28217#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28218#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,838 INFO L273 TraceCheckUtils]: 23: Hoare triple {28218#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28218#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,838 INFO L273 TraceCheckUtils]: 24: Hoare triple {28218#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28218#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:47,839 INFO L273 TraceCheckUtils]: 25: Hoare triple {28218#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28219#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,839 INFO L273 TraceCheckUtils]: 26: Hoare triple {28219#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28219#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,839 INFO L273 TraceCheckUtils]: 27: Hoare triple {28219#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28219#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:47,840 INFO L273 TraceCheckUtils]: 28: Hoare triple {28219#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28220#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,840 INFO L273 TraceCheckUtils]: 29: Hoare triple {28220#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28220#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,841 INFO L273 TraceCheckUtils]: 30: Hoare triple {28220#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28220#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:47,841 INFO L273 TraceCheckUtils]: 31: Hoare triple {28220#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28221#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,842 INFO L273 TraceCheckUtils]: 32: Hoare triple {28221#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28221#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,842 INFO L273 TraceCheckUtils]: 33: Hoare triple {28221#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28221#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:47,843 INFO L273 TraceCheckUtils]: 34: Hoare triple {28221#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28222#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,844 INFO L273 TraceCheckUtils]: 35: Hoare triple {28222#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28222#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,844 INFO L273 TraceCheckUtils]: 36: Hoare triple {28222#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28222#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:47,845 INFO L273 TraceCheckUtils]: 37: Hoare triple {28222#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28223#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,845 INFO L273 TraceCheckUtils]: 38: Hoare triple {28223#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28223#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,846 INFO L273 TraceCheckUtils]: 39: Hoare triple {28223#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28223#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:47,847 INFO L273 TraceCheckUtils]: 40: Hoare triple {28223#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28224#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,847 INFO L273 TraceCheckUtils]: 41: Hoare triple {28224#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28224#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,848 INFO L273 TraceCheckUtils]: 42: Hoare triple {28224#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28224#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:47,848 INFO L273 TraceCheckUtils]: 43: Hoare triple {28224#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28225#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,849 INFO L273 TraceCheckUtils]: 44: Hoare triple {28225#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28225#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,849 INFO L273 TraceCheckUtils]: 45: Hoare triple {28225#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28225#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:47,850 INFO L273 TraceCheckUtils]: 46: Hoare triple {28225#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28226#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,851 INFO L273 TraceCheckUtils]: 47: Hoare triple {28226#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28226#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,851 INFO L273 TraceCheckUtils]: 48: Hoare triple {28226#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28226#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:47,852 INFO L273 TraceCheckUtils]: 49: Hoare triple {28226#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28227#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,852 INFO L273 TraceCheckUtils]: 50: Hoare triple {28227#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28227#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,853 INFO L273 TraceCheckUtils]: 51: Hoare triple {28227#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28227#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:47,854 INFO L273 TraceCheckUtils]: 52: Hoare triple {28227#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28228#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,854 INFO L273 TraceCheckUtils]: 53: Hoare triple {28228#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28228#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,855 INFO L273 TraceCheckUtils]: 54: Hoare triple {28228#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28228#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:47,855 INFO L273 TraceCheckUtils]: 55: Hoare triple {28228#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28229#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,856 INFO L273 TraceCheckUtils]: 56: Hoare triple {28229#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28229#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,856 INFO L273 TraceCheckUtils]: 57: Hoare triple {28229#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28229#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:47,857 INFO L273 TraceCheckUtils]: 58: Hoare triple {28229#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28230#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,858 INFO L273 TraceCheckUtils]: 59: Hoare triple {28230#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28230#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,858 INFO L273 TraceCheckUtils]: 60: Hoare triple {28230#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28230#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:47,859 INFO L273 TraceCheckUtils]: 61: Hoare triple {28230#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28231#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,859 INFO L273 TraceCheckUtils]: 62: Hoare triple {28231#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28231#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,860 INFO L273 TraceCheckUtils]: 63: Hoare triple {28231#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28231#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:47,861 INFO L273 TraceCheckUtils]: 64: Hoare triple {28231#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28232#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,861 INFO L273 TraceCheckUtils]: 65: Hoare triple {28232#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28232#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,862 INFO L273 TraceCheckUtils]: 66: Hoare triple {28232#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28232#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:47,862 INFO L273 TraceCheckUtils]: 67: Hoare triple {28232#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28233#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,863 INFO L273 TraceCheckUtils]: 68: Hoare triple {28233#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28233#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,863 INFO L273 TraceCheckUtils]: 69: Hoare triple {28233#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28233#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:47,864 INFO L273 TraceCheckUtils]: 70: Hoare triple {28233#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28234#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,864 INFO L273 TraceCheckUtils]: 71: Hoare triple {28234#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28234#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,865 INFO L273 TraceCheckUtils]: 72: Hoare triple {28234#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28234#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:47,866 INFO L273 TraceCheckUtils]: 73: Hoare triple {28234#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28235#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,866 INFO L273 TraceCheckUtils]: 74: Hoare triple {28235#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28235#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,867 INFO L273 TraceCheckUtils]: 75: Hoare triple {28235#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28235#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:47,867 INFO L273 TraceCheckUtils]: 76: Hoare triple {28235#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28236#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,868 INFO L273 TraceCheckUtils]: 77: Hoare triple {28236#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28236#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,868 INFO L273 TraceCheckUtils]: 78: Hoare triple {28236#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28236#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:47,869 INFO L273 TraceCheckUtils]: 79: Hoare triple {28236#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28237#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,870 INFO L273 TraceCheckUtils]: 80: Hoare triple {28237#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28237#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,870 INFO L273 TraceCheckUtils]: 81: Hoare triple {28237#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28237#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:47,871 INFO L273 TraceCheckUtils]: 82: Hoare triple {28237#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28238#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,871 INFO L273 TraceCheckUtils]: 83: Hoare triple {28238#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28238#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,872 INFO L273 TraceCheckUtils]: 84: Hoare triple {28238#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28238#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:47,873 INFO L273 TraceCheckUtils]: 85: Hoare triple {28238#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28239#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,873 INFO L273 TraceCheckUtils]: 86: Hoare triple {28239#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28239#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,874 INFO L273 TraceCheckUtils]: 87: Hoare triple {28239#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28239#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:47,874 INFO L273 TraceCheckUtils]: 88: Hoare triple {28239#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28240#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,875 INFO L273 TraceCheckUtils]: 89: Hoare triple {28240#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28240#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,875 INFO L273 TraceCheckUtils]: 90: Hoare triple {28240#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28240#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:47,876 INFO L273 TraceCheckUtils]: 91: Hoare triple {28240#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28241#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:47,877 INFO L273 TraceCheckUtils]: 92: Hoare triple {28241#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28241#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:47,877 INFO L273 TraceCheckUtils]: 93: Hoare triple {28241#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28241#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:47,878 INFO L273 TraceCheckUtils]: 94: Hoare triple {28241#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28242#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:47,878 INFO L273 TraceCheckUtils]: 95: Hoare triple {28242#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28242#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:47,879 INFO L273 TraceCheckUtils]: 96: Hoare triple {28242#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28242#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:47,880 INFO L273 TraceCheckUtils]: 97: Hoare triple {28242#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28243#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:47,880 INFO L273 TraceCheckUtils]: 98: Hoare triple {28243#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28243#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:47,881 INFO L273 TraceCheckUtils]: 99: Hoare triple {28243#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28243#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:47,881 INFO L273 TraceCheckUtils]: 100: Hoare triple {28243#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28244#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:47,882 INFO L273 TraceCheckUtils]: 101: Hoare triple {28244#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28244#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:47,882 INFO L273 TraceCheckUtils]: 102: Hoare triple {28244#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28244#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:47,883 INFO L273 TraceCheckUtils]: 103: Hoare triple {28244#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28245#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:47,884 INFO L273 TraceCheckUtils]: 104: Hoare triple {28245#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28245#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:47,884 INFO L273 TraceCheckUtils]: 105: Hoare triple {28245#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28245#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:47,885 INFO L273 TraceCheckUtils]: 106: Hoare triple {28245#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28246#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:47,885 INFO L273 TraceCheckUtils]: 107: Hoare triple {28246#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28246#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:47,886 INFO L273 TraceCheckUtils]: 108: Hoare triple {28246#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28246#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:47,886 INFO L273 TraceCheckUtils]: 109: Hoare triple {28246#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28247#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:47,887 INFO L273 TraceCheckUtils]: 110: Hoare triple {28247#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28247#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:47,887 INFO L273 TraceCheckUtils]: 111: Hoare triple {28247#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28247#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:47,888 INFO L273 TraceCheckUtils]: 112: Hoare triple {28247#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28248#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:47,889 INFO L273 TraceCheckUtils]: 113: Hoare triple {28248#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28248#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:47,889 INFO L273 TraceCheckUtils]: 114: Hoare triple {28248#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28248#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:47,890 INFO L273 TraceCheckUtils]: 115: Hoare triple {28248#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28249#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:47,890 INFO L273 TraceCheckUtils]: 116: Hoare triple {28249#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28249#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:47,891 INFO L273 TraceCheckUtils]: 117: Hoare triple {28249#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28249#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:47,892 INFO L273 TraceCheckUtils]: 118: Hoare triple {28249#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28250#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:47,892 INFO L273 TraceCheckUtils]: 119: Hoare triple {28250#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {28250#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:47,893 INFO L273 TraceCheckUtils]: 120: Hoare triple {28250#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {28250#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:47,893 INFO L273 TraceCheckUtils]: 121: Hoare triple {28250#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {28251#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:47,894 INFO L273 TraceCheckUtils]: 122: Hoare triple {28251#(<= main_~i~0 40)} assume !(~i~0 < 100000); {28212#false} is VALID [2018-11-23 11:59:47,894 INFO L273 TraceCheckUtils]: 123: Hoare triple {28212#false} havoc ~x~0;~x~0 := 0; {28212#false} is VALID [2018-11-23 11:59:47,894 INFO L273 TraceCheckUtils]: 124: Hoare triple {28212#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {28212#false} is VALID [2018-11-23 11:59:47,895 INFO L256 TraceCheckUtils]: 125: Hoare triple {28212#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {28212#false} is VALID [2018-11-23 11:59:47,895 INFO L273 TraceCheckUtils]: 126: Hoare triple {28212#false} ~cond := #in~cond; {28212#false} is VALID [2018-11-23 11:59:47,895 INFO L273 TraceCheckUtils]: 127: Hoare triple {28212#false} assume 0 == ~cond; {28212#false} is VALID [2018-11-23 11:59:47,895 INFO L273 TraceCheckUtils]: 128: Hoare triple {28212#false} assume !false; {28212#false} is VALID [2018-11-23 11:59:47,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:47,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:47,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41] total 41 [2018-11-23 11:59:47,925 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 129 [2018-11-23 11:59:47,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:47,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states. [2018-11-23 11:59:48,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:48,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-11-23 11:59:48,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-11-23 11:59:48,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:59:48,128 INFO L87 Difference]: Start difference. First operand 178 states and 259 transitions. Second operand 41 states. [2018-11-23 11:59:49,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:49,421 INFO L93 Difference]: Finished difference Result 202 states and 291 transitions. [2018-11-23 11:59:49,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-11-23 11:59:49,421 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 129 [2018-11-23 11:59:49,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:49,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:59:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 291 transitions. [2018-11-23 11:59:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 11:59:49,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 291 transitions. [2018-11-23 11:59:49,424 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 291 transitions. [2018-11-23 11:59:49,696 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:49,700 INFO L225 Difference]: With dead ends: 202 [2018-11-23 11:59:49,700 INFO L226 Difference]: Without dead ends: 185 [2018-11-23 11:59:49,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-11-23 11:59:49,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-11-23 11:59:49,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-11-23 11:59:49,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:49,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand 182 states. [2018-11-23 11:59:49,737 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand 182 states. [2018-11-23 11:59:49,737 INFO L87 Difference]: Start difference. First operand 185 states. Second operand 182 states. [2018-11-23 11:59:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:49,741 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2018-11-23 11:59:49,741 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 270 transitions. [2018-11-23 11:59:49,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:49,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:49,742 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 185 states. [2018-11-23 11:59:49,742 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 185 states. [2018-11-23 11:59:49,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:49,744 INFO L93 Difference]: Finished difference Result 185 states and 270 transitions. [2018-11-23 11:59:49,745 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 270 transitions. [2018-11-23 11:59:49,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:49,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:49,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:49,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-23 11:59:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 265 transitions. [2018-11-23 11:59:49,748 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 265 transitions. Word has length 129 [2018-11-23 11:59:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:49,748 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 265 transitions. [2018-11-23 11:59:49,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-11-23 11:59:49,748 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 265 transitions. [2018-11-23 11:59:49,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-11-23 11:59:49,749 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:49,749 INFO L402 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:49,749 INFO L423 AbstractCegarLoop]: === Iteration 41 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:49,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:49,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1409714399, now seen corresponding path program 39 times [2018-11-23 11:59:49,749 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:49,749 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:49,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:49,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:50,638 INFO L256 TraceCheckUtils]: 0: Hoare triple {29495#true} call ULTIMATE.init(); {29495#true} is VALID [2018-11-23 11:59:50,639 INFO L273 TraceCheckUtils]: 1: Hoare triple {29495#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29495#true} is VALID [2018-11-23 11:59:50,639 INFO L273 TraceCheckUtils]: 2: Hoare triple {29495#true} assume true; {29495#true} is VALID [2018-11-23 11:59:50,639 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29495#true} {29495#true} #88#return; {29495#true} is VALID [2018-11-23 11:59:50,639 INFO L256 TraceCheckUtils]: 4: Hoare triple {29495#true} call #t~ret13 := main(); {29495#true} is VALID [2018-11-23 11:59:50,640 INFO L273 TraceCheckUtils]: 5: Hoare triple {29495#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {29495#true} is VALID [2018-11-23 11:59:50,640 INFO L273 TraceCheckUtils]: 6: Hoare triple {29495#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {29495#true} is VALID [2018-11-23 11:59:50,640 INFO L273 TraceCheckUtils]: 7: Hoare triple {29495#true} ~i~0 := 2; {29497#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:50,641 INFO L273 TraceCheckUtils]: 8: Hoare triple {29497#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29497#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:50,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {29497#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29497#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:50,641 INFO L273 TraceCheckUtils]: 10: Hoare triple {29497#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29498#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:50,642 INFO L273 TraceCheckUtils]: 11: Hoare triple {29498#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29498#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:50,642 INFO L273 TraceCheckUtils]: 12: Hoare triple {29498#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29498#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:50,643 INFO L273 TraceCheckUtils]: 13: Hoare triple {29498#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29499#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:50,643 INFO L273 TraceCheckUtils]: 14: Hoare triple {29499#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29499#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:50,644 INFO L273 TraceCheckUtils]: 15: Hoare triple {29499#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29499#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:50,665 INFO L273 TraceCheckUtils]: 16: Hoare triple {29499#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29500#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:50,682 INFO L273 TraceCheckUtils]: 17: Hoare triple {29500#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29500#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:50,690 INFO L273 TraceCheckUtils]: 18: Hoare triple {29500#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29500#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:50,696 INFO L273 TraceCheckUtils]: 19: Hoare triple {29500#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29501#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:50,696 INFO L273 TraceCheckUtils]: 20: Hoare triple {29501#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29501#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:50,697 INFO L273 TraceCheckUtils]: 21: Hoare triple {29501#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29501#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:50,697 INFO L273 TraceCheckUtils]: 22: Hoare triple {29501#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29502#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:50,697 INFO L273 TraceCheckUtils]: 23: Hoare triple {29502#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29502#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:50,698 INFO L273 TraceCheckUtils]: 24: Hoare triple {29502#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29502#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:50,698 INFO L273 TraceCheckUtils]: 25: Hoare triple {29502#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29503#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:50,698 INFO L273 TraceCheckUtils]: 26: Hoare triple {29503#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29503#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:50,699 INFO L273 TraceCheckUtils]: 27: Hoare triple {29503#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29503#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:50,700 INFO L273 TraceCheckUtils]: 28: Hoare triple {29503#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29504#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:50,700 INFO L273 TraceCheckUtils]: 29: Hoare triple {29504#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29504#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:50,701 INFO L273 TraceCheckUtils]: 30: Hoare triple {29504#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29504#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:50,701 INFO L273 TraceCheckUtils]: 31: Hoare triple {29504#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29505#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:50,702 INFO L273 TraceCheckUtils]: 32: Hoare triple {29505#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29505#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:50,702 INFO L273 TraceCheckUtils]: 33: Hoare triple {29505#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29505#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:50,703 INFO L273 TraceCheckUtils]: 34: Hoare triple {29505#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29506#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:50,703 INFO L273 TraceCheckUtils]: 35: Hoare triple {29506#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29506#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:50,704 INFO L273 TraceCheckUtils]: 36: Hoare triple {29506#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29506#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:50,705 INFO L273 TraceCheckUtils]: 37: Hoare triple {29506#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29507#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:50,705 INFO L273 TraceCheckUtils]: 38: Hoare triple {29507#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29507#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:50,706 INFO L273 TraceCheckUtils]: 39: Hoare triple {29507#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29507#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:50,706 INFO L273 TraceCheckUtils]: 40: Hoare triple {29507#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29508#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:50,707 INFO L273 TraceCheckUtils]: 41: Hoare triple {29508#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29508#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:50,707 INFO L273 TraceCheckUtils]: 42: Hoare triple {29508#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29508#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:50,708 INFO L273 TraceCheckUtils]: 43: Hoare triple {29508#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29509#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:50,709 INFO L273 TraceCheckUtils]: 44: Hoare triple {29509#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29509#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:50,709 INFO L273 TraceCheckUtils]: 45: Hoare triple {29509#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29509#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:50,710 INFO L273 TraceCheckUtils]: 46: Hoare triple {29509#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29510#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:50,710 INFO L273 TraceCheckUtils]: 47: Hoare triple {29510#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29510#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:50,711 INFO L273 TraceCheckUtils]: 48: Hoare triple {29510#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29510#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:50,712 INFO L273 TraceCheckUtils]: 49: Hoare triple {29510#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29511#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:50,712 INFO L273 TraceCheckUtils]: 50: Hoare triple {29511#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29511#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:50,713 INFO L273 TraceCheckUtils]: 51: Hoare triple {29511#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29511#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:50,713 INFO L273 TraceCheckUtils]: 52: Hoare triple {29511#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29512#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:50,714 INFO L273 TraceCheckUtils]: 53: Hoare triple {29512#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29512#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:50,714 INFO L273 TraceCheckUtils]: 54: Hoare triple {29512#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29512#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:50,715 INFO L273 TraceCheckUtils]: 55: Hoare triple {29512#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29513#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:50,716 INFO L273 TraceCheckUtils]: 56: Hoare triple {29513#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29513#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:50,716 INFO L273 TraceCheckUtils]: 57: Hoare triple {29513#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29513#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:50,717 INFO L273 TraceCheckUtils]: 58: Hoare triple {29513#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29514#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:50,717 INFO L273 TraceCheckUtils]: 59: Hoare triple {29514#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29514#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:50,718 INFO L273 TraceCheckUtils]: 60: Hoare triple {29514#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29514#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:50,718 INFO L273 TraceCheckUtils]: 61: Hoare triple {29514#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29515#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:50,719 INFO L273 TraceCheckUtils]: 62: Hoare triple {29515#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29515#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:50,719 INFO L273 TraceCheckUtils]: 63: Hoare triple {29515#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29515#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:50,720 INFO L273 TraceCheckUtils]: 64: Hoare triple {29515#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29516#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:50,721 INFO L273 TraceCheckUtils]: 65: Hoare triple {29516#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29516#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:50,738 INFO L273 TraceCheckUtils]: 66: Hoare triple {29516#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29516#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:50,747 INFO L273 TraceCheckUtils]: 67: Hoare triple {29516#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29517#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:50,761 INFO L273 TraceCheckUtils]: 68: Hoare triple {29517#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29517#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:50,769 INFO L273 TraceCheckUtils]: 69: Hoare triple {29517#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29517#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:50,775 INFO L273 TraceCheckUtils]: 70: Hoare triple {29517#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29518#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:50,776 INFO L273 TraceCheckUtils]: 71: Hoare triple {29518#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29518#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:50,776 INFO L273 TraceCheckUtils]: 72: Hoare triple {29518#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29518#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:50,776 INFO L273 TraceCheckUtils]: 73: Hoare triple {29518#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29519#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:50,777 INFO L273 TraceCheckUtils]: 74: Hoare triple {29519#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29519#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:50,778 INFO L273 TraceCheckUtils]: 75: Hoare triple {29519#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29519#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:50,778 INFO L273 TraceCheckUtils]: 76: Hoare triple {29519#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29520#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:50,779 INFO L273 TraceCheckUtils]: 77: Hoare triple {29520#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29520#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:50,779 INFO L273 TraceCheckUtils]: 78: Hoare triple {29520#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29520#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:50,780 INFO L273 TraceCheckUtils]: 79: Hoare triple {29520#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29521#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:50,780 INFO L273 TraceCheckUtils]: 80: Hoare triple {29521#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29521#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:50,781 INFO L273 TraceCheckUtils]: 81: Hoare triple {29521#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29521#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:50,781 INFO L273 TraceCheckUtils]: 82: Hoare triple {29521#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29522#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:50,781 INFO L273 TraceCheckUtils]: 83: Hoare triple {29522#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29522#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:50,782 INFO L273 TraceCheckUtils]: 84: Hoare triple {29522#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29522#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:50,782 INFO L273 TraceCheckUtils]: 85: Hoare triple {29522#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29523#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:50,783 INFO L273 TraceCheckUtils]: 86: Hoare triple {29523#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29523#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:50,783 INFO L273 TraceCheckUtils]: 87: Hoare triple {29523#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29523#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:50,784 INFO L273 TraceCheckUtils]: 88: Hoare triple {29523#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29524#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:50,784 INFO L273 TraceCheckUtils]: 89: Hoare triple {29524#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29524#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:50,785 INFO L273 TraceCheckUtils]: 90: Hoare triple {29524#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29524#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:50,786 INFO L273 TraceCheckUtils]: 91: Hoare triple {29524#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29525#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:50,786 INFO L273 TraceCheckUtils]: 92: Hoare triple {29525#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29525#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:50,787 INFO L273 TraceCheckUtils]: 93: Hoare triple {29525#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29525#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:50,787 INFO L273 TraceCheckUtils]: 94: Hoare triple {29525#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29526#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:50,788 INFO L273 TraceCheckUtils]: 95: Hoare triple {29526#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29526#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:50,788 INFO L273 TraceCheckUtils]: 96: Hoare triple {29526#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29526#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:50,789 INFO L273 TraceCheckUtils]: 97: Hoare triple {29526#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29527#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:50,790 INFO L273 TraceCheckUtils]: 98: Hoare triple {29527#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29527#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:50,790 INFO L273 TraceCheckUtils]: 99: Hoare triple {29527#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29527#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:50,791 INFO L273 TraceCheckUtils]: 100: Hoare triple {29527#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29528#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:50,791 INFO L273 TraceCheckUtils]: 101: Hoare triple {29528#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29528#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:50,792 INFO L273 TraceCheckUtils]: 102: Hoare triple {29528#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29528#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:50,793 INFO L273 TraceCheckUtils]: 103: Hoare triple {29528#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29529#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:50,793 INFO L273 TraceCheckUtils]: 104: Hoare triple {29529#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29529#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:50,794 INFO L273 TraceCheckUtils]: 105: Hoare triple {29529#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29529#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:50,794 INFO L273 TraceCheckUtils]: 106: Hoare triple {29529#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29530#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:50,795 INFO L273 TraceCheckUtils]: 107: Hoare triple {29530#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29530#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:50,795 INFO L273 TraceCheckUtils]: 108: Hoare triple {29530#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29530#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:50,796 INFO L273 TraceCheckUtils]: 109: Hoare triple {29530#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29531#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:50,796 INFO L273 TraceCheckUtils]: 110: Hoare triple {29531#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29531#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:50,797 INFO L273 TraceCheckUtils]: 111: Hoare triple {29531#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29531#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:50,798 INFO L273 TraceCheckUtils]: 112: Hoare triple {29531#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29532#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:50,798 INFO L273 TraceCheckUtils]: 113: Hoare triple {29532#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29532#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:50,799 INFO L273 TraceCheckUtils]: 114: Hoare triple {29532#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29532#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:50,799 INFO L273 TraceCheckUtils]: 115: Hoare triple {29532#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29533#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:50,800 INFO L273 TraceCheckUtils]: 116: Hoare triple {29533#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29533#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:50,800 INFO L273 TraceCheckUtils]: 117: Hoare triple {29533#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29533#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:50,801 INFO L273 TraceCheckUtils]: 118: Hoare triple {29533#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29534#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:50,802 INFO L273 TraceCheckUtils]: 119: Hoare triple {29534#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29534#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:50,802 INFO L273 TraceCheckUtils]: 120: Hoare triple {29534#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29534#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:50,803 INFO L273 TraceCheckUtils]: 121: Hoare triple {29534#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29535#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:50,803 INFO L273 TraceCheckUtils]: 122: Hoare triple {29535#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29535#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:50,804 INFO L273 TraceCheckUtils]: 123: Hoare triple {29535#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29535#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:50,805 INFO L273 TraceCheckUtils]: 124: Hoare triple {29535#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29536#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:50,805 INFO L273 TraceCheckUtils]: 125: Hoare triple {29536#(<= main_~i~0 41)} assume !(~i~0 < 100000); {29496#false} is VALID [2018-11-23 11:59:50,805 INFO L273 TraceCheckUtils]: 126: Hoare triple {29496#false} havoc ~x~0;~x~0 := 0; {29496#false} is VALID [2018-11-23 11:59:50,806 INFO L273 TraceCheckUtils]: 127: Hoare triple {29496#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {29496#false} is VALID [2018-11-23 11:59:50,806 INFO L256 TraceCheckUtils]: 128: Hoare triple {29496#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {29496#false} is VALID [2018-11-23 11:59:50,806 INFO L273 TraceCheckUtils]: 129: Hoare triple {29496#false} ~cond := #in~cond; {29496#false} is VALID [2018-11-23 11:59:50,806 INFO L273 TraceCheckUtils]: 130: Hoare triple {29496#false} assume 0 == ~cond; {29496#false} is VALID [2018-11-23 11:59:50,806 INFO L273 TraceCheckUtils]: 131: Hoare triple {29496#false} assume !false; {29496#false} is VALID [2018-11-23 11:59:50,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:50,818 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:50,818 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-23 11:59:50,830 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 11:59:50,940 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 40 check-sat command(s) [2018-11-23 11:59:50,940 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:50,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:51,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {29495#true} call ULTIMATE.init(); {29495#true} is VALID [2018-11-23 11:59:51,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {29495#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {29495#true} is VALID [2018-11-23 11:59:51,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {29495#true} assume true; {29495#true} is VALID [2018-11-23 11:59:51,328 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {29495#true} {29495#true} #88#return; {29495#true} is VALID [2018-11-23 11:59:51,328 INFO L256 TraceCheckUtils]: 4: Hoare triple {29495#true} call #t~ret13 := main(); {29495#true} is VALID [2018-11-23 11:59:51,328 INFO L273 TraceCheckUtils]: 5: Hoare triple {29495#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {29495#true} is VALID [2018-11-23 11:59:51,328 INFO L273 TraceCheckUtils]: 6: Hoare triple {29495#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {29495#true} is VALID [2018-11-23 11:59:51,329 INFO L273 TraceCheckUtils]: 7: Hoare triple {29495#true} ~i~0 := 2; {29497#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:51,329 INFO L273 TraceCheckUtils]: 8: Hoare triple {29497#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29497#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:51,329 INFO L273 TraceCheckUtils]: 9: Hoare triple {29497#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29497#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:51,330 INFO L273 TraceCheckUtils]: 10: Hoare triple {29497#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29498#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:51,330 INFO L273 TraceCheckUtils]: 11: Hoare triple {29498#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29498#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:51,330 INFO L273 TraceCheckUtils]: 12: Hoare triple {29498#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29498#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:51,331 INFO L273 TraceCheckUtils]: 13: Hoare triple {29498#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29499#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:51,331 INFO L273 TraceCheckUtils]: 14: Hoare triple {29499#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29499#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:51,332 INFO L273 TraceCheckUtils]: 15: Hoare triple {29499#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29499#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:51,333 INFO L273 TraceCheckUtils]: 16: Hoare triple {29499#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29500#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:51,333 INFO L273 TraceCheckUtils]: 17: Hoare triple {29500#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29500#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:51,334 INFO L273 TraceCheckUtils]: 18: Hoare triple {29500#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29500#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:51,334 INFO L273 TraceCheckUtils]: 19: Hoare triple {29500#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29501#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:51,335 INFO L273 TraceCheckUtils]: 20: Hoare triple {29501#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29501#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:51,335 INFO L273 TraceCheckUtils]: 21: Hoare triple {29501#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29501#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:51,336 INFO L273 TraceCheckUtils]: 22: Hoare triple {29501#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29502#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:51,337 INFO L273 TraceCheckUtils]: 23: Hoare triple {29502#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29502#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:51,337 INFO L273 TraceCheckUtils]: 24: Hoare triple {29502#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29502#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:51,338 INFO L273 TraceCheckUtils]: 25: Hoare triple {29502#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29503#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:51,338 INFO L273 TraceCheckUtils]: 26: Hoare triple {29503#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29503#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:51,339 INFO L273 TraceCheckUtils]: 27: Hoare triple {29503#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29503#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:51,339 INFO L273 TraceCheckUtils]: 28: Hoare triple {29503#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29504#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:51,340 INFO L273 TraceCheckUtils]: 29: Hoare triple {29504#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29504#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:51,340 INFO L273 TraceCheckUtils]: 30: Hoare triple {29504#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29504#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:51,341 INFO L273 TraceCheckUtils]: 31: Hoare triple {29504#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29505#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:51,342 INFO L273 TraceCheckUtils]: 32: Hoare triple {29505#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29505#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:51,342 INFO L273 TraceCheckUtils]: 33: Hoare triple {29505#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29505#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:51,343 INFO L273 TraceCheckUtils]: 34: Hoare triple {29505#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29506#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:51,343 INFO L273 TraceCheckUtils]: 35: Hoare triple {29506#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29506#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:51,344 INFO L273 TraceCheckUtils]: 36: Hoare triple {29506#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29506#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:51,345 INFO L273 TraceCheckUtils]: 37: Hoare triple {29506#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29507#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:51,345 INFO L273 TraceCheckUtils]: 38: Hoare triple {29507#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29507#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:51,346 INFO L273 TraceCheckUtils]: 39: Hoare triple {29507#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29507#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:51,346 INFO L273 TraceCheckUtils]: 40: Hoare triple {29507#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29508#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:51,347 INFO L273 TraceCheckUtils]: 41: Hoare triple {29508#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29508#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:51,347 INFO L273 TraceCheckUtils]: 42: Hoare triple {29508#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29508#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:51,348 INFO L273 TraceCheckUtils]: 43: Hoare triple {29508#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29509#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:51,349 INFO L273 TraceCheckUtils]: 44: Hoare triple {29509#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29509#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:51,349 INFO L273 TraceCheckUtils]: 45: Hoare triple {29509#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29509#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:51,350 INFO L273 TraceCheckUtils]: 46: Hoare triple {29509#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29510#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:51,350 INFO L273 TraceCheckUtils]: 47: Hoare triple {29510#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29510#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:51,351 INFO L273 TraceCheckUtils]: 48: Hoare triple {29510#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29510#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:51,351 INFO L273 TraceCheckUtils]: 49: Hoare triple {29510#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29511#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:51,352 INFO L273 TraceCheckUtils]: 50: Hoare triple {29511#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29511#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:51,352 INFO L273 TraceCheckUtils]: 51: Hoare triple {29511#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29511#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:51,353 INFO L273 TraceCheckUtils]: 52: Hoare triple {29511#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29512#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:51,354 INFO L273 TraceCheckUtils]: 53: Hoare triple {29512#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29512#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:51,354 INFO L273 TraceCheckUtils]: 54: Hoare triple {29512#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29512#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:51,355 INFO L273 TraceCheckUtils]: 55: Hoare triple {29512#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29513#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:51,355 INFO L273 TraceCheckUtils]: 56: Hoare triple {29513#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29513#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:51,356 INFO L273 TraceCheckUtils]: 57: Hoare triple {29513#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29513#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:51,357 INFO L273 TraceCheckUtils]: 58: Hoare triple {29513#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29514#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:51,357 INFO L273 TraceCheckUtils]: 59: Hoare triple {29514#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29514#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:51,358 INFO L273 TraceCheckUtils]: 60: Hoare triple {29514#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29514#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:51,358 INFO L273 TraceCheckUtils]: 61: Hoare triple {29514#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29515#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:51,359 INFO L273 TraceCheckUtils]: 62: Hoare triple {29515#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29515#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:51,359 INFO L273 TraceCheckUtils]: 63: Hoare triple {29515#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29515#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:51,360 INFO L273 TraceCheckUtils]: 64: Hoare triple {29515#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29516#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:51,361 INFO L273 TraceCheckUtils]: 65: Hoare triple {29516#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29516#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:51,361 INFO L273 TraceCheckUtils]: 66: Hoare triple {29516#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29516#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:51,362 INFO L273 TraceCheckUtils]: 67: Hoare triple {29516#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29517#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:51,362 INFO L273 TraceCheckUtils]: 68: Hoare triple {29517#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29517#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:51,363 INFO L273 TraceCheckUtils]: 69: Hoare triple {29517#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29517#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:51,363 INFO L273 TraceCheckUtils]: 70: Hoare triple {29517#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29518#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:51,364 INFO L273 TraceCheckUtils]: 71: Hoare triple {29518#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29518#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:51,364 INFO L273 TraceCheckUtils]: 72: Hoare triple {29518#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29518#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:51,365 INFO L273 TraceCheckUtils]: 73: Hoare triple {29518#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29519#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:51,366 INFO L273 TraceCheckUtils]: 74: Hoare triple {29519#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29519#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:51,366 INFO L273 TraceCheckUtils]: 75: Hoare triple {29519#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29519#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:51,367 INFO L273 TraceCheckUtils]: 76: Hoare triple {29519#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29520#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:51,367 INFO L273 TraceCheckUtils]: 77: Hoare triple {29520#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29520#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:51,368 INFO L273 TraceCheckUtils]: 78: Hoare triple {29520#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29520#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:51,369 INFO L273 TraceCheckUtils]: 79: Hoare triple {29520#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29521#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:51,369 INFO L273 TraceCheckUtils]: 80: Hoare triple {29521#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29521#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:51,370 INFO L273 TraceCheckUtils]: 81: Hoare triple {29521#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29521#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:51,370 INFO L273 TraceCheckUtils]: 82: Hoare triple {29521#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29522#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:51,371 INFO L273 TraceCheckUtils]: 83: Hoare triple {29522#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29522#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:51,371 INFO L273 TraceCheckUtils]: 84: Hoare triple {29522#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29522#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:51,372 INFO L273 TraceCheckUtils]: 85: Hoare triple {29522#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29523#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:51,373 INFO L273 TraceCheckUtils]: 86: Hoare triple {29523#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29523#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:51,373 INFO L273 TraceCheckUtils]: 87: Hoare triple {29523#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29523#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:51,374 INFO L273 TraceCheckUtils]: 88: Hoare triple {29523#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29524#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:51,374 INFO L273 TraceCheckUtils]: 89: Hoare triple {29524#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29524#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:51,375 INFO L273 TraceCheckUtils]: 90: Hoare triple {29524#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29524#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:51,375 INFO L273 TraceCheckUtils]: 91: Hoare triple {29524#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29525#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:51,376 INFO L273 TraceCheckUtils]: 92: Hoare triple {29525#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29525#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:51,376 INFO L273 TraceCheckUtils]: 93: Hoare triple {29525#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29525#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:51,377 INFO L273 TraceCheckUtils]: 94: Hoare triple {29525#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29526#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:51,378 INFO L273 TraceCheckUtils]: 95: Hoare triple {29526#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29526#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:51,378 INFO L273 TraceCheckUtils]: 96: Hoare triple {29526#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29526#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:51,379 INFO L273 TraceCheckUtils]: 97: Hoare triple {29526#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29527#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:51,379 INFO L273 TraceCheckUtils]: 98: Hoare triple {29527#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29527#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:51,380 INFO L273 TraceCheckUtils]: 99: Hoare triple {29527#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29527#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:51,381 INFO L273 TraceCheckUtils]: 100: Hoare triple {29527#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29528#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:51,381 INFO L273 TraceCheckUtils]: 101: Hoare triple {29528#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29528#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:51,382 INFO L273 TraceCheckUtils]: 102: Hoare triple {29528#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29528#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:51,382 INFO L273 TraceCheckUtils]: 103: Hoare triple {29528#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29529#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:51,383 INFO L273 TraceCheckUtils]: 104: Hoare triple {29529#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29529#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:51,383 INFO L273 TraceCheckUtils]: 105: Hoare triple {29529#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29529#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:51,384 INFO L273 TraceCheckUtils]: 106: Hoare triple {29529#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29530#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:51,385 INFO L273 TraceCheckUtils]: 107: Hoare triple {29530#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29530#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:51,385 INFO L273 TraceCheckUtils]: 108: Hoare triple {29530#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29530#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:51,386 INFO L273 TraceCheckUtils]: 109: Hoare triple {29530#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29531#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:51,386 INFO L273 TraceCheckUtils]: 110: Hoare triple {29531#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29531#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:51,387 INFO L273 TraceCheckUtils]: 111: Hoare triple {29531#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29531#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:51,387 INFO L273 TraceCheckUtils]: 112: Hoare triple {29531#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29532#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:51,388 INFO L273 TraceCheckUtils]: 113: Hoare triple {29532#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29532#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:51,388 INFO L273 TraceCheckUtils]: 114: Hoare triple {29532#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29532#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:51,389 INFO L273 TraceCheckUtils]: 115: Hoare triple {29532#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29533#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:51,390 INFO L273 TraceCheckUtils]: 116: Hoare triple {29533#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29533#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:51,390 INFO L273 TraceCheckUtils]: 117: Hoare triple {29533#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29533#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:51,391 INFO L273 TraceCheckUtils]: 118: Hoare triple {29533#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29534#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:51,391 INFO L273 TraceCheckUtils]: 119: Hoare triple {29534#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29534#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:51,392 INFO L273 TraceCheckUtils]: 120: Hoare triple {29534#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29534#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:51,393 INFO L273 TraceCheckUtils]: 121: Hoare triple {29534#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29535#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:51,393 INFO L273 TraceCheckUtils]: 122: Hoare triple {29535#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {29535#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:51,394 INFO L273 TraceCheckUtils]: 123: Hoare triple {29535#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {29535#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:51,394 INFO L273 TraceCheckUtils]: 124: Hoare triple {29535#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {29536#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:51,395 INFO L273 TraceCheckUtils]: 125: Hoare triple {29536#(<= main_~i~0 41)} assume !(~i~0 < 100000); {29496#false} is VALID [2018-11-23 11:59:51,395 INFO L273 TraceCheckUtils]: 126: Hoare triple {29496#false} havoc ~x~0;~x~0 := 0; {29496#false} is VALID [2018-11-23 11:59:51,395 INFO L273 TraceCheckUtils]: 127: Hoare triple {29496#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {29496#false} is VALID [2018-11-23 11:59:51,396 INFO L256 TraceCheckUtils]: 128: Hoare triple {29496#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {29496#false} is VALID [2018-11-23 11:59:51,396 INFO L273 TraceCheckUtils]: 129: Hoare triple {29496#false} ~cond := #in~cond; {29496#false} is VALID [2018-11-23 11:59:51,396 INFO L273 TraceCheckUtils]: 130: Hoare triple {29496#false} assume 0 == ~cond; {29496#false} is VALID [2018-11-23 11:59:51,396 INFO L273 TraceCheckUtils]: 131: Hoare triple {29496#false} assume !false; {29496#false} is VALID [2018-11-23 11:59:51,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:51,427 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:51,427 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 42] total 42 [2018-11-23 11:59:51,427 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 132 [2018-11-23 11:59:51,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:51,428 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states. [2018-11-23 11:59:51,556 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-23 11:59:51,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-11-23 11:59:51,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-11-23 11:59:51,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:59:51,558 INFO L87 Difference]: Start difference. First operand 182 states and 265 transitions. Second operand 42 states. [2018-11-23 11:59:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:52,888 INFO L93 Difference]: Finished difference Result 206 states and 297 transitions. [2018-11-23 11:59:52,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-11-23 11:59:52,888 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 132 [2018-11-23 11:59:52,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:52,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:59:52,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 297 transitions. [2018-11-23 11:59:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 11:59:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 297 transitions. [2018-11-23 11:59:52,892 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 297 transitions. [2018-11-23 11:59:53,172 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-23 11:59:53,176 INFO L225 Difference]: With dead ends: 206 [2018-11-23 11:59:53,176 INFO L226 Difference]: Without dead ends: 189 [2018-11-23 11:59:53,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 11:59:53,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-11-23 11:59:53,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-11-23 11:59:53,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:53,208 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand 186 states. [2018-11-23 11:59:53,208 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand 186 states. [2018-11-23 11:59:53,208 INFO L87 Difference]: Start difference. First operand 189 states. Second operand 186 states. [2018-11-23 11:59:53,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:53,211 INFO L93 Difference]: Finished difference Result 189 states and 276 transitions. [2018-11-23 11:59:53,211 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 276 transitions. [2018-11-23 11:59:53,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:53,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:53,211 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 189 states. [2018-11-23 11:59:53,211 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 189 states. [2018-11-23 11:59:53,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:53,215 INFO L93 Difference]: Finished difference Result 189 states and 276 transitions. [2018-11-23 11:59:53,215 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 276 transitions. [2018-11-23 11:59:53,215 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:53,215 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:53,215 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:53,216 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:53,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-23 11:59:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 271 transitions. [2018-11-23 11:59:53,219 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 271 transitions. Word has length 132 [2018-11-23 11:59:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:53,220 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 271 transitions. [2018-11-23 11:59:53,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-11-23 11:59:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 271 transitions. [2018-11-23 11:59:53,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-11-23 11:59:53,220 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:53,221 INFO L402 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:53,221 INFO L423 AbstractCegarLoop]: === Iteration 42 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:53,221 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:53,221 INFO L82 PathProgramCache]: Analyzing trace with hash 38341596, now seen corresponding path program 40 times [2018-11-23 11:59:53,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:53,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:53,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:53,222 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:53,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:54,530 INFO L256 TraceCheckUtils]: 0: Hoare triple {30807#true} call ULTIMATE.init(); {30807#true} is VALID [2018-11-23 11:59:54,530 INFO L273 TraceCheckUtils]: 1: Hoare triple {30807#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30807#true} is VALID [2018-11-23 11:59:54,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {30807#true} assume true; {30807#true} is VALID [2018-11-23 11:59:54,531 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30807#true} {30807#true} #88#return; {30807#true} is VALID [2018-11-23 11:59:54,531 INFO L256 TraceCheckUtils]: 4: Hoare triple {30807#true} call #t~ret13 := main(); {30807#true} is VALID [2018-11-23 11:59:54,531 INFO L273 TraceCheckUtils]: 5: Hoare triple {30807#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {30807#true} is VALID [2018-11-23 11:59:54,531 INFO L273 TraceCheckUtils]: 6: Hoare triple {30807#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {30807#true} is VALID [2018-11-23 11:59:54,532 INFO L273 TraceCheckUtils]: 7: Hoare triple {30807#true} ~i~0 := 2; {30809#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:54,532 INFO L273 TraceCheckUtils]: 8: Hoare triple {30809#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30809#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:54,532 INFO L273 TraceCheckUtils]: 9: Hoare triple {30809#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30809#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:54,533 INFO L273 TraceCheckUtils]: 10: Hoare triple {30809#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30810#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:54,533 INFO L273 TraceCheckUtils]: 11: Hoare triple {30810#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30810#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:54,533 INFO L273 TraceCheckUtils]: 12: Hoare triple {30810#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30810#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:54,534 INFO L273 TraceCheckUtils]: 13: Hoare triple {30810#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30811#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:54,534 INFO L273 TraceCheckUtils]: 14: Hoare triple {30811#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30811#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:54,535 INFO L273 TraceCheckUtils]: 15: Hoare triple {30811#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30811#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:54,536 INFO L273 TraceCheckUtils]: 16: Hoare triple {30811#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30812#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:54,536 INFO L273 TraceCheckUtils]: 17: Hoare triple {30812#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30812#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:54,537 INFO L273 TraceCheckUtils]: 18: Hoare triple {30812#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30812#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:54,537 INFO L273 TraceCheckUtils]: 19: Hoare triple {30812#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30813#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:54,538 INFO L273 TraceCheckUtils]: 20: Hoare triple {30813#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30813#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:54,538 INFO L273 TraceCheckUtils]: 21: Hoare triple {30813#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30813#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:54,539 INFO L273 TraceCheckUtils]: 22: Hoare triple {30813#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30814#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:54,540 INFO L273 TraceCheckUtils]: 23: Hoare triple {30814#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30814#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:54,540 INFO L273 TraceCheckUtils]: 24: Hoare triple {30814#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30814#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:54,541 INFO L273 TraceCheckUtils]: 25: Hoare triple {30814#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30815#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:54,541 INFO L273 TraceCheckUtils]: 26: Hoare triple {30815#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30815#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:54,542 INFO L273 TraceCheckUtils]: 27: Hoare triple {30815#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30815#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:54,542 INFO L273 TraceCheckUtils]: 28: Hoare triple {30815#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30816#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:54,543 INFO L273 TraceCheckUtils]: 29: Hoare triple {30816#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30816#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:54,543 INFO L273 TraceCheckUtils]: 30: Hoare triple {30816#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30816#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:54,544 INFO L273 TraceCheckUtils]: 31: Hoare triple {30816#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30817#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:54,545 INFO L273 TraceCheckUtils]: 32: Hoare triple {30817#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30817#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:54,545 INFO L273 TraceCheckUtils]: 33: Hoare triple {30817#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30817#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:54,546 INFO L273 TraceCheckUtils]: 34: Hoare triple {30817#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30818#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:54,546 INFO L273 TraceCheckUtils]: 35: Hoare triple {30818#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30818#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:54,547 INFO L273 TraceCheckUtils]: 36: Hoare triple {30818#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30818#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:54,548 INFO L273 TraceCheckUtils]: 37: Hoare triple {30818#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30819#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:54,548 INFO L273 TraceCheckUtils]: 38: Hoare triple {30819#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30819#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:54,549 INFO L273 TraceCheckUtils]: 39: Hoare triple {30819#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30819#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:54,549 INFO L273 TraceCheckUtils]: 40: Hoare triple {30819#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30820#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:54,550 INFO L273 TraceCheckUtils]: 41: Hoare triple {30820#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30820#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:54,550 INFO L273 TraceCheckUtils]: 42: Hoare triple {30820#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30820#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:54,551 INFO L273 TraceCheckUtils]: 43: Hoare triple {30820#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30821#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:54,552 INFO L273 TraceCheckUtils]: 44: Hoare triple {30821#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30821#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:54,552 INFO L273 TraceCheckUtils]: 45: Hoare triple {30821#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30821#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:54,553 INFO L273 TraceCheckUtils]: 46: Hoare triple {30821#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30822#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:54,553 INFO L273 TraceCheckUtils]: 47: Hoare triple {30822#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30822#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:54,554 INFO L273 TraceCheckUtils]: 48: Hoare triple {30822#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30822#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:54,554 INFO L273 TraceCheckUtils]: 49: Hoare triple {30822#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30823#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:54,555 INFO L273 TraceCheckUtils]: 50: Hoare triple {30823#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30823#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:54,555 INFO L273 TraceCheckUtils]: 51: Hoare triple {30823#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30823#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:54,556 INFO L273 TraceCheckUtils]: 52: Hoare triple {30823#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30824#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:54,557 INFO L273 TraceCheckUtils]: 53: Hoare triple {30824#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30824#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:54,557 INFO L273 TraceCheckUtils]: 54: Hoare triple {30824#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30824#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:54,558 INFO L273 TraceCheckUtils]: 55: Hoare triple {30824#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30825#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:54,558 INFO L273 TraceCheckUtils]: 56: Hoare triple {30825#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30825#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:54,559 INFO L273 TraceCheckUtils]: 57: Hoare triple {30825#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30825#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:54,560 INFO L273 TraceCheckUtils]: 58: Hoare triple {30825#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30826#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:54,560 INFO L273 TraceCheckUtils]: 59: Hoare triple {30826#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30826#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:54,561 INFO L273 TraceCheckUtils]: 60: Hoare triple {30826#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30826#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:54,561 INFO L273 TraceCheckUtils]: 61: Hoare triple {30826#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30827#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:54,562 INFO L273 TraceCheckUtils]: 62: Hoare triple {30827#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30827#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:54,562 INFO L273 TraceCheckUtils]: 63: Hoare triple {30827#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30827#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:54,563 INFO L273 TraceCheckUtils]: 64: Hoare triple {30827#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30828#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:54,564 INFO L273 TraceCheckUtils]: 65: Hoare triple {30828#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30828#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:54,564 INFO L273 TraceCheckUtils]: 66: Hoare triple {30828#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30828#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:54,565 INFO L273 TraceCheckUtils]: 67: Hoare triple {30828#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30829#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:54,565 INFO L273 TraceCheckUtils]: 68: Hoare triple {30829#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30829#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:54,566 INFO L273 TraceCheckUtils]: 69: Hoare triple {30829#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30829#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:54,566 INFO L273 TraceCheckUtils]: 70: Hoare triple {30829#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30830#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:54,567 INFO L273 TraceCheckUtils]: 71: Hoare triple {30830#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30830#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:54,567 INFO L273 TraceCheckUtils]: 72: Hoare triple {30830#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30830#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:54,568 INFO L273 TraceCheckUtils]: 73: Hoare triple {30830#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30831#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:54,569 INFO L273 TraceCheckUtils]: 74: Hoare triple {30831#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30831#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:54,569 INFO L273 TraceCheckUtils]: 75: Hoare triple {30831#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30831#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:54,570 INFO L273 TraceCheckUtils]: 76: Hoare triple {30831#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30832#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:54,570 INFO L273 TraceCheckUtils]: 77: Hoare triple {30832#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30832#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:54,571 INFO L273 TraceCheckUtils]: 78: Hoare triple {30832#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30832#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:54,572 INFO L273 TraceCheckUtils]: 79: Hoare triple {30832#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30833#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:54,572 INFO L273 TraceCheckUtils]: 80: Hoare triple {30833#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30833#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:54,573 INFO L273 TraceCheckUtils]: 81: Hoare triple {30833#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30833#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:54,573 INFO L273 TraceCheckUtils]: 82: Hoare triple {30833#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30834#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:54,574 INFO L273 TraceCheckUtils]: 83: Hoare triple {30834#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30834#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:54,574 INFO L273 TraceCheckUtils]: 84: Hoare triple {30834#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30834#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:54,575 INFO L273 TraceCheckUtils]: 85: Hoare triple {30834#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30835#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:54,576 INFO L273 TraceCheckUtils]: 86: Hoare triple {30835#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30835#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:54,576 INFO L273 TraceCheckUtils]: 87: Hoare triple {30835#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30835#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:54,577 INFO L273 TraceCheckUtils]: 88: Hoare triple {30835#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30836#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:54,577 INFO L273 TraceCheckUtils]: 89: Hoare triple {30836#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30836#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:54,578 INFO L273 TraceCheckUtils]: 90: Hoare triple {30836#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30836#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:54,579 INFO L273 TraceCheckUtils]: 91: Hoare triple {30836#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30837#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:54,579 INFO L273 TraceCheckUtils]: 92: Hoare triple {30837#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30837#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:54,580 INFO L273 TraceCheckUtils]: 93: Hoare triple {30837#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30837#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:54,580 INFO L273 TraceCheckUtils]: 94: Hoare triple {30837#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30838#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:54,581 INFO L273 TraceCheckUtils]: 95: Hoare triple {30838#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30838#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:54,581 INFO L273 TraceCheckUtils]: 96: Hoare triple {30838#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30838#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:54,582 INFO L273 TraceCheckUtils]: 97: Hoare triple {30838#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30839#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:54,582 INFO L273 TraceCheckUtils]: 98: Hoare triple {30839#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30839#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:54,583 INFO L273 TraceCheckUtils]: 99: Hoare triple {30839#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30839#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:54,584 INFO L273 TraceCheckUtils]: 100: Hoare triple {30839#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30840#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:54,584 INFO L273 TraceCheckUtils]: 101: Hoare triple {30840#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30840#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:54,585 INFO L273 TraceCheckUtils]: 102: Hoare triple {30840#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30840#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:54,585 INFO L273 TraceCheckUtils]: 103: Hoare triple {30840#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30841#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:54,586 INFO L273 TraceCheckUtils]: 104: Hoare triple {30841#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30841#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:54,586 INFO L273 TraceCheckUtils]: 105: Hoare triple {30841#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30841#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:54,587 INFO L273 TraceCheckUtils]: 106: Hoare triple {30841#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30842#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:54,588 INFO L273 TraceCheckUtils]: 107: Hoare triple {30842#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30842#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:54,588 INFO L273 TraceCheckUtils]: 108: Hoare triple {30842#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30842#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:54,589 INFO L273 TraceCheckUtils]: 109: Hoare triple {30842#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30843#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:54,589 INFO L273 TraceCheckUtils]: 110: Hoare triple {30843#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30843#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:54,590 INFO L273 TraceCheckUtils]: 111: Hoare triple {30843#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30843#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:54,591 INFO L273 TraceCheckUtils]: 112: Hoare triple {30843#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30844#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:54,591 INFO L273 TraceCheckUtils]: 113: Hoare triple {30844#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30844#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:54,592 INFO L273 TraceCheckUtils]: 114: Hoare triple {30844#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30844#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:54,592 INFO L273 TraceCheckUtils]: 115: Hoare triple {30844#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30845#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:54,593 INFO L273 TraceCheckUtils]: 116: Hoare triple {30845#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30845#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:54,593 INFO L273 TraceCheckUtils]: 117: Hoare triple {30845#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30845#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:54,594 INFO L273 TraceCheckUtils]: 118: Hoare triple {30845#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30846#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:54,594 INFO L273 TraceCheckUtils]: 119: Hoare triple {30846#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30846#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:54,595 INFO L273 TraceCheckUtils]: 120: Hoare triple {30846#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30846#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:54,596 INFO L273 TraceCheckUtils]: 121: Hoare triple {30846#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30847#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:54,596 INFO L273 TraceCheckUtils]: 122: Hoare triple {30847#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30847#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:54,597 INFO L273 TraceCheckUtils]: 123: Hoare triple {30847#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30847#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:54,597 INFO L273 TraceCheckUtils]: 124: Hoare triple {30847#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30848#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:54,598 INFO L273 TraceCheckUtils]: 125: Hoare triple {30848#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30848#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:54,598 INFO L273 TraceCheckUtils]: 126: Hoare triple {30848#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30848#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:54,599 INFO L273 TraceCheckUtils]: 127: Hoare triple {30848#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30849#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:54,600 INFO L273 TraceCheckUtils]: 128: Hoare triple {30849#(<= main_~i~0 42)} assume !(~i~0 < 100000); {30808#false} is VALID [2018-11-23 11:59:54,600 INFO L273 TraceCheckUtils]: 129: Hoare triple {30808#false} havoc ~x~0;~x~0 := 0; {30808#false} is VALID [2018-11-23 11:59:54,600 INFO L273 TraceCheckUtils]: 130: Hoare triple {30808#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {30808#false} is VALID [2018-11-23 11:59:54,600 INFO L256 TraceCheckUtils]: 131: Hoare triple {30808#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {30808#false} is VALID [2018-11-23 11:59:54,601 INFO L273 TraceCheckUtils]: 132: Hoare triple {30808#false} ~cond := #in~cond; {30808#false} is VALID [2018-11-23 11:59:54,601 INFO L273 TraceCheckUtils]: 133: Hoare triple {30808#false} assume 0 == ~cond; {30808#false} is VALID [2018-11-23 11:59:54,601 INFO L273 TraceCheckUtils]: 134: Hoare triple {30808#false} assume !false; {30808#false} is VALID [2018-11-23 11:59:54,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:54,613 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:54,613 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-23 11:59:54,621 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:59:54,698 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:59:54,698 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:54,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:55,000 INFO L256 TraceCheckUtils]: 0: Hoare triple {30807#true} call ULTIMATE.init(); {30807#true} is VALID [2018-11-23 11:59:55,000 INFO L273 TraceCheckUtils]: 1: Hoare triple {30807#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {30807#true} is VALID [2018-11-23 11:59:55,000 INFO L273 TraceCheckUtils]: 2: Hoare triple {30807#true} assume true; {30807#true} is VALID [2018-11-23 11:59:55,001 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {30807#true} {30807#true} #88#return; {30807#true} is VALID [2018-11-23 11:59:55,001 INFO L256 TraceCheckUtils]: 4: Hoare triple {30807#true} call #t~ret13 := main(); {30807#true} is VALID [2018-11-23 11:59:55,001 INFO L273 TraceCheckUtils]: 5: Hoare triple {30807#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {30807#true} is VALID [2018-11-23 11:59:55,001 INFO L273 TraceCheckUtils]: 6: Hoare triple {30807#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {30807#true} is VALID [2018-11-23 11:59:55,002 INFO L273 TraceCheckUtils]: 7: Hoare triple {30807#true} ~i~0 := 2; {30809#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:55,002 INFO L273 TraceCheckUtils]: 8: Hoare triple {30809#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30809#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:55,002 INFO L273 TraceCheckUtils]: 9: Hoare triple {30809#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30809#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:55,003 INFO L273 TraceCheckUtils]: 10: Hoare triple {30809#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30810#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:55,003 INFO L273 TraceCheckUtils]: 11: Hoare triple {30810#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30810#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:55,003 INFO L273 TraceCheckUtils]: 12: Hoare triple {30810#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30810#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:55,004 INFO L273 TraceCheckUtils]: 13: Hoare triple {30810#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30811#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:55,004 INFO L273 TraceCheckUtils]: 14: Hoare triple {30811#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30811#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:55,005 INFO L273 TraceCheckUtils]: 15: Hoare triple {30811#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30811#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:55,006 INFO L273 TraceCheckUtils]: 16: Hoare triple {30811#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30812#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:55,006 INFO L273 TraceCheckUtils]: 17: Hoare triple {30812#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30812#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:55,007 INFO L273 TraceCheckUtils]: 18: Hoare triple {30812#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30812#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:55,007 INFO L273 TraceCheckUtils]: 19: Hoare triple {30812#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30813#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:55,008 INFO L273 TraceCheckUtils]: 20: Hoare triple {30813#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30813#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:55,008 INFO L273 TraceCheckUtils]: 21: Hoare triple {30813#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30813#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:55,009 INFO L273 TraceCheckUtils]: 22: Hoare triple {30813#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30814#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:55,009 INFO L273 TraceCheckUtils]: 23: Hoare triple {30814#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30814#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:55,010 INFO L273 TraceCheckUtils]: 24: Hoare triple {30814#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30814#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:55,011 INFO L273 TraceCheckUtils]: 25: Hoare triple {30814#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30815#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:55,011 INFO L273 TraceCheckUtils]: 26: Hoare triple {30815#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30815#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:55,012 INFO L273 TraceCheckUtils]: 27: Hoare triple {30815#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30815#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:55,012 INFO L273 TraceCheckUtils]: 28: Hoare triple {30815#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30816#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:55,013 INFO L273 TraceCheckUtils]: 29: Hoare triple {30816#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30816#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:55,013 INFO L273 TraceCheckUtils]: 30: Hoare triple {30816#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30816#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:55,014 INFO L273 TraceCheckUtils]: 31: Hoare triple {30816#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30817#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:55,015 INFO L273 TraceCheckUtils]: 32: Hoare triple {30817#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30817#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:55,015 INFO L273 TraceCheckUtils]: 33: Hoare triple {30817#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30817#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:55,016 INFO L273 TraceCheckUtils]: 34: Hoare triple {30817#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30818#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:55,016 INFO L273 TraceCheckUtils]: 35: Hoare triple {30818#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30818#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:55,017 INFO L273 TraceCheckUtils]: 36: Hoare triple {30818#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30818#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:55,018 INFO L273 TraceCheckUtils]: 37: Hoare triple {30818#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30819#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:55,018 INFO L273 TraceCheckUtils]: 38: Hoare triple {30819#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30819#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:55,019 INFO L273 TraceCheckUtils]: 39: Hoare triple {30819#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30819#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:55,019 INFO L273 TraceCheckUtils]: 40: Hoare triple {30819#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30820#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:55,020 INFO L273 TraceCheckUtils]: 41: Hoare triple {30820#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30820#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:55,020 INFO L273 TraceCheckUtils]: 42: Hoare triple {30820#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30820#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:55,021 INFO L273 TraceCheckUtils]: 43: Hoare triple {30820#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30821#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:55,021 INFO L273 TraceCheckUtils]: 44: Hoare triple {30821#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30821#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:55,022 INFO L273 TraceCheckUtils]: 45: Hoare triple {30821#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30821#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:55,023 INFO L273 TraceCheckUtils]: 46: Hoare triple {30821#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30822#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:55,023 INFO L273 TraceCheckUtils]: 47: Hoare triple {30822#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30822#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:55,024 INFO L273 TraceCheckUtils]: 48: Hoare triple {30822#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30822#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:55,024 INFO L273 TraceCheckUtils]: 49: Hoare triple {30822#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30823#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:55,025 INFO L273 TraceCheckUtils]: 50: Hoare triple {30823#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30823#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:55,025 INFO L273 TraceCheckUtils]: 51: Hoare triple {30823#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30823#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:55,026 INFO L273 TraceCheckUtils]: 52: Hoare triple {30823#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30824#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:55,027 INFO L273 TraceCheckUtils]: 53: Hoare triple {30824#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30824#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:55,027 INFO L273 TraceCheckUtils]: 54: Hoare triple {30824#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30824#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:55,028 INFO L273 TraceCheckUtils]: 55: Hoare triple {30824#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30825#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:55,028 INFO L273 TraceCheckUtils]: 56: Hoare triple {30825#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30825#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:55,029 INFO L273 TraceCheckUtils]: 57: Hoare triple {30825#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30825#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:55,030 INFO L273 TraceCheckUtils]: 58: Hoare triple {30825#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30826#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:55,030 INFO L273 TraceCheckUtils]: 59: Hoare triple {30826#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30826#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:55,031 INFO L273 TraceCheckUtils]: 60: Hoare triple {30826#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30826#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:55,031 INFO L273 TraceCheckUtils]: 61: Hoare triple {30826#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30827#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:55,032 INFO L273 TraceCheckUtils]: 62: Hoare triple {30827#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30827#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:55,032 INFO L273 TraceCheckUtils]: 63: Hoare triple {30827#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30827#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:55,033 INFO L273 TraceCheckUtils]: 64: Hoare triple {30827#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30828#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:55,033 INFO L273 TraceCheckUtils]: 65: Hoare triple {30828#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30828#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:55,034 INFO L273 TraceCheckUtils]: 66: Hoare triple {30828#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30828#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:55,035 INFO L273 TraceCheckUtils]: 67: Hoare triple {30828#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30829#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:55,035 INFO L273 TraceCheckUtils]: 68: Hoare triple {30829#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30829#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:55,036 INFO L273 TraceCheckUtils]: 69: Hoare triple {30829#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30829#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:55,036 INFO L273 TraceCheckUtils]: 70: Hoare triple {30829#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30830#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:55,037 INFO L273 TraceCheckUtils]: 71: Hoare triple {30830#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30830#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:55,037 INFO L273 TraceCheckUtils]: 72: Hoare triple {30830#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30830#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:55,038 INFO L273 TraceCheckUtils]: 73: Hoare triple {30830#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30831#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:55,039 INFO L273 TraceCheckUtils]: 74: Hoare triple {30831#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30831#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:55,039 INFO L273 TraceCheckUtils]: 75: Hoare triple {30831#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30831#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:55,040 INFO L273 TraceCheckUtils]: 76: Hoare triple {30831#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30832#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:55,040 INFO L273 TraceCheckUtils]: 77: Hoare triple {30832#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30832#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:55,041 INFO L273 TraceCheckUtils]: 78: Hoare triple {30832#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30832#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:55,042 INFO L273 TraceCheckUtils]: 79: Hoare triple {30832#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30833#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:55,042 INFO L273 TraceCheckUtils]: 80: Hoare triple {30833#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30833#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:55,043 INFO L273 TraceCheckUtils]: 81: Hoare triple {30833#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30833#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:55,043 INFO L273 TraceCheckUtils]: 82: Hoare triple {30833#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30834#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:55,044 INFO L273 TraceCheckUtils]: 83: Hoare triple {30834#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30834#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:55,044 INFO L273 TraceCheckUtils]: 84: Hoare triple {30834#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30834#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:55,045 INFO L273 TraceCheckUtils]: 85: Hoare triple {30834#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30835#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:55,046 INFO L273 TraceCheckUtils]: 86: Hoare triple {30835#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30835#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:55,046 INFO L273 TraceCheckUtils]: 87: Hoare triple {30835#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30835#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:55,047 INFO L273 TraceCheckUtils]: 88: Hoare triple {30835#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30836#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:55,047 INFO L273 TraceCheckUtils]: 89: Hoare triple {30836#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30836#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:55,048 INFO L273 TraceCheckUtils]: 90: Hoare triple {30836#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30836#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:55,048 INFO L273 TraceCheckUtils]: 91: Hoare triple {30836#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30837#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:55,049 INFO L273 TraceCheckUtils]: 92: Hoare triple {30837#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30837#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:55,049 INFO L273 TraceCheckUtils]: 93: Hoare triple {30837#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30837#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:55,050 INFO L273 TraceCheckUtils]: 94: Hoare triple {30837#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30838#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:55,051 INFO L273 TraceCheckUtils]: 95: Hoare triple {30838#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30838#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:55,051 INFO L273 TraceCheckUtils]: 96: Hoare triple {30838#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30838#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:55,052 INFO L273 TraceCheckUtils]: 97: Hoare triple {30838#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30839#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:55,052 INFO L273 TraceCheckUtils]: 98: Hoare triple {30839#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30839#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:55,053 INFO L273 TraceCheckUtils]: 99: Hoare triple {30839#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30839#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:55,054 INFO L273 TraceCheckUtils]: 100: Hoare triple {30839#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30840#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:55,054 INFO L273 TraceCheckUtils]: 101: Hoare triple {30840#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30840#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:55,055 INFO L273 TraceCheckUtils]: 102: Hoare triple {30840#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30840#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:55,055 INFO L273 TraceCheckUtils]: 103: Hoare triple {30840#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30841#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:55,056 INFO L273 TraceCheckUtils]: 104: Hoare triple {30841#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30841#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:55,056 INFO L273 TraceCheckUtils]: 105: Hoare triple {30841#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30841#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:55,057 INFO L273 TraceCheckUtils]: 106: Hoare triple {30841#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30842#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:55,058 INFO L273 TraceCheckUtils]: 107: Hoare triple {30842#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30842#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:55,058 INFO L273 TraceCheckUtils]: 108: Hoare triple {30842#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30842#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:55,059 INFO L273 TraceCheckUtils]: 109: Hoare triple {30842#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30843#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:55,059 INFO L273 TraceCheckUtils]: 110: Hoare triple {30843#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30843#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:55,060 INFO L273 TraceCheckUtils]: 111: Hoare triple {30843#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30843#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:55,060 INFO L273 TraceCheckUtils]: 112: Hoare triple {30843#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30844#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:55,061 INFO L273 TraceCheckUtils]: 113: Hoare triple {30844#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30844#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:55,061 INFO L273 TraceCheckUtils]: 114: Hoare triple {30844#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30844#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:55,062 INFO L273 TraceCheckUtils]: 115: Hoare triple {30844#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30845#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:55,063 INFO L273 TraceCheckUtils]: 116: Hoare triple {30845#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30845#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:55,063 INFO L273 TraceCheckUtils]: 117: Hoare triple {30845#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30845#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:55,064 INFO L273 TraceCheckUtils]: 118: Hoare triple {30845#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30846#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:55,064 INFO L273 TraceCheckUtils]: 119: Hoare triple {30846#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30846#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:55,065 INFO L273 TraceCheckUtils]: 120: Hoare triple {30846#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30846#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:55,066 INFO L273 TraceCheckUtils]: 121: Hoare triple {30846#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30847#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:55,066 INFO L273 TraceCheckUtils]: 122: Hoare triple {30847#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30847#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:55,067 INFO L273 TraceCheckUtils]: 123: Hoare triple {30847#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30847#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:55,067 INFO L273 TraceCheckUtils]: 124: Hoare triple {30847#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30848#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:55,068 INFO L273 TraceCheckUtils]: 125: Hoare triple {30848#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {30848#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:55,068 INFO L273 TraceCheckUtils]: 126: Hoare triple {30848#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {30848#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:55,069 INFO L273 TraceCheckUtils]: 127: Hoare triple {30848#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {30849#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:55,070 INFO L273 TraceCheckUtils]: 128: Hoare triple {30849#(<= main_~i~0 42)} assume !(~i~0 < 100000); {30808#false} is VALID [2018-11-23 11:59:55,070 INFO L273 TraceCheckUtils]: 129: Hoare triple {30808#false} havoc ~x~0;~x~0 := 0; {30808#false} is VALID [2018-11-23 11:59:55,070 INFO L273 TraceCheckUtils]: 130: Hoare triple {30808#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {30808#false} is VALID [2018-11-23 11:59:55,070 INFO L256 TraceCheckUtils]: 131: Hoare triple {30808#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {30808#false} is VALID [2018-11-23 11:59:55,070 INFO L273 TraceCheckUtils]: 132: Hoare triple {30808#false} ~cond := #in~cond; {30808#false} is VALID [2018-11-23 11:59:55,071 INFO L273 TraceCheckUtils]: 133: Hoare triple {30808#false} assume 0 == ~cond; {30808#false} is VALID [2018-11-23 11:59:55,071 INFO L273 TraceCheckUtils]: 134: Hoare triple {30808#false} assume !false; {30808#false} is VALID [2018-11-23 11:59:55,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:55,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:55,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 43] total 43 [2018-11-23 11:59:55,102 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 135 [2018-11-23 11:59:55,102 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:55,102 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states. [2018-11-23 11:59:55,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:55,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-11-23 11:59:55,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-11-23 11:59:55,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:59:55,236 INFO L87 Difference]: Start difference. First operand 186 states and 271 transitions. Second operand 43 states. [2018-11-23 11:59:56,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:56,041 INFO L93 Difference]: Finished difference Result 210 states and 303 transitions. [2018-11-23 11:59:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-11-23 11:59:56,041 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 135 [2018-11-23 11:59:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:59:56,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:59:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 303 transitions. [2018-11-23 11:59:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 11:59:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 303 transitions. [2018-11-23 11:59:56,045 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 43 states and 303 transitions. [2018-11-23 11:59:56,339 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 303 edges. 303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:56,343 INFO L225 Difference]: With dead ends: 210 [2018-11-23 11:59:56,343 INFO L226 Difference]: Without dead ends: 193 [2018-11-23 11:59:56,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-11-23 11:59:56,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-11-23 11:59:56,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2018-11-23 11:59:56,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:59:56,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 193 states. Second operand 190 states. [2018-11-23 11:59:56,415 INFO L74 IsIncluded]: Start isIncluded. First operand 193 states. Second operand 190 states. [2018-11-23 11:59:56,415 INFO L87 Difference]: Start difference. First operand 193 states. Second operand 190 states. [2018-11-23 11:59:56,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:56,418 INFO L93 Difference]: Finished difference Result 193 states and 282 transitions. [2018-11-23 11:59:56,419 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 282 transitions. [2018-11-23 11:59:56,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:56,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:56,419 INFO L74 IsIncluded]: Start isIncluded. First operand 190 states. Second operand 193 states. [2018-11-23 11:59:56,419 INFO L87 Difference]: Start difference. First operand 190 states. Second operand 193 states. [2018-11-23 11:59:56,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:59:56,422 INFO L93 Difference]: Finished difference Result 193 states and 282 transitions. [2018-11-23 11:59:56,422 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 282 transitions. [2018-11-23 11:59:56,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:59:56,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:59:56,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:59:56,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:59:56,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-11-23 11:59:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 277 transitions. [2018-11-23 11:59:56,425 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 277 transitions. Word has length 135 [2018-11-23 11:59:56,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:59:56,425 INFO L480 AbstractCegarLoop]: Abstraction has 190 states and 277 transitions. [2018-11-23 11:59:56,425 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-11-23 11:59:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 277 transitions. [2018-11-23 11:59:56,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-11-23 11:59:56,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:59:56,426 INFO L402 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:59:56,427 INFO L423 AbstractCegarLoop]: === Iteration 43 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:59:56,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:59:56,427 INFO L82 PathProgramCache]: Analyzing trace with hash 422967617, now seen corresponding path program 41 times [2018-11-23 11:59:56,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 11:59:56,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 11:59:56,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:56,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 11:59:56,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 11:59:56,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:57,623 INFO L256 TraceCheckUtils]: 0: Hoare triple {32147#true} call ULTIMATE.init(); {32147#true} is VALID [2018-11-23 11:59:57,624 INFO L273 TraceCheckUtils]: 1: Hoare triple {32147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32147#true} is VALID [2018-11-23 11:59:57,624 INFO L273 TraceCheckUtils]: 2: Hoare triple {32147#true} assume true; {32147#true} is VALID [2018-11-23 11:59:57,624 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32147#true} {32147#true} #88#return; {32147#true} is VALID [2018-11-23 11:59:57,624 INFO L256 TraceCheckUtils]: 4: Hoare triple {32147#true} call #t~ret13 := main(); {32147#true} is VALID [2018-11-23 11:59:57,625 INFO L273 TraceCheckUtils]: 5: Hoare triple {32147#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {32147#true} is VALID [2018-11-23 11:59:57,625 INFO L273 TraceCheckUtils]: 6: Hoare triple {32147#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {32147#true} is VALID [2018-11-23 11:59:57,625 INFO L273 TraceCheckUtils]: 7: Hoare triple {32147#true} ~i~0 := 2; {32149#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:57,626 INFO L273 TraceCheckUtils]: 8: Hoare triple {32149#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32149#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:57,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {32149#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32149#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:57,627 INFO L273 TraceCheckUtils]: 10: Hoare triple {32149#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32150#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:57,628 INFO L273 TraceCheckUtils]: 11: Hoare triple {32150#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32150#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:57,628 INFO L273 TraceCheckUtils]: 12: Hoare triple {32150#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32150#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:57,629 INFO L273 TraceCheckUtils]: 13: Hoare triple {32150#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32151#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:57,629 INFO L273 TraceCheckUtils]: 14: Hoare triple {32151#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32151#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:57,630 INFO L273 TraceCheckUtils]: 15: Hoare triple {32151#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32151#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:57,631 INFO L273 TraceCheckUtils]: 16: Hoare triple {32151#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32152#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:57,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {32152#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32152#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:57,632 INFO L273 TraceCheckUtils]: 18: Hoare triple {32152#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32152#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:57,632 INFO L273 TraceCheckUtils]: 19: Hoare triple {32152#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32153#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:57,633 INFO L273 TraceCheckUtils]: 20: Hoare triple {32153#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32153#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:57,633 INFO L273 TraceCheckUtils]: 21: Hoare triple {32153#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32153#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:57,634 INFO L273 TraceCheckUtils]: 22: Hoare triple {32153#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32154#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:57,635 INFO L273 TraceCheckUtils]: 23: Hoare triple {32154#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32154#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:57,635 INFO L273 TraceCheckUtils]: 24: Hoare triple {32154#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32154#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:57,636 INFO L273 TraceCheckUtils]: 25: Hoare triple {32154#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32155#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:57,636 INFO L273 TraceCheckUtils]: 26: Hoare triple {32155#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32155#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:57,637 INFO L273 TraceCheckUtils]: 27: Hoare triple {32155#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32155#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:57,637 INFO L273 TraceCheckUtils]: 28: Hoare triple {32155#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32156#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:57,638 INFO L273 TraceCheckUtils]: 29: Hoare triple {32156#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32156#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:57,638 INFO L273 TraceCheckUtils]: 30: Hoare triple {32156#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32156#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:57,639 INFO L273 TraceCheckUtils]: 31: Hoare triple {32156#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32157#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:57,640 INFO L273 TraceCheckUtils]: 32: Hoare triple {32157#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32157#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:57,640 INFO L273 TraceCheckUtils]: 33: Hoare triple {32157#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32157#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:57,641 INFO L273 TraceCheckUtils]: 34: Hoare triple {32157#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32158#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:57,641 INFO L273 TraceCheckUtils]: 35: Hoare triple {32158#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32158#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:57,642 INFO L273 TraceCheckUtils]: 36: Hoare triple {32158#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32158#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:57,643 INFO L273 TraceCheckUtils]: 37: Hoare triple {32158#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32159#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:57,643 INFO L273 TraceCheckUtils]: 38: Hoare triple {32159#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32159#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:57,644 INFO L273 TraceCheckUtils]: 39: Hoare triple {32159#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32159#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:57,644 INFO L273 TraceCheckUtils]: 40: Hoare triple {32159#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32160#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:57,645 INFO L273 TraceCheckUtils]: 41: Hoare triple {32160#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32160#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:57,645 INFO L273 TraceCheckUtils]: 42: Hoare triple {32160#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32160#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:57,646 INFO L273 TraceCheckUtils]: 43: Hoare triple {32160#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32161#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:57,647 INFO L273 TraceCheckUtils]: 44: Hoare triple {32161#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32161#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:57,647 INFO L273 TraceCheckUtils]: 45: Hoare triple {32161#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32161#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:57,648 INFO L273 TraceCheckUtils]: 46: Hoare triple {32161#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32162#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:57,648 INFO L273 TraceCheckUtils]: 47: Hoare triple {32162#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32162#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:57,649 INFO L273 TraceCheckUtils]: 48: Hoare triple {32162#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32162#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:57,649 INFO L273 TraceCheckUtils]: 49: Hoare triple {32162#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32163#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:57,650 INFO L273 TraceCheckUtils]: 50: Hoare triple {32163#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32163#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:57,650 INFO L273 TraceCheckUtils]: 51: Hoare triple {32163#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32163#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:57,651 INFO L273 TraceCheckUtils]: 52: Hoare triple {32163#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32164#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:57,652 INFO L273 TraceCheckUtils]: 53: Hoare triple {32164#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32164#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:57,652 INFO L273 TraceCheckUtils]: 54: Hoare triple {32164#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32164#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:57,653 INFO L273 TraceCheckUtils]: 55: Hoare triple {32164#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32165#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:57,653 INFO L273 TraceCheckUtils]: 56: Hoare triple {32165#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32165#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:57,654 INFO L273 TraceCheckUtils]: 57: Hoare triple {32165#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32165#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:57,655 INFO L273 TraceCheckUtils]: 58: Hoare triple {32165#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32166#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:57,655 INFO L273 TraceCheckUtils]: 59: Hoare triple {32166#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32166#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:57,656 INFO L273 TraceCheckUtils]: 60: Hoare triple {32166#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32166#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:57,656 INFO L273 TraceCheckUtils]: 61: Hoare triple {32166#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32167#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:57,657 INFO L273 TraceCheckUtils]: 62: Hoare triple {32167#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32167#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:57,657 INFO L273 TraceCheckUtils]: 63: Hoare triple {32167#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32167#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:57,658 INFO L273 TraceCheckUtils]: 64: Hoare triple {32167#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32168#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:57,658 INFO L273 TraceCheckUtils]: 65: Hoare triple {32168#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32168#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:57,659 INFO L273 TraceCheckUtils]: 66: Hoare triple {32168#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32168#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:57,660 INFO L273 TraceCheckUtils]: 67: Hoare triple {32168#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32169#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:57,660 INFO L273 TraceCheckUtils]: 68: Hoare triple {32169#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32169#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:57,661 INFO L273 TraceCheckUtils]: 69: Hoare triple {32169#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32169#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:57,661 INFO L273 TraceCheckUtils]: 70: Hoare triple {32169#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32170#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:57,662 INFO L273 TraceCheckUtils]: 71: Hoare triple {32170#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32170#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:57,662 INFO L273 TraceCheckUtils]: 72: Hoare triple {32170#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32170#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:57,663 INFO L273 TraceCheckUtils]: 73: Hoare triple {32170#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32171#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:57,664 INFO L273 TraceCheckUtils]: 74: Hoare triple {32171#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32171#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:57,664 INFO L273 TraceCheckUtils]: 75: Hoare triple {32171#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32171#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:57,665 INFO L273 TraceCheckUtils]: 76: Hoare triple {32171#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32172#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:57,665 INFO L273 TraceCheckUtils]: 77: Hoare triple {32172#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32172#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:57,666 INFO L273 TraceCheckUtils]: 78: Hoare triple {32172#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32172#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:57,667 INFO L273 TraceCheckUtils]: 79: Hoare triple {32172#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32173#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:57,667 INFO L273 TraceCheckUtils]: 80: Hoare triple {32173#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32173#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:57,668 INFO L273 TraceCheckUtils]: 81: Hoare triple {32173#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32173#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:57,668 INFO L273 TraceCheckUtils]: 82: Hoare triple {32173#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32174#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:57,669 INFO L273 TraceCheckUtils]: 83: Hoare triple {32174#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32174#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:57,669 INFO L273 TraceCheckUtils]: 84: Hoare triple {32174#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32174#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:57,670 INFO L273 TraceCheckUtils]: 85: Hoare triple {32174#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32175#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:57,670 INFO L273 TraceCheckUtils]: 86: Hoare triple {32175#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32175#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:57,671 INFO L273 TraceCheckUtils]: 87: Hoare triple {32175#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32175#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:57,672 INFO L273 TraceCheckUtils]: 88: Hoare triple {32175#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32176#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:57,672 INFO L273 TraceCheckUtils]: 89: Hoare triple {32176#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32176#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:57,673 INFO L273 TraceCheckUtils]: 90: Hoare triple {32176#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32176#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:57,673 INFO L273 TraceCheckUtils]: 91: Hoare triple {32176#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32177#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:57,674 INFO L273 TraceCheckUtils]: 92: Hoare triple {32177#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32177#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:57,674 INFO L273 TraceCheckUtils]: 93: Hoare triple {32177#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32177#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:57,675 INFO L273 TraceCheckUtils]: 94: Hoare triple {32177#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32178#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:57,676 INFO L273 TraceCheckUtils]: 95: Hoare triple {32178#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32178#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:57,676 INFO L273 TraceCheckUtils]: 96: Hoare triple {32178#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32178#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:57,677 INFO L273 TraceCheckUtils]: 97: Hoare triple {32178#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32179#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:57,677 INFO L273 TraceCheckUtils]: 98: Hoare triple {32179#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32179#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:57,678 INFO L273 TraceCheckUtils]: 99: Hoare triple {32179#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32179#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:57,678 INFO L273 TraceCheckUtils]: 100: Hoare triple {32179#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32180#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:57,679 INFO L273 TraceCheckUtils]: 101: Hoare triple {32180#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32180#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:57,679 INFO L273 TraceCheckUtils]: 102: Hoare triple {32180#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32180#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:57,680 INFO L273 TraceCheckUtils]: 103: Hoare triple {32180#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32181#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:57,681 INFO L273 TraceCheckUtils]: 104: Hoare triple {32181#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32181#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:57,681 INFO L273 TraceCheckUtils]: 105: Hoare triple {32181#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32181#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:57,682 INFO L273 TraceCheckUtils]: 106: Hoare triple {32181#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32182#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:57,682 INFO L273 TraceCheckUtils]: 107: Hoare triple {32182#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32182#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:57,683 INFO L273 TraceCheckUtils]: 108: Hoare triple {32182#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32182#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:57,684 INFO L273 TraceCheckUtils]: 109: Hoare triple {32182#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:57,684 INFO L273 TraceCheckUtils]: 110: Hoare triple {32183#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32183#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:57,685 INFO L273 TraceCheckUtils]: 111: Hoare triple {32183#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32183#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:57,685 INFO L273 TraceCheckUtils]: 112: Hoare triple {32183#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32184#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:57,686 INFO L273 TraceCheckUtils]: 113: Hoare triple {32184#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32184#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:57,686 INFO L273 TraceCheckUtils]: 114: Hoare triple {32184#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32184#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:57,687 INFO L273 TraceCheckUtils]: 115: Hoare triple {32184#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32185#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:57,688 INFO L273 TraceCheckUtils]: 116: Hoare triple {32185#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32185#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:57,688 INFO L273 TraceCheckUtils]: 117: Hoare triple {32185#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32185#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:57,689 INFO L273 TraceCheckUtils]: 118: Hoare triple {32185#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32186#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:57,689 INFO L273 TraceCheckUtils]: 119: Hoare triple {32186#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32186#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:57,690 INFO L273 TraceCheckUtils]: 120: Hoare triple {32186#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32186#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:57,690 INFO L273 TraceCheckUtils]: 121: Hoare triple {32186#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32187#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:57,691 INFO L273 TraceCheckUtils]: 122: Hoare triple {32187#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32187#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:57,691 INFO L273 TraceCheckUtils]: 123: Hoare triple {32187#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32187#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:57,692 INFO L273 TraceCheckUtils]: 124: Hoare triple {32187#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32188#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:57,693 INFO L273 TraceCheckUtils]: 125: Hoare triple {32188#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32188#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:57,693 INFO L273 TraceCheckUtils]: 126: Hoare triple {32188#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32188#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:57,694 INFO L273 TraceCheckUtils]: 127: Hoare triple {32188#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32189#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:57,694 INFO L273 TraceCheckUtils]: 128: Hoare triple {32189#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32189#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:57,695 INFO L273 TraceCheckUtils]: 129: Hoare triple {32189#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32189#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:57,696 INFO L273 TraceCheckUtils]: 130: Hoare triple {32189#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32190#(<= main_~i~0 43)} is VALID [2018-11-23 11:59:57,696 INFO L273 TraceCheckUtils]: 131: Hoare triple {32190#(<= main_~i~0 43)} assume !(~i~0 < 100000); {32148#false} is VALID [2018-11-23 11:59:57,696 INFO L273 TraceCheckUtils]: 132: Hoare triple {32148#false} havoc ~x~0;~x~0 := 0; {32148#false} is VALID [2018-11-23 11:59:57,697 INFO L273 TraceCheckUtils]: 133: Hoare triple {32148#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {32148#false} is VALID [2018-11-23 11:59:57,697 INFO L256 TraceCheckUtils]: 134: Hoare triple {32148#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {32148#false} is VALID [2018-11-23 11:59:57,697 INFO L273 TraceCheckUtils]: 135: Hoare triple {32148#false} ~cond := #in~cond; {32148#false} is VALID [2018-11-23 11:59:57,697 INFO L273 TraceCheckUtils]: 136: Hoare triple {32148#false} assume 0 == ~cond; {32148#false} is VALID [2018-11-23 11:59:57,697 INFO L273 TraceCheckUtils]: 137: Hoare triple {32148#false} assume !false; {32148#false} is VALID [2018-11-23 11:59:57,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:57,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 11:59:57,710 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-23 11:59:57,718 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 11:59:57,826 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 42 check-sat command(s) [2018-11-23 11:59:57,826 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:59:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:59:57,871 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:59:58,198 INFO L256 TraceCheckUtils]: 0: Hoare triple {32147#true} call ULTIMATE.init(); {32147#true} is VALID [2018-11-23 11:59:58,199 INFO L273 TraceCheckUtils]: 1: Hoare triple {32147#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {32147#true} is VALID [2018-11-23 11:59:58,199 INFO L273 TraceCheckUtils]: 2: Hoare triple {32147#true} assume true; {32147#true} is VALID [2018-11-23 11:59:58,199 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32147#true} {32147#true} #88#return; {32147#true} is VALID [2018-11-23 11:59:58,199 INFO L256 TraceCheckUtils]: 4: Hoare triple {32147#true} call #t~ret13 := main(); {32147#true} is VALID [2018-11-23 11:59:58,199 INFO L273 TraceCheckUtils]: 5: Hoare triple {32147#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {32147#true} is VALID [2018-11-23 11:59:58,200 INFO L273 TraceCheckUtils]: 6: Hoare triple {32147#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {32147#true} is VALID [2018-11-23 11:59:58,200 INFO L273 TraceCheckUtils]: 7: Hoare triple {32147#true} ~i~0 := 2; {32149#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,201 INFO L273 TraceCheckUtils]: 8: Hoare triple {32149#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32149#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,201 INFO L273 TraceCheckUtils]: 9: Hoare triple {32149#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32149#(<= main_~i~0 2)} is VALID [2018-11-23 11:59:58,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {32149#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32150#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,202 INFO L273 TraceCheckUtils]: 11: Hoare triple {32150#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32150#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {32150#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32150#(<= main_~i~0 3)} is VALID [2018-11-23 11:59:58,202 INFO L273 TraceCheckUtils]: 13: Hoare triple {32150#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32151#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,203 INFO L273 TraceCheckUtils]: 14: Hoare triple {32151#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32151#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,203 INFO L273 TraceCheckUtils]: 15: Hoare triple {32151#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32151#(<= main_~i~0 4)} is VALID [2018-11-23 11:59:58,203 INFO L273 TraceCheckUtils]: 16: Hoare triple {32151#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32152#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,204 INFO L273 TraceCheckUtils]: 17: Hoare triple {32152#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32152#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,204 INFO L273 TraceCheckUtils]: 18: Hoare triple {32152#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32152#(<= main_~i~0 5)} is VALID [2018-11-23 11:59:58,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {32152#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32153#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,206 INFO L273 TraceCheckUtils]: 20: Hoare triple {32153#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32153#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,206 INFO L273 TraceCheckUtils]: 21: Hoare triple {32153#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32153#(<= main_~i~0 6)} is VALID [2018-11-23 11:59:58,207 INFO L273 TraceCheckUtils]: 22: Hoare triple {32153#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32154#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:58,207 INFO L273 TraceCheckUtils]: 23: Hoare triple {32154#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32154#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:58,208 INFO L273 TraceCheckUtils]: 24: Hoare triple {32154#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32154#(<= main_~i~0 7)} is VALID [2018-11-23 11:59:58,208 INFO L273 TraceCheckUtils]: 25: Hoare triple {32154#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32155#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:58,209 INFO L273 TraceCheckUtils]: 26: Hoare triple {32155#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32155#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:58,210 INFO L273 TraceCheckUtils]: 27: Hoare triple {32155#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32155#(<= main_~i~0 8)} is VALID [2018-11-23 11:59:58,210 INFO L273 TraceCheckUtils]: 28: Hoare triple {32155#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32156#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:58,211 INFO L273 TraceCheckUtils]: 29: Hoare triple {32156#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32156#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:58,211 INFO L273 TraceCheckUtils]: 30: Hoare triple {32156#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32156#(<= main_~i~0 9)} is VALID [2018-11-23 11:59:58,212 INFO L273 TraceCheckUtils]: 31: Hoare triple {32156#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32157#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:58,212 INFO L273 TraceCheckUtils]: 32: Hoare triple {32157#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32157#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:58,213 INFO L273 TraceCheckUtils]: 33: Hoare triple {32157#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32157#(<= main_~i~0 10)} is VALID [2018-11-23 11:59:58,214 INFO L273 TraceCheckUtils]: 34: Hoare triple {32157#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32158#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:58,214 INFO L273 TraceCheckUtils]: 35: Hoare triple {32158#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32158#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:58,215 INFO L273 TraceCheckUtils]: 36: Hoare triple {32158#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32158#(<= main_~i~0 11)} is VALID [2018-11-23 11:59:58,215 INFO L273 TraceCheckUtils]: 37: Hoare triple {32158#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32159#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:58,216 INFO L273 TraceCheckUtils]: 38: Hoare triple {32159#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32159#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:58,216 INFO L273 TraceCheckUtils]: 39: Hoare triple {32159#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32159#(<= main_~i~0 12)} is VALID [2018-11-23 11:59:58,217 INFO L273 TraceCheckUtils]: 40: Hoare triple {32159#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32160#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:58,218 INFO L273 TraceCheckUtils]: 41: Hoare triple {32160#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32160#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:58,218 INFO L273 TraceCheckUtils]: 42: Hoare triple {32160#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32160#(<= main_~i~0 13)} is VALID [2018-11-23 11:59:58,219 INFO L273 TraceCheckUtils]: 43: Hoare triple {32160#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32161#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:58,219 INFO L273 TraceCheckUtils]: 44: Hoare triple {32161#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32161#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:58,220 INFO L273 TraceCheckUtils]: 45: Hoare triple {32161#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32161#(<= main_~i~0 14)} is VALID [2018-11-23 11:59:58,221 INFO L273 TraceCheckUtils]: 46: Hoare triple {32161#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32162#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:58,221 INFO L273 TraceCheckUtils]: 47: Hoare triple {32162#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32162#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:58,222 INFO L273 TraceCheckUtils]: 48: Hoare triple {32162#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32162#(<= main_~i~0 15)} is VALID [2018-11-23 11:59:58,222 INFO L273 TraceCheckUtils]: 49: Hoare triple {32162#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32163#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:58,223 INFO L273 TraceCheckUtils]: 50: Hoare triple {32163#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32163#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:58,223 INFO L273 TraceCheckUtils]: 51: Hoare triple {32163#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32163#(<= main_~i~0 16)} is VALID [2018-11-23 11:59:58,224 INFO L273 TraceCheckUtils]: 52: Hoare triple {32163#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32164#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:58,225 INFO L273 TraceCheckUtils]: 53: Hoare triple {32164#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32164#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:58,225 INFO L273 TraceCheckUtils]: 54: Hoare triple {32164#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32164#(<= main_~i~0 17)} is VALID [2018-11-23 11:59:58,226 INFO L273 TraceCheckUtils]: 55: Hoare triple {32164#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32165#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:58,226 INFO L273 TraceCheckUtils]: 56: Hoare triple {32165#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32165#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:58,227 INFO L273 TraceCheckUtils]: 57: Hoare triple {32165#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32165#(<= main_~i~0 18)} is VALID [2018-11-23 11:59:58,227 INFO L273 TraceCheckUtils]: 58: Hoare triple {32165#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32166#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:58,228 INFO L273 TraceCheckUtils]: 59: Hoare triple {32166#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32166#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:58,228 INFO L273 TraceCheckUtils]: 60: Hoare triple {32166#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32166#(<= main_~i~0 19)} is VALID [2018-11-23 11:59:58,229 INFO L273 TraceCheckUtils]: 61: Hoare triple {32166#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32167#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:58,230 INFO L273 TraceCheckUtils]: 62: Hoare triple {32167#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32167#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:58,230 INFO L273 TraceCheckUtils]: 63: Hoare triple {32167#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32167#(<= main_~i~0 20)} is VALID [2018-11-23 11:59:58,231 INFO L273 TraceCheckUtils]: 64: Hoare triple {32167#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32168#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:58,241 INFO L273 TraceCheckUtils]: 65: Hoare triple {32168#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32168#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:58,241 INFO L273 TraceCheckUtils]: 66: Hoare triple {32168#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32168#(<= main_~i~0 21)} is VALID [2018-11-23 11:59:58,242 INFO L273 TraceCheckUtils]: 67: Hoare triple {32168#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32169#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:58,242 INFO L273 TraceCheckUtils]: 68: Hoare triple {32169#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32169#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:58,243 INFO L273 TraceCheckUtils]: 69: Hoare triple {32169#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32169#(<= main_~i~0 22)} is VALID [2018-11-23 11:59:58,243 INFO L273 TraceCheckUtils]: 70: Hoare triple {32169#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32170#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:58,243 INFO L273 TraceCheckUtils]: 71: Hoare triple {32170#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32170#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:58,244 INFO L273 TraceCheckUtils]: 72: Hoare triple {32170#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32170#(<= main_~i~0 23)} is VALID [2018-11-23 11:59:58,244 INFO L273 TraceCheckUtils]: 73: Hoare triple {32170#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32171#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:58,244 INFO L273 TraceCheckUtils]: 74: Hoare triple {32171#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32171#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:58,245 INFO L273 TraceCheckUtils]: 75: Hoare triple {32171#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32171#(<= main_~i~0 24)} is VALID [2018-11-23 11:59:58,245 INFO L273 TraceCheckUtils]: 76: Hoare triple {32171#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32172#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:58,246 INFO L273 TraceCheckUtils]: 77: Hoare triple {32172#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32172#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:58,246 INFO L273 TraceCheckUtils]: 78: Hoare triple {32172#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32172#(<= main_~i~0 25)} is VALID [2018-11-23 11:59:58,247 INFO L273 TraceCheckUtils]: 79: Hoare triple {32172#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32173#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:58,247 INFO L273 TraceCheckUtils]: 80: Hoare triple {32173#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32173#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:58,248 INFO L273 TraceCheckUtils]: 81: Hoare triple {32173#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32173#(<= main_~i~0 26)} is VALID [2018-11-23 11:59:58,249 INFO L273 TraceCheckUtils]: 82: Hoare triple {32173#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32174#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:58,249 INFO L273 TraceCheckUtils]: 83: Hoare triple {32174#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32174#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:58,250 INFO L273 TraceCheckUtils]: 84: Hoare triple {32174#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32174#(<= main_~i~0 27)} is VALID [2018-11-23 11:59:58,250 INFO L273 TraceCheckUtils]: 85: Hoare triple {32174#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32175#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:58,251 INFO L273 TraceCheckUtils]: 86: Hoare triple {32175#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32175#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:58,251 INFO L273 TraceCheckUtils]: 87: Hoare triple {32175#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32175#(<= main_~i~0 28)} is VALID [2018-11-23 11:59:58,252 INFO L273 TraceCheckUtils]: 88: Hoare triple {32175#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32176#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:58,253 INFO L273 TraceCheckUtils]: 89: Hoare triple {32176#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32176#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:58,253 INFO L273 TraceCheckUtils]: 90: Hoare triple {32176#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32176#(<= main_~i~0 29)} is VALID [2018-11-23 11:59:58,254 INFO L273 TraceCheckUtils]: 91: Hoare triple {32176#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32177#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:58,254 INFO L273 TraceCheckUtils]: 92: Hoare triple {32177#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32177#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:58,255 INFO L273 TraceCheckUtils]: 93: Hoare triple {32177#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32177#(<= main_~i~0 30)} is VALID [2018-11-23 11:59:58,256 INFO L273 TraceCheckUtils]: 94: Hoare triple {32177#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32178#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:58,256 INFO L273 TraceCheckUtils]: 95: Hoare triple {32178#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32178#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:58,257 INFO L273 TraceCheckUtils]: 96: Hoare triple {32178#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32178#(<= main_~i~0 31)} is VALID [2018-11-23 11:59:58,257 INFO L273 TraceCheckUtils]: 97: Hoare triple {32178#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32179#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:58,258 INFO L273 TraceCheckUtils]: 98: Hoare triple {32179#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32179#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:58,258 INFO L273 TraceCheckUtils]: 99: Hoare triple {32179#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32179#(<= main_~i~0 32)} is VALID [2018-11-23 11:59:58,259 INFO L273 TraceCheckUtils]: 100: Hoare triple {32179#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32180#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:58,259 INFO L273 TraceCheckUtils]: 101: Hoare triple {32180#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32180#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:58,260 INFO L273 TraceCheckUtils]: 102: Hoare triple {32180#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32180#(<= main_~i~0 33)} is VALID [2018-11-23 11:59:58,261 INFO L273 TraceCheckUtils]: 103: Hoare triple {32180#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32181#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:58,261 INFO L273 TraceCheckUtils]: 104: Hoare triple {32181#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32181#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:58,262 INFO L273 TraceCheckUtils]: 105: Hoare triple {32181#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32181#(<= main_~i~0 34)} is VALID [2018-11-23 11:59:58,262 INFO L273 TraceCheckUtils]: 106: Hoare triple {32181#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32182#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:58,263 INFO L273 TraceCheckUtils]: 107: Hoare triple {32182#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32182#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:58,263 INFO L273 TraceCheckUtils]: 108: Hoare triple {32182#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32182#(<= main_~i~0 35)} is VALID [2018-11-23 11:59:58,264 INFO L273 TraceCheckUtils]: 109: Hoare triple {32182#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32183#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:58,265 INFO L273 TraceCheckUtils]: 110: Hoare triple {32183#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32183#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:58,265 INFO L273 TraceCheckUtils]: 111: Hoare triple {32183#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32183#(<= main_~i~0 36)} is VALID [2018-11-23 11:59:58,266 INFO L273 TraceCheckUtils]: 112: Hoare triple {32183#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32184#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:58,266 INFO L273 TraceCheckUtils]: 113: Hoare triple {32184#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32184#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:58,267 INFO L273 TraceCheckUtils]: 114: Hoare triple {32184#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32184#(<= main_~i~0 37)} is VALID [2018-11-23 11:59:58,268 INFO L273 TraceCheckUtils]: 115: Hoare triple {32184#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32185#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:58,268 INFO L273 TraceCheckUtils]: 116: Hoare triple {32185#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32185#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:58,269 INFO L273 TraceCheckUtils]: 117: Hoare triple {32185#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32185#(<= main_~i~0 38)} is VALID [2018-11-23 11:59:58,269 INFO L273 TraceCheckUtils]: 118: Hoare triple {32185#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32186#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:58,270 INFO L273 TraceCheckUtils]: 119: Hoare triple {32186#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32186#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:58,270 INFO L273 TraceCheckUtils]: 120: Hoare triple {32186#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32186#(<= main_~i~0 39)} is VALID [2018-11-23 11:59:58,271 INFO L273 TraceCheckUtils]: 121: Hoare triple {32186#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32187#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:58,272 INFO L273 TraceCheckUtils]: 122: Hoare triple {32187#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32187#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:58,272 INFO L273 TraceCheckUtils]: 123: Hoare triple {32187#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32187#(<= main_~i~0 40)} is VALID [2018-11-23 11:59:58,273 INFO L273 TraceCheckUtils]: 124: Hoare triple {32187#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32188#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:58,273 INFO L273 TraceCheckUtils]: 125: Hoare triple {32188#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32188#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:58,274 INFO L273 TraceCheckUtils]: 126: Hoare triple {32188#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32188#(<= main_~i~0 41)} is VALID [2018-11-23 11:59:58,274 INFO L273 TraceCheckUtils]: 127: Hoare triple {32188#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32189#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:58,275 INFO L273 TraceCheckUtils]: 128: Hoare triple {32189#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {32189#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:58,275 INFO L273 TraceCheckUtils]: 129: Hoare triple {32189#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {32189#(<= main_~i~0 42)} is VALID [2018-11-23 11:59:58,276 INFO L273 TraceCheckUtils]: 130: Hoare triple {32189#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {32190#(<= main_~i~0 43)} is VALID [2018-11-23 11:59:58,277 INFO L273 TraceCheckUtils]: 131: Hoare triple {32190#(<= main_~i~0 43)} assume !(~i~0 < 100000); {32148#false} is VALID [2018-11-23 11:59:58,277 INFO L273 TraceCheckUtils]: 132: Hoare triple {32148#false} havoc ~x~0;~x~0 := 0; {32148#false} is VALID [2018-11-23 11:59:58,277 INFO L273 TraceCheckUtils]: 133: Hoare triple {32148#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {32148#false} is VALID [2018-11-23 11:59:58,277 INFO L256 TraceCheckUtils]: 134: Hoare triple {32148#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {32148#false} is VALID [2018-11-23 11:59:58,278 INFO L273 TraceCheckUtils]: 135: Hoare triple {32148#false} ~cond := #in~cond; {32148#false} is VALID [2018-11-23 11:59:58,278 INFO L273 TraceCheckUtils]: 136: Hoare triple {32148#false} assume 0 == ~cond; {32148#false} is VALID [2018-11-23 11:59:58,278 INFO L273 TraceCheckUtils]: 137: Hoare triple {32148#false} assume !false; {32148#false} is VALID [2018-11-23 11:59:58,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:59:58,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:59:58,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 44] total 44 [2018-11-23 11:59:58,309 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 138 [2018-11-23 11:59:58,310 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:59:58,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states. [2018-11-23 11:59:58,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:59:58,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-11-23 11:59:58,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-11-23 11:59:58,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 11:59:58,446 INFO L87 Difference]: Start difference. First operand 190 states and 277 transitions. Second operand 44 states. [2018-11-23 12:00:00,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:00,111 INFO L93 Difference]: Finished difference Result 214 states and 309 transitions. [2018-11-23 12:00:00,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-11-23 12:00:00,111 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 138 [2018-11-23 12:00:00,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:00,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:00:00,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 309 transitions. [2018-11-23 12:00:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 12:00:00,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 309 transitions. [2018-11-23 12:00:00,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 44 states and 309 transitions. [2018-11-23 12:00:00,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:00,415 INFO L225 Difference]: With dead ends: 214 [2018-11-23 12:00:00,416 INFO L226 Difference]: Without dead ends: 197 [2018-11-23 12:00:00,416 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-11-23 12:00:00,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-11-23 12:00:00,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-11-23 12:00:00,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:00,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand 194 states. [2018-11-23 12:00:00,455 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand 194 states. [2018-11-23 12:00:00,455 INFO L87 Difference]: Start difference. First operand 197 states. Second operand 194 states. [2018-11-23 12:00:00,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:00,460 INFO L93 Difference]: Finished difference Result 197 states and 288 transitions. [2018-11-23 12:00:00,460 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 288 transitions. [2018-11-23 12:00:00,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:00,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:00,461 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand 197 states. [2018-11-23 12:00:00,461 INFO L87 Difference]: Start difference. First operand 194 states. Second operand 197 states. [2018-11-23 12:00:00,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:00,464 INFO L93 Difference]: Finished difference Result 197 states and 288 transitions. [2018-11-23 12:00:00,465 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 288 transitions. [2018-11-23 12:00:00,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:00,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:00,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:00,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:00,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-11-23 12:00:00,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2018-11-23 12:00:00,468 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 138 [2018-11-23 12:00:00,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:00,468 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2018-11-23 12:00:00,468 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-11-23 12:00:00,468 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2018-11-23 12:00:00,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-23 12:00:00,469 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:00,469 INFO L402 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:00,469 INFO L423 AbstractCegarLoop]: === Iteration 44 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:00,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:00,470 INFO L82 PathProgramCache]: Analyzing trace with hash -155986500, now seen corresponding path program 42 times [2018-11-23 12:00:00,470 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:00,470 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:00,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:00,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:00,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:01,479 INFO L256 TraceCheckUtils]: 0: Hoare triple {33515#true} call ULTIMATE.init(); {33515#true} is VALID [2018-11-23 12:00:01,480 INFO L273 TraceCheckUtils]: 1: Hoare triple {33515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33515#true} is VALID [2018-11-23 12:00:01,480 INFO L273 TraceCheckUtils]: 2: Hoare triple {33515#true} assume true; {33515#true} is VALID [2018-11-23 12:00:01,480 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33515#true} {33515#true} #88#return; {33515#true} is VALID [2018-11-23 12:00:01,480 INFO L256 TraceCheckUtils]: 4: Hoare triple {33515#true} call #t~ret13 := main(); {33515#true} is VALID [2018-11-23 12:00:01,480 INFO L273 TraceCheckUtils]: 5: Hoare triple {33515#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {33515#true} is VALID [2018-11-23 12:00:01,481 INFO L273 TraceCheckUtils]: 6: Hoare triple {33515#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {33515#true} is VALID [2018-11-23 12:00:01,481 INFO L273 TraceCheckUtils]: 7: Hoare triple {33515#true} ~i~0 := 2; {33517#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:01,482 INFO L273 TraceCheckUtils]: 8: Hoare triple {33517#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33517#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:01,482 INFO L273 TraceCheckUtils]: 9: Hoare triple {33517#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33517#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:01,483 INFO L273 TraceCheckUtils]: 10: Hoare triple {33517#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33518#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:01,483 INFO L273 TraceCheckUtils]: 11: Hoare triple {33518#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33518#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:01,483 INFO L273 TraceCheckUtils]: 12: Hoare triple {33518#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33518#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:01,484 INFO L273 TraceCheckUtils]: 13: Hoare triple {33518#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33519#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:01,484 INFO L273 TraceCheckUtils]: 14: Hoare triple {33519#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33519#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:01,484 INFO L273 TraceCheckUtils]: 15: Hoare triple {33519#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33519#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:01,485 INFO L273 TraceCheckUtils]: 16: Hoare triple {33519#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33520#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:01,486 INFO L273 TraceCheckUtils]: 17: Hoare triple {33520#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33520#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:01,486 INFO L273 TraceCheckUtils]: 18: Hoare triple {33520#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33520#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:01,494 INFO L273 TraceCheckUtils]: 19: Hoare triple {33520#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33521#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:01,494 INFO L273 TraceCheckUtils]: 20: Hoare triple {33521#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33521#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:01,495 INFO L273 TraceCheckUtils]: 21: Hoare triple {33521#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33521#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:01,495 INFO L273 TraceCheckUtils]: 22: Hoare triple {33521#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33522#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:01,496 INFO L273 TraceCheckUtils]: 23: Hoare triple {33522#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33522#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:01,496 INFO L273 TraceCheckUtils]: 24: Hoare triple {33522#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33522#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:01,496 INFO L273 TraceCheckUtils]: 25: Hoare triple {33522#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33523#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:01,497 INFO L273 TraceCheckUtils]: 26: Hoare triple {33523#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33523#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:01,497 INFO L273 TraceCheckUtils]: 27: Hoare triple {33523#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33523#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:01,497 INFO L273 TraceCheckUtils]: 28: Hoare triple {33523#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33524#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:01,498 INFO L273 TraceCheckUtils]: 29: Hoare triple {33524#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33524#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:01,498 INFO L273 TraceCheckUtils]: 30: Hoare triple {33524#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33524#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:01,499 INFO L273 TraceCheckUtils]: 31: Hoare triple {33524#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33525#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:01,499 INFO L273 TraceCheckUtils]: 32: Hoare triple {33525#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33525#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:01,500 INFO L273 TraceCheckUtils]: 33: Hoare triple {33525#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33525#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:01,500 INFO L273 TraceCheckUtils]: 34: Hoare triple {33525#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33526#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:01,501 INFO L273 TraceCheckUtils]: 35: Hoare triple {33526#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33526#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:01,501 INFO L273 TraceCheckUtils]: 36: Hoare triple {33526#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33526#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:01,502 INFO L273 TraceCheckUtils]: 37: Hoare triple {33526#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33527#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:01,503 INFO L273 TraceCheckUtils]: 38: Hoare triple {33527#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33527#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:01,503 INFO L273 TraceCheckUtils]: 39: Hoare triple {33527#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33527#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:01,504 INFO L273 TraceCheckUtils]: 40: Hoare triple {33527#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33528#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:01,504 INFO L273 TraceCheckUtils]: 41: Hoare triple {33528#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33528#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:01,505 INFO L273 TraceCheckUtils]: 42: Hoare triple {33528#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33528#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:01,506 INFO L273 TraceCheckUtils]: 43: Hoare triple {33528#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33529#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:01,506 INFO L273 TraceCheckUtils]: 44: Hoare triple {33529#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33529#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:01,507 INFO L273 TraceCheckUtils]: 45: Hoare triple {33529#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33529#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:01,507 INFO L273 TraceCheckUtils]: 46: Hoare triple {33529#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33530#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:01,508 INFO L273 TraceCheckUtils]: 47: Hoare triple {33530#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33530#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:01,508 INFO L273 TraceCheckUtils]: 48: Hoare triple {33530#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33530#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:01,509 INFO L273 TraceCheckUtils]: 49: Hoare triple {33530#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33531#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:01,510 INFO L273 TraceCheckUtils]: 50: Hoare triple {33531#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33531#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:01,510 INFO L273 TraceCheckUtils]: 51: Hoare triple {33531#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33531#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:01,511 INFO L273 TraceCheckUtils]: 52: Hoare triple {33531#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33532#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:01,511 INFO L273 TraceCheckUtils]: 53: Hoare triple {33532#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33532#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:01,512 INFO L273 TraceCheckUtils]: 54: Hoare triple {33532#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33532#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:01,513 INFO L273 TraceCheckUtils]: 55: Hoare triple {33532#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33533#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:01,513 INFO L273 TraceCheckUtils]: 56: Hoare triple {33533#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33533#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:01,514 INFO L273 TraceCheckUtils]: 57: Hoare triple {33533#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33533#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:01,514 INFO L273 TraceCheckUtils]: 58: Hoare triple {33533#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33534#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:01,515 INFO L273 TraceCheckUtils]: 59: Hoare triple {33534#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33534#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:01,515 INFO L273 TraceCheckUtils]: 60: Hoare triple {33534#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33534#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:01,516 INFO L273 TraceCheckUtils]: 61: Hoare triple {33534#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33535#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:01,517 INFO L273 TraceCheckUtils]: 62: Hoare triple {33535#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33535#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:01,517 INFO L273 TraceCheckUtils]: 63: Hoare triple {33535#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33535#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:01,518 INFO L273 TraceCheckUtils]: 64: Hoare triple {33535#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33536#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:01,518 INFO L273 TraceCheckUtils]: 65: Hoare triple {33536#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33536#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:01,519 INFO L273 TraceCheckUtils]: 66: Hoare triple {33536#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33536#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:01,519 INFO L273 TraceCheckUtils]: 67: Hoare triple {33536#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33537#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:01,520 INFO L273 TraceCheckUtils]: 68: Hoare triple {33537#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33537#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:01,520 INFO L273 TraceCheckUtils]: 69: Hoare triple {33537#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33537#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:01,521 INFO L273 TraceCheckUtils]: 70: Hoare triple {33537#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33538#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:01,522 INFO L273 TraceCheckUtils]: 71: Hoare triple {33538#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33538#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:01,522 INFO L273 TraceCheckUtils]: 72: Hoare triple {33538#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33538#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:01,523 INFO L273 TraceCheckUtils]: 73: Hoare triple {33538#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33539#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:01,530 INFO L273 TraceCheckUtils]: 74: Hoare triple {33539#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33539#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:01,530 INFO L273 TraceCheckUtils]: 75: Hoare triple {33539#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33539#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:01,531 INFO L273 TraceCheckUtils]: 76: Hoare triple {33539#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33540#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:01,531 INFO L273 TraceCheckUtils]: 77: Hoare triple {33540#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33540#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:01,531 INFO L273 TraceCheckUtils]: 78: Hoare triple {33540#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33540#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:01,532 INFO L273 TraceCheckUtils]: 79: Hoare triple {33540#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33541#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:01,532 INFO L273 TraceCheckUtils]: 80: Hoare triple {33541#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33541#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:01,532 INFO L273 TraceCheckUtils]: 81: Hoare triple {33541#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33541#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:01,533 INFO L273 TraceCheckUtils]: 82: Hoare triple {33541#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33542#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:01,533 INFO L273 TraceCheckUtils]: 83: Hoare triple {33542#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33542#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:01,534 INFO L273 TraceCheckUtils]: 84: Hoare triple {33542#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33542#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:01,534 INFO L273 TraceCheckUtils]: 85: Hoare triple {33542#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33543#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:01,534 INFO L273 TraceCheckUtils]: 86: Hoare triple {33543#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33543#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:01,535 INFO L273 TraceCheckUtils]: 87: Hoare triple {33543#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33543#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:01,536 INFO L273 TraceCheckUtils]: 88: Hoare triple {33543#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33544#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:01,536 INFO L273 TraceCheckUtils]: 89: Hoare triple {33544#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33544#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:01,537 INFO L273 TraceCheckUtils]: 90: Hoare triple {33544#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33544#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:01,537 INFO L273 TraceCheckUtils]: 91: Hoare triple {33544#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33545#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:01,538 INFO L273 TraceCheckUtils]: 92: Hoare triple {33545#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33545#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:01,538 INFO L273 TraceCheckUtils]: 93: Hoare triple {33545#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33545#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:01,539 INFO L273 TraceCheckUtils]: 94: Hoare triple {33545#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33546#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:01,540 INFO L273 TraceCheckUtils]: 95: Hoare triple {33546#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33546#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:01,540 INFO L273 TraceCheckUtils]: 96: Hoare triple {33546#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33546#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:01,541 INFO L273 TraceCheckUtils]: 97: Hoare triple {33546#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33547#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:01,541 INFO L273 TraceCheckUtils]: 98: Hoare triple {33547#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33547#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:01,542 INFO L273 TraceCheckUtils]: 99: Hoare triple {33547#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33547#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:01,542 INFO L273 TraceCheckUtils]: 100: Hoare triple {33547#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33548#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:01,543 INFO L273 TraceCheckUtils]: 101: Hoare triple {33548#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33548#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:01,544 INFO L273 TraceCheckUtils]: 102: Hoare triple {33548#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33548#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:01,544 INFO L273 TraceCheckUtils]: 103: Hoare triple {33548#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33549#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:01,545 INFO L273 TraceCheckUtils]: 104: Hoare triple {33549#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33549#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:01,545 INFO L273 TraceCheckUtils]: 105: Hoare triple {33549#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33549#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:01,546 INFO L273 TraceCheckUtils]: 106: Hoare triple {33549#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33550#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:01,546 INFO L273 TraceCheckUtils]: 107: Hoare triple {33550#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33550#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:01,547 INFO L273 TraceCheckUtils]: 108: Hoare triple {33550#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33550#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:01,548 INFO L273 TraceCheckUtils]: 109: Hoare triple {33550#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33551#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:01,548 INFO L273 TraceCheckUtils]: 110: Hoare triple {33551#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33551#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:01,549 INFO L273 TraceCheckUtils]: 111: Hoare triple {33551#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33551#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:01,549 INFO L273 TraceCheckUtils]: 112: Hoare triple {33551#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33552#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:01,550 INFO L273 TraceCheckUtils]: 113: Hoare triple {33552#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33552#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:01,550 INFO L273 TraceCheckUtils]: 114: Hoare triple {33552#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33552#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:01,551 INFO L273 TraceCheckUtils]: 115: Hoare triple {33552#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33553#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:01,552 INFO L273 TraceCheckUtils]: 116: Hoare triple {33553#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33553#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:01,552 INFO L273 TraceCheckUtils]: 117: Hoare triple {33553#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33553#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:01,553 INFO L273 TraceCheckUtils]: 118: Hoare triple {33553#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33554#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:01,553 INFO L273 TraceCheckUtils]: 119: Hoare triple {33554#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33554#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:01,554 INFO L273 TraceCheckUtils]: 120: Hoare triple {33554#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33554#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:01,555 INFO L273 TraceCheckUtils]: 121: Hoare triple {33554#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33555#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:01,555 INFO L273 TraceCheckUtils]: 122: Hoare triple {33555#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33555#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:01,556 INFO L273 TraceCheckUtils]: 123: Hoare triple {33555#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33555#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:01,556 INFO L273 TraceCheckUtils]: 124: Hoare triple {33555#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33556#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:01,557 INFO L273 TraceCheckUtils]: 125: Hoare triple {33556#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33556#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:01,557 INFO L273 TraceCheckUtils]: 126: Hoare triple {33556#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33556#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:01,558 INFO L273 TraceCheckUtils]: 127: Hoare triple {33556#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33557#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:01,559 INFO L273 TraceCheckUtils]: 128: Hoare triple {33557#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33557#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:01,559 INFO L273 TraceCheckUtils]: 129: Hoare triple {33557#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33557#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:01,560 INFO L273 TraceCheckUtils]: 130: Hoare triple {33557#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33558#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:01,560 INFO L273 TraceCheckUtils]: 131: Hoare triple {33558#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33558#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:01,561 INFO L273 TraceCheckUtils]: 132: Hoare triple {33558#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33558#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:01,561 INFO L273 TraceCheckUtils]: 133: Hoare triple {33558#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33559#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:01,562 INFO L273 TraceCheckUtils]: 134: Hoare triple {33559#(<= main_~i~0 44)} assume !(~i~0 < 100000); {33516#false} is VALID [2018-11-23 12:00:01,562 INFO L273 TraceCheckUtils]: 135: Hoare triple {33516#false} havoc ~x~0;~x~0 := 0; {33516#false} is VALID [2018-11-23 12:00:01,562 INFO L273 TraceCheckUtils]: 136: Hoare triple {33516#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {33516#false} is VALID [2018-11-23 12:00:01,563 INFO L256 TraceCheckUtils]: 137: Hoare triple {33516#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {33516#false} is VALID [2018-11-23 12:00:01,563 INFO L273 TraceCheckUtils]: 138: Hoare triple {33516#false} ~cond := #in~cond; {33516#false} is VALID [2018-11-23 12:00:01,563 INFO L273 TraceCheckUtils]: 139: Hoare triple {33516#false} assume 0 == ~cond; {33516#false} is VALID [2018-11-23 12:00:01,563 INFO L273 TraceCheckUtils]: 140: Hoare triple {33516#false} assume !false; {33516#false} is VALID [2018-11-23 12:00:01,576 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:01,576 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:01,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 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-23 12:00:01,585 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:00:01,713 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 43 check-sat command(s) [2018-11-23 12:00:01,713 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:01,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:01,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:02,247 INFO L256 TraceCheckUtils]: 0: Hoare triple {33515#true} call ULTIMATE.init(); {33515#true} is VALID [2018-11-23 12:00:02,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {33515#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {33515#true} is VALID [2018-11-23 12:00:02,248 INFO L273 TraceCheckUtils]: 2: Hoare triple {33515#true} assume true; {33515#true} is VALID [2018-11-23 12:00:02,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {33515#true} {33515#true} #88#return; {33515#true} is VALID [2018-11-23 12:00:02,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {33515#true} call #t~ret13 := main(); {33515#true} is VALID [2018-11-23 12:00:02,248 INFO L273 TraceCheckUtils]: 5: Hoare triple {33515#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {33515#true} is VALID [2018-11-23 12:00:02,249 INFO L273 TraceCheckUtils]: 6: Hoare triple {33515#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {33515#true} is VALID [2018-11-23 12:00:02,249 INFO L273 TraceCheckUtils]: 7: Hoare triple {33515#true} ~i~0 := 2; {33517#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:02,250 INFO L273 TraceCheckUtils]: 8: Hoare triple {33517#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33517#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:02,250 INFO L273 TraceCheckUtils]: 9: Hoare triple {33517#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33517#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:02,250 INFO L273 TraceCheckUtils]: 10: Hoare triple {33517#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33518#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:02,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {33518#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33518#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:02,251 INFO L273 TraceCheckUtils]: 12: Hoare triple {33518#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33518#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:02,252 INFO L273 TraceCheckUtils]: 13: Hoare triple {33518#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33519#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:02,252 INFO L273 TraceCheckUtils]: 14: Hoare triple {33519#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33519#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:02,253 INFO L273 TraceCheckUtils]: 15: Hoare triple {33519#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33519#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:02,253 INFO L273 TraceCheckUtils]: 16: Hoare triple {33519#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33520#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:02,254 INFO L273 TraceCheckUtils]: 17: Hoare triple {33520#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33520#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:02,254 INFO L273 TraceCheckUtils]: 18: Hoare triple {33520#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33520#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:02,255 INFO L273 TraceCheckUtils]: 19: Hoare triple {33520#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33521#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:02,256 INFO L273 TraceCheckUtils]: 20: Hoare triple {33521#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33521#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:02,256 INFO L273 TraceCheckUtils]: 21: Hoare triple {33521#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33521#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:02,257 INFO L273 TraceCheckUtils]: 22: Hoare triple {33521#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33522#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:02,257 INFO L273 TraceCheckUtils]: 23: Hoare triple {33522#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33522#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:02,258 INFO L273 TraceCheckUtils]: 24: Hoare triple {33522#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33522#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:02,258 INFO L273 TraceCheckUtils]: 25: Hoare triple {33522#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33523#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:02,259 INFO L273 TraceCheckUtils]: 26: Hoare triple {33523#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33523#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:02,259 INFO L273 TraceCheckUtils]: 27: Hoare triple {33523#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33523#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:02,260 INFO L273 TraceCheckUtils]: 28: Hoare triple {33523#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33524#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:02,261 INFO L273 TraceCheckUtils]: 29: Hoare triple {33524#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33524#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:02,261 INFO L273 TraceCheckUtils]: 30: Hoare triple {33524#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33524#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:02,262 INFO L273 TraceCheckUtils]: 31: Hoare triple {33524#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33525#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:02,262 INFO L273 TraceCheckUtils]: 32: Hoare triple {33525#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33525#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:02,263 INFO L273 TraceCheckUtils]: 33: Hoare triple {33525#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33525#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:02,264 INFO L273 TraceCheckUtils]: 34: Hoare triple {33525#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33526#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:02,264 INFO L273 TraceCheckUtils]: 35: Hoare triple {33526#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33526#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:02,265 INFO L273 TraceCheckUtils]: 36: Hoare triple {33526#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33526#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:02,265 INFO L273 TraceCheckUtils]: 37: Hoare triple {33526#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33527#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:02,266 INFO L273 TraceCheckUtils]: 38: Hoare triple {33527#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33527#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:02,266 INFO L273 TraceCheckUtils]: 39: Hoare triple {33527#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33527#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:02,267 INFO L273 TraceCheckUtils]: 40: Hoare triple {33527#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33528#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:02,268 INFO L273 TraceCheckUtils]: 41: Hoare triple {33528#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33528#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:02,268 INFO L273 TraceCheckUtils]: 42: Hoare triple {33528#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33528#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:02,269 INFO L273 TraceCheckUtils]: 43: Hoare triple {33528#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33529#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:02,269 INFO L273 TraceCheckUtils]: 44: Hoare triple {33529#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33529#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:02,270 INFO L273 TraceCheckUtils]: 45: Hoare triple {33529#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33529#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:02,270 INFO L273 TraceCheckUtils]: 46: Hoare triple {33529#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33530#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:02,271 INFO L273 TraceCheckUtils]: 47: Hoare triple {33530#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33530#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:02,271 INFO L273 TraceCheckUtils]: 48: Hoare triple {33530#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33530#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:02,272 INFO L273 TraceCheckUtils]: 49: Hoare triple {33530#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33531#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:02,273 INFO L273 TraceCheckUtils]: 50: Hoare triple {33531#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33531#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:02,273 INFO L273 TraceCheckUtils]: 51: Hoare triple {33531#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33531#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:02,274 INFO L273 TraceCheckUtils]: 52: Hoare triple {33531#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33532#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:02,274 INFO L273 TraceCheckUtils]: 53: Hoare triple {33532#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33532#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:02,275 INFO L273 TraceCheckUtils]: 54: Hoare triple {33532#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33532#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:02,276 INFO L273 TraceCheckUtils]: 55: Hoare triple {33532#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33533#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:02,276 INFO L273 TraceCheckUtils]: 56: Hoare triple {33533#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33533#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:02,277 INFO L273 TraceCheckUtils]: 57: Hoare triple {33533#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33533#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:02,277 INFO L273 TraceCheckUtils]: 58: Hoare triple {33533#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33534#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:02,278 INFO L273 TraceCheckUtils]: 59: Hoare triple {33534#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33534#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:02,278 INFO L273 TraceCheckUtils]: 60: Hoare triple {33534#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33534#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:02,279 INFO L273 TraceCheckUtils]: 61: Hoare triple {33534#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33535#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:02,280 INFO L273 TraceCheckUtils]: 62: Hoare triple {33535#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33535#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:02,280 INFO L273 TraceCheckUtils]: 63: Hoare triple {33535#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33535#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:02,281 INFO L273 TraceCheckUtils]: 64: Hoare triple {33535#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33536#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:02,281 INFO L273 TraceCheckUtils]: 65: Hoare triple {33536#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33536#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:02,282 INFO L273 TraceCheckUtils]: 66: Hoare triple {33536#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33536#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:02,283 INFO L273 TraceCheckUtils]: 67: Hoare triple {33536#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33537#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:02,283 INFO L273 TraceCheckUtils]: 68: Hoare triple {33537#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33537#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:02,284 INFO L273 TraceCheckUtils]: 69: Hoare triple {33537#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33537#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:02,284 INFO L273 TraceCheckUtils]: 70: Hoare triple {33537#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33538#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:02,285 INFO L273 TraceCheckUtils]: 71: Hoare triple {33538#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33538#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:02,285 INFO L273 TraceCheckUtils]: 72: Hoare triple {33538#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33538#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:02,286 INFO L273 TraceCheckUtils]: 73: Hoare triple {33538#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33539#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:02,286 INFO L273 TraceCheckUtils]: 74: Hoare triple {33539#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33539#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:02,287 INFO L273 TraceCheckUtils]: 75: Hoare triple {33539#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33539#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:02,288 INFO L273 TraceCheckUtils]: 76: Hoare triple {33539#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33540#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:02,288 INFO L273 TraceCheckUtils]: 77: Hoare triple {33540#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33540#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:02,289 INFO L273 TraceCheckUtils]: 78: Hoare triple {33540#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33540#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:02,289 INFO L273 TraceCheckUtils]: 79: Hoare triple {33540#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33541#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:02,290 INFO L273 TraceCheckUtils]: 80: Hoare triple {33541#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33541#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:02,290 INFO L273 TraceCheckUtils]: 81: Hoare triple {33541#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33541#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:02,291 INFO L273 TraceCheckUtils]: 82: Hoare triple {33541#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33542#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:02,292 INFO L273 TraceCheckUtils]: 83: Hoare triple {33542#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33542#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:02,292 INFO L273 TraceCheckUtils]: 84: Hoare triple {33542#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33542#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:02,293 INFO L273 TraceCheckUtils]: 85: Hoare triple {33542#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33543#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:02,293 INFO L273 TraceCheckUtils]: 86: Hoare triple {33543#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33543#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:02,294 INFO L273 TraceCheckUtils]: 87: Hoare triple {33543#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33543#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:02,295 INFO L273 TraceCheckUtils]: 88: Hoare triple {33543#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33544#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:02,295 INFO L273 TraceCheckUtils]: 89: Hoare triple {33544#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33544#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:02,296 INFO L273 TraceCheckUtils]: 90: Hoare triple {33544#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33544#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:02,296 INFO L273 TraceCheckUtils]: 91: Hoare triple {33544#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33545#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:02,297 INFO L273 TraceCheckUtils]: 92: Hoare triple {33545#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33545#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:02,297 INFO L273 TraceCheckUtils]: 93: Hoare triple {33545#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33545#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:02,298 INFO L273 TraceCheckUtils]: 94: Hoare triple {33545#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33546#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:02,298 INFO L273 TraceCheckUtils]: 95: Hoare triple {33546#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33546#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:02,299 INFO L273 TraceCheckUtils]: 96: Hoare triple {33546#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33546#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:02,300 INFO L273 TraceCheckUtils]: 97: Hoare triple {33546#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33547#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:02,300 INFO L273 TraceCheckUtils]: 98: Hoare triple {33547#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33547#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:02,301 INFO L273 TraceCheckUtils]: 99: Hoare triple {33547#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33547#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:02,301 INFO L273 TraceCheckUtils]: 100: Hoare triple {33547#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33548#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:02,302 INFO L273 TraceCheckUtils]: 101: Hoare triple {33548#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33548#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:02,302 INFO L273 TraceCheckUtils]: 102: Hoare triple {33548#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33548#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:02,303 INFO L273 TraceCheckUtils]: 103: Hoare triple {33548#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33549#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:02,304 INFO L273 TraceCheckUtils]: 104: Hoare triple {33549#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33549#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:02,304 INFO L273 TraceCheckUtils]: 105: Hoare triple {33549#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33549#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:02,305 INFO L273 TraceCheckUtils]: 106: Hoare triple {33549#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33550#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:02,305 INFO L273 TraceCheckUtils]: 107: Hoare triple {33550#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33550#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:02,306 INFO L273 TraceCheckUtils]: 108: Hoare triple {33550#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33550#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:02,307 INFO L273 TraceCheckUtils]: 109: Hoare triple {33550#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33551#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:02,307 INFO L273 TraceCheckUtils]: 110: Hoare triple {33551#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33551#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:02,308 INFO L273 TraceCheckUtils]: 111: Hoare triple {33551#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33551#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:02,308 INFO L273 TraceCheckUtils]: 112: Hoare triple {33551#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33552#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:02,309 INFO L273 TraceCheckUtils]: 113: Hoare triple {33552#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33552#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:02,309 INFO L273 TraceCheckUtils]: 114: Hoare triple {33552#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33552#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:02,310 INFO L273 TraceCheckUtils]: 115: Hoare triple {33552#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33553#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:02,311 INFO L273 TraceCheckUtils]: 116: Hoare triple {33553#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33553#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:02,311 INFO L273 TraceCheckUtils]: 117: Hoare triple {33553#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33553#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:02,312 INFO L273 TraceCheckUtils]: 118: Hoare triple {33553#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33554#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:02,312 INFO L273 TraceCheckUtils]: 119: Hoare triple {33554#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33554#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:02,313 INFO L273 TraceCheckUtils]: 120: Hoare triple {33554#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33554#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:02,313 INFO L273 TraceCheckUtils]: 121: Hoare triple {33554#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33555#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:02,314 INFO L273 TraceCheckUtils]: 122: Hoare triple {33555#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33555#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:02,314 INFO L273 TraceCheckUtils]: 123: Hoare triple {33555#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33555#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:02,315 INFO L273 TraceCheckUtils]: 124: Hoare triple {33555#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33556#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:02,316 INFO L273 TraceCheckUtils]: 125: Hoare triple {33556#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33556#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:02,316 INFO L273 TraceCheckUtils]: 126: Hoare triple {33556#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33556#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:02,317 INFO L273 TraceCheckUtils]: 127: Hoare triple {33556#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33557#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:02,317 INFO L273 TraceCheckUtils]: 128: Hoare triple {33557#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33557#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:02,318 INFO L273 TraceCheckUtils]: 129: Hoare triple {33557#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33557#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:02,319 INFO L273 TraceCheckUtils]: 130: Hoare triple {33557#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33558#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:02,319 INFO L273 TraceCheckUtils]: 131: Hoare triple {33558#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {33558#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:02,320 INFO L273 TraceCheckUtils]: 132: Hoare triple {33558#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {33558#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:02,320 INFO L273 TraceCheckUtils]: 133: Hoare triple {33558#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {33559#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:02,321 INFO L273 TraceCheckUtils]: 134: Hoare triple {33559#(<= main_~i~0 44)} assume !(~i~0 < 100000); {33516#false} is VALID [2018-11-23 12:00:02,321 INFO L273 TraceCheckUtils]: 135: Hoare triple {33516#false} havoc ~x~0;~x~0 := 0; {33516#false} is VALID [2018-11-23 12:00:02,321 INFO L273 TraceCheckUtils]: 136: Hoare triple {33516#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {33516#false} is VALID [2018-11-23 12:00:02,322 INFO L256 TraceCheckUtils]: 137: Hoare triple {33516#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {33516#false} is VALID [2018-11-23 12:00:02,322 INFO L273 TraceCheckUtils]: 138: Hoare triple {33516#false} ~cond := #in~cond; {33516#false} is VALID [2018-11-23 12:00:02,322 INFO L273 TraceCheckUtils]: 139: Hoare triple {33516#false} assume 0 == ~cond; {33516#false} is VALID [2018-11-23 12:00:02,322 INFO L273 TraceCheckUtils]: 140: Hoare triple {33516#false} assume !false; {33516#false} is VALID [2018-11-23 12:00:02,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:02,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:02,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45] total 45 [2018-11-23 12:00:02,354 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 141 [2018-11-23 12:00:02,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:02,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states. [2018-11-23 12:00:02,491 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:02,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-11-23 12:00:02,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-11-23 12:00:02,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:00:02,493 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand 45 states. [2018-11-23 12:00:03,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:03,706 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2018-11-23 12:00:03,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-11-23 12:00:03,706 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 141 [2018-11-23 12:00:03,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:03,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:00:03,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 315 transitions. [2018-11-23 12:00:03,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 12:00:03,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 315 transitions. [2018-11-23 12:00:03,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 45 states and 315 transitions. [2018-11-23 12:00:04,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:04,013 INFO L225 Difference]: With dead ends: 218 [2018-11-23 12:00:04,013 INFO L226 Difference]: Without dead ends: 201 [2018-11-23 12:00:04,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-11-23 12:00:04,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-11-23 12:00:04,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 198. [2018-11-23 12:00:04,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:04,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand 198 states. [2018-11-23 12:00:04,057 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand 198 states. [2018-11-23 12:00:04,057 INFO L87 Difference]: Start difference. First operand 201 states. Second operand 198 states. [2018-11-23 12:00:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:04,060 INFO L93 Difference]: Finished difference Result 201 states and 294 transitions. [2018-11-23 12:00:04,061 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 294 transitions. [2018-11-23 12:00:04,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:04,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:04,061 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand 201 states. [2018-11-23 12:00:04,061 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 201 states. [2018-11-23 12:00:04,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:04,064 INFO L93 Difference]: Finished difference Result 201 states and 294 transitions. [2018-11-23 12:00:04,064 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 294 transitions. [2018-11-23 12:00:04,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:04,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:04,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:04,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:04,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-11-23 12:00:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 289 transitions. [2018-11-23 12:00:04,067 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 289 transitions. Word has length 141 [2018-11-23 12:00:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:04,067 INFO L480 AbstractCegarLoop]: Abstraction has 198 states and 289 transitions. [2018-11-23 12:00:04,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-11-23 12:00:04,068 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 289 transitions. [2018-11-23 12:00:04,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-11-23 12:00:04,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:04,068 INFO L402 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:04,068 INFO L423 AbstractCegarLoop]: === Iteration 45 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:04,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:04,069 INFO L82 PathProgramCache]: Analyzing trace with hash 810574689, now seen corresponding path program 43 times [2018-11-23 12:00:04,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:04,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:04,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:04,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:04,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:04,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:05,236 INFO L256 TraceCheckUtils]: 0: Hoare triple {34911#true} call ULTIMATE.init(); {34911#true} is VALID [2018-11-23 12:00:05,236 INFO L273 TraceCheckUtils]: 1: Hoare triple {34911#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34911#true} is VALID [2018-11-23 12:00:05,236 INFO L273 TraceCheckUtils]: 2: Hoare triple {34911#true} assume true; {34911#true} is VALID [2018-11-23 12:00:05,237 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34911#true} {34911#true} #88#return; {34911#true} is VALID [2018-11-23 12:00:05,237 INFO L256 TraceCheckUtils]: 4: Hoare triple {34911#true} call #t~ret13 := main(); {34911#true} is VALID [2018-11-23 12:00:05,237 INFO L273 TraceCheckUtils]: 5: Hoare triple {34911#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {34911#true} is VALID [2018-11-23 12:00:05,237 INFO L273 TraceCheckUtils]: 6: Hoare triple {34911#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {34911#true} is VALID [2018-11-23 12:00:05,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {34911#true} ~i~0 := 2; {34913#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:05,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {34913#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34913#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:05,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {34913#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34913#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:05,238 INFO L273 TraceCheckUtils]: 10: Hoare triple {34913#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34914#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:05,239 INFO L273 TraceCheckUtils]: 11: Hoare triple {34914#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34914#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:05,239 INFO L273 TraceCheckUtils]: 12: Hoare triple {34914#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34914#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:05,240 INFO L273 TraceCheckUtils]: 13: Hoare triple {34914#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34915#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:05,241 INFO L273 TraceCheckUtils]: 14: Hoare triple {34915#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34915#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:05,241 INFO L273 TraceCheckUtils]: 15: Hoare triple {34915#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34915#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:05,242 INFO L273 TraceCheckUtils]: 16: Hoare triple {34915#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34916#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:05,242 INFO L273 TraceCheckUtils]: 17: Hoare triple {34916#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34916#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:05,243 INFO L273 TraceCheckUtils]: 18: Hoare triple {34916#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34916#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:05,244 INFO L273 TraceCheckUtils]: 19: Hoare triple {34916#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34917#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:05,267 INFO L273 TraceCheckUtils]: 20: Hoare triple {34917#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34917#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:05,270 INFO L273 TraceCheckUtils]: 21: Hoare triple {34917#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34917#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:05,270 INFO L273 TraceCheckUtils]: 22: Hoare triple {34917#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34918#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:05,275 INFO L273 TraceCheckUtils]: 23: Hoare triple {34918#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34918#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:05,275 INFO L273 TraceCheckUtils]: 24: Hoare triple {34918#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34918#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:05,275 INFO L273 TraceCheckUtils]: 25: Hoare triple {34918#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34919#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:05,276 INFO L273 TraceCheckUtils]: 26: Hoare triple {34919#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34919#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:05,276 INFO L273 TraceCheckUtils]: 27: Hoare triple {34919#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34919#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:05,276 INFO L273 TraceCheckUtils]: 28: Hoare triple {34919#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34920#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:05,277 INFO L273 TraceCheckUtils]: 29: Hoare triple {34920#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34920#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:05,277 INFO L273 TraceCheckUtils]: 30: Hoare triple {34920#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34920#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:05,277 INFO L273 TraceCheckUtils]: 31: Hoare triple {34920#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34921#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:05,278 INFO L273 TraceCheckUtils]: 32: Hoare triple {34921#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34921#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:05,278 INFO L273 TraceCheckUtils]: 33: Hoare triple {34921#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34921#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:05,279 INFO L273 TraceCheckUtils]: 34: Hoare triple {34921#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34922#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:05,279 INFO L273 TraceCheckUtils]: 35: Hoare triple {34922#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34922#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:05,280 INFO L273 TraceCheckUtils]: 36: Hoare triple {34922#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34922#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:05,280 INFO L273 TraceCheckUtils]: 37: Hoare triple {34922#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34923#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:05,281 INFO L273 TraceCheckUtils]: 38: Hoare triple {34923#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34923#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:05,281 INFO L273 TraceCheckUtils]: 39: Hoare triple {34923#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34923#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:05,282 INFO L273 TraceCheckUtils]: 40: Hoare triple {34923#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34924#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:05,283 INFO L273 TraceCheckUtils]: 41: Hoare triple {34924#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34924#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:05,283 INFO L273 TraceCheckUtils]: 42: Hoare triple {34924#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34924#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:05,284 INFO L273 TraceCheckUtils]: 43: Hoare triple {34924#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34925#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:05,284 INFO L273 TraceCheckUtils]: 44: Hoare triple {34925#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34925#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:05,285 INFO L273 TraceCheckUtils]: 45: Hoare triple {34925#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34925#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:05,286 INFO L273 TraceCheckUtils]: 46: Hoare triple {34925#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34926#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:05,286 INFO L273 TraceCheckUtils]: 47: Hoare triple {34926#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34926#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:05,287 INFO L273 TraceCheckUtils]: 48: Hoare triple {34926#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34926#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:05,287 INFO L273 TraceCheckUtils]: 49: Hoare triple {34926#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34927#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:05,288 INFO L273 TraceCheckUtils]: 50: Hoare triple {34927#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34927#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:05,288 INFO L273 TraceCheckUtils]: 51: Hoare triple {34927#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34927#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:05,289 INFO L273 TraceCheckUtils]: 52: Hoare triple {34927#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34928#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:05,290 INFO L273 TraceCheckUtils]: 53: Hoare triple {34928#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34928#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:05,290 INFO L273 TraceCheckUtils]: 54: Hoare triple {34928#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34928#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:05,291 INFO L273 TraceCheckUtils]: 55: Hoare triple {34928#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34929#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:05,291 INFO L273 TraceCheckUtils]: 56: Hoare triple {34929#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34929#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:05,292 INFO L273 TraceCheckUtils]: 57: Hoare triple {34929#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34929#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:05,293 INFO L273 TraceCheckUtils]: 58: Hoare triple {34929#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34930#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:05,293 INFO L273 TraceCheckUtils]: 59: Hoare triple {34930#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34930#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:05,294 INFO L273 TraceCheckUtils]: 60: Hoare triple {34930#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34930#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:05,294 INFO L273 TraceCheckUtils]: 61: Hoare triple {34930#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34931#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:05,295 INFO L273 TraceCheckUtils]: 62: Hoare triple {34931#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34931#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:05,295 INFO L273 TraceCheckUtils]: 63: Hoare triple {34931#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34931#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:05,296 INFO L273 TraceCheckUtils]: 64: Hoare triple {34931#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34932#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:05,296 INFO L273 TraceCheckUtils]: 65: Hoare triple {34932#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34932#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:05,297 INFO L273 TraceCheckUtils]: 66: Hoare triple {34932#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34932#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:05,298 INFO L273 TraceCheckUtils]: 67: Hoare triple {34932#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34933#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:05,298 INFO L273 TraceCheckUtils]: 68: Hoare triple {34933#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34933#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:05,299 INFO L273 TraceCheckUtils]: 69: Hoare triple {34933#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34933#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:05,299 INFO L273 TraceCheckUtils]: 70: Hoare triple {34933#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34934#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:05,300 INFO L273 TraceCheckUtils]: 71: Hoare triple {34934#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34934#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:05,300 INFO L273 TraceCheckUtils]: 72: Hoare triple {34934#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34934#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:05,301 INFO L273 TraceCheckUtils]: 73: Hoare triple {34934#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34935#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:05,302 INFO L273 TraceCheckUtils]: 74: Hoare triple {34935#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34935#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:05,302 INFO L273 TraceCheckUtils]: 75: Hoare triple {34935#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34935#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:05,303 INFO L273 TraceCheckUtils]: 76: Hoare triple {34935#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34936#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:05,303 INFO L273 TraceCheckUtils]: 77: Hoare triple {34936#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34936#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:05,304 INFO L273 TraceCheckUtils]: 78: Hoare triple {34936#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34936#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:05,305 INFO L273 TraceCheckUtils]: 79: Hoare triple {34936#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34937#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:05,305 INFO L273 TraceCheckUtils]: 80: Hoare triple {34937#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34937#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:05,306 INFO L273 TraceCheckUtils]: 81: Hoare triple {34937#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34937#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:05,306 INFO L273 TraceCheckUtils]: 82: Hoare triple {34937#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34938#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:05,307 INFO L273 TraceCheckUtils]: 83: Hoare triple {34938#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34938#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:05,307 INFO L273 TraceCheckUtils]: 84: Hoare triple {34938#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34938#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:05,308 INFO L273 TraceCheckUtils]: 85: Hoare triple {34938#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34939#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:05,308 INFO L273 TraceCheckUtils]: 86: Hoare triple {34939#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34939#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:05,309 INFO L273 TraceCheckUtils]: 87: Hoare triple {34939#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34939#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:05,310 INFO L273 TraceCheckUtils]: 88: Hoare triple {34939#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34940#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:05,310 INFO L273 TraceCheckUtils]: 89: Hoare triple {34940#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34940#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:05,311 INFO L273 TraceCheckUtils]: 90: Hoare triple {34940#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34940#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:05,311 INFO L273 TraceCheckUtils]: 91: Hoare triple {34940#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34941#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:05,312 INFO L273 TraceCheckUtils]: 92: Hoare triple {34941#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34941#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:05,312 INFO L273 TraceCheckUtils]: 93: Hoare triple {34941#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34941#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:05,313 INFO L273 TraceCheckUtils]: 94: Hoare triple {34941#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34942#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:05,314 INFO L273 TraceCheckUtils]: 95: Hoare triple {34942#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34942#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:05,314 INFO L273 TraceCheckUtils]: 96: Hoare triple {34942#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34942#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:05,315 INFO L273 TraceCheckUtils]: 97: Hoare triple {34942#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34943#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:05,315 INFO L273 TraceCheckUtils]: 98: Hoare triple {34943#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34943#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:05,316 INFO L273 TraceCheckUtils]: 99: Hoare triple {34943#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34943#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:05,317 INFO L273 TraceCheckUtils]: 100: Hoare triple {34943#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34944#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:05,317 INFO L273 TraceCheckUtils]: 101: Hoare triple {34944#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34944#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:05,318 INFO L273 TraceCheckUtils]: 102: Hoare triple {34944#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34944#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:05,318 INFO L273 TraceCheckUtils]: 103: Hoare triple {34944#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34945#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:05,319 INFO L273 TraceCheckUtils]: 104: Hoare triple {34945#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34945#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:05,319 INFO L273 TraceCheckUtils]: 105: Hoare triple {34945#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34945#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:05,320 INFO L273 TraceCheckUtils]: 106: Hoare triple {34945#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34946#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:05,320 INFO L273 TraceCheckUtils]: 107: Hoare triple {34946#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34946#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:05,321 INFO L273 TraceCheckUtils]: 108: Hoare triple {34946#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34946#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:05,322 INFO L273 TraceCheckUtils]: 109: Hoare triple {34946#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34947#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:05,322 INFO L273 TraceCheckUtils]: 110: Hoare triple {34947#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34947#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:05,323 INFO L273 TraceCheckUtils]: 111: Hoare triple {34947#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34947#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:05,323 INFO L273 TraceCheckUtils]: 112: Hoare triple {34947#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34948#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:05,324 INFO L273 TraceCheckUtils]: 113: Hoare triple {34948#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34948#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:05,324 INFO L273 TraceCheckUtils]: 114: Hoare triple {34948#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34948#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:05,325 INFO L273 TraceCheckUtils]: 115: Hoare triple {34948#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34949#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:05,326 INFO L273 TraceCheckUtils]: 116: Hoare triple {34949#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34949#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:05,326 INFO L273 TraceCheckUtils]: 117: Hoare triple {34949#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34949#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:05,327 INFO L273 TraceCheckUtils]: 118: Hoare triple {34949#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34950#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:05,327 INFO L273 TraceCheckUtils]: 119: Hoare triple {34950#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34950#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:05,328 INFO L273 TraceCheckUtils]: 120: Hoare triple {34950#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34950#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:05,328 INFO L273 TraceCheckUtils]: 121: Hoare triple {34950#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34951#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:05,329 INFO L273 TraceCheckUtils]: 122: Hoare triple {34951#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34951#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:05,329 INFO L273 TraceCheckUtils]: 123: Hoare triple {34951#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34951#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:05,330 INFO L273 TraceCheckUtils]: 124: Hoare triple {34951#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34952#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:05,331 INFO L273 TraceCheckUtils]: 125: Hoare triple {34952#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34952#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:05,331 INFO L273 TraceCheckUtils]: 126: Hoare triple {34952#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34952#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:05,332 INFO L273 TraceCheckUtils]: 127: Hoare triple {34952#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34953#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:05,332 INFO L273 TraceCheckUtils]: 128: Hoare triple {34953#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34953#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:05,333 INFO L273 TraceCheckUtils]: 129: Hoare triple {34953#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34953#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:05,334 INFO L273 TraceCheckUtils]: 130: Hoare triple {34953#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34954#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:05,334 INFO L273 TraceCheckUtils]: 131: Hoare triple {34954#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34954#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:05,335 INFO L273 TraceCheckUtils]: 132: Hoare triple {34954#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34954#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:05,335 INFO L273 TraceCheckUtils]: 133: Hoare triple {34954#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34955#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:05,336 INFO L273 TraceCheckUtils]: 134: Hoare triple {34955#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34955#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:05,336 INFO L273 TraceCheckUtils]: 135: Hoare triple {34955#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34955#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:05,337 INFO L273 TraceCheckUtils]: 136: Hoare triple {34955#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34956#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:05,338 INFO L273 TraceCheckUtils]: 137: Hoare triple {34956#(<= main_~i~0 45)} assume !(~i~0 < 100000); {34912#false} is VALID [2018-11-23 12:00:05,338 INFO L273 TraceCheckUtils]: 138: Hoare triple {34912#false} havoc ~x~0;~x~0 := 0; {34912#false} is VALID [2018-11-23 12:00:05,338 INFO L273 TraceCheckUtils]: 139: Hoare triple {34912#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {34912#false} is VALID [2018-11-23 12:00:05,338 INFO L256 TraceCheckUtils]: 140: Hoare triple {34912#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {34912#false} is VALID [2018-11-23 12:00:05,338 INFO L273 TraceCheckUtils]: 141: Hoare triple {34912#false} ~cond := #in~cond; {34912#false} is VALID [2018-11-23 12:00:05,339 INFO L273 TraceCheckUtils]: 142: Hoare triple {34912#false} assume 0 == ~cond; {34912#false} is VALID [2018-11-23 12:00:05,339 INFO L273 TraceCheckUtils]: 143: Hoare triple {34912#false} assume !false; {34912#false} is VALID [2018-11-23 12:00:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:05,351 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:05,352 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-23 12:00:05,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:05,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:05,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:05,830 INFO L256 TraceCheckUtils]: 0: Hoare triple {34911#true} call ULTIMATE.init(); {34911#true} is VALID [2018-11-23 12:00:05,830 INFO L273 TraceCheckUtils]: 1: Hoare triple {34911#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {34911#true} is VALID [2018-11-23 12:00:05,831 INFO L273 TraceCheckUtils]: 2: Hoare triple {34911#true} assume true; {34911#true} is VALID [2018-11-23 12:00:05,831 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34911#true} {34911#true} #88#return; {34911#true} is VALID [2018-11-23 12:00:05,831 INFO L256 TraceCheckUtils]: 4: Hoare triple {34911#true} call #t~ret13 := main(); {34911#true} is VALID [2018-11-23 12:00:05,831 INFO L273 TraceCheckUtils]: 5: Hoare triple {34911#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {34911#true} is VALID [2018-11-23 12:00:05,831 INFO L273 TraceCheckUtils]: 6: Hoare triple {34911#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {34911#true} is VALID [2018-11-23 12:00:05,832 INFO L273 TraceCheckUtils]: 7: Hoare triple {34911#true} ~i~0 := 2; {34913#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:05,832 INFO L273 TraceCheckUtils]: 8: Hoare triple {34913#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34913#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:05,833 INFO L273 TraceCheckUtils]: 9: Hoare triple {34913#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34913#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:05,834 INFO L273 TraceCheckUtils]: 10: Hoare triple {34913#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34914#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:05,834 INFO L273 TraceCheckUtils]: 11: Hoare triple {34914#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34914#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:05,834 INFO L273 TraceCheckUtils]: 12: Hoare triple {34914#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34914#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:05,835 INFO L273 TraceCheckUtils]: 13: Hoare triple {34914#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34915#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:05,835 INFO L273 TraceCheckUtils]: 14: Hoare triple {34915#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34915#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:05,836 INFO L273 TraceCheckUtils]: 15: Hoare triple {34915#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34915#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:05,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {34915#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34916#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:05,836 INFO L273 TraceCheckUtils]: 17: Hoare triple {34916#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34916#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:05,837 INFO L273 TraceCheckUtils]: 18: Hoare triple {34916#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34916#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:05,837 INFO L273 TraceCheckUtils]: 19: Hoare triple {34916#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34917#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:05,838 INFO L273 TraceCheckUtils]: 20: Hoare triple {34917#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34917#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:05,838 INFO L273 TraceCheckUtils]: 21: Hoare triple {34917#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34917#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:05,839 INFO L273 TraceCheckUtils]: 22: Hoare triple {34917#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34918#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:05,840 INFO L273 TraceCheckUtils]: 23: Hoare triple {34918#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34918#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:05,840 INFO L273 TraceCheckUtils]: 24: Hoare triple {34918#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34918#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:05,841 INFO L273 TraceCheckUtils]: 25: Hoare triple {34918#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34919#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:05,841 INFO L273 TraceCheckUtils]: 26: Hoare triple {34919#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34919#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:05,842 INFO L273 TraceCheckUtils]: 27: Hoare triple {34919#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34919#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:05,843 INFO L273 TraceCheckUtils]: 28: Hoare triple {34919#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34920#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:05,843 INFO L273 TraceCheckUtils]: 29: Hoare triple {34920#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34920#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:05,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {34920#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34920#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:05,844 INFO L273 TraceCheckUtils]: 31: Hoare triple {34920#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34921#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:05,845 INFO L273 TraceCheckUtils]: 32: Hoare triple {34921#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34921#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:05,845 INFO L273 TraceCheckUtils]: 33: Hoare triple {34921#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34921#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:05,846 INFO L273 TraceCheckUtils]: 34: Hoare triple {34921#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34922#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:05,847 INFO L273 TraceCheckUtils]: 35: Hoare triple {34922#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34922#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:05,847 INFO L273 TraceCheckUtils]: 36: Hoare triple {34922#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34922#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:05,848 INFO L273 TraceCheckUtils]: 37: Hoare triple {34922#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34923#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:05,848 INFO L273 TraceCheckUtils]: 38: Hoare triple {34923#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34923#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:05,849 INFO L273 TraceCheckUtils]: 39: Hoare triple {34923#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34923#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:05,850 INFO L273 TraceCheckUtils]: 40: Hoare triple {34923#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34924#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:05,850 INFO L273 TraceCheckUtils]: 41: Hoare triple {34924#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34924#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:05,851 INFO L273 TraceCheckUtils]: 42: Hoare triple {34924#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34924#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:05,851 INFO L273 TraceCheckUtils]: 43: Hoare triple {34924#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34925#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:05,852 INFO L273 TraceCheckUtils]: 44: Hoare triple {34925#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34925#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:05,852 INFO L273 TraceCheckUtils]: 45: Hoare triple {34925#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34925#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:05,853 INFO L273 TraceCheckUtils]: 46: Hoare triple {34925#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34926#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:05,853 INFO L273 TraceCheckUtils]: 47: Hoare triple {34926#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34926#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:05,854 INFO L273 TraceCheckUtils]: 48: Hoare triple {34926#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34926#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:05,855 INFO L273 TraceCheckUtils]: 49: Hoare triple {34926#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34927#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:05,855 INFO L273 TraceCheckUtils]: 50: Hoare triple {34927#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34927#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:05,856 INFO L273 TraceCheckUtils]: 51: Hoare triple {34927#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34927#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:05,856 INFO L273 TraceCheckUtils]: 52: Hoare triple {34927#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34928#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:05,857 INFO L273 TraceCheckUtils]: 53: Hoare triple {34928#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34928#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:05,857 INFO L273 TraceCheckUtils]: 54: Hoare triple {34928#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34928#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:05,858 INFO L273 TraceCheckUtils]: 55: Hoare triple {34928#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34929#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:05,859 INFO L273 TraceCheckUtils]: 56: Hoare triple {34929#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34929#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:05,859 INFO L273 TraceCheckUtils]: 57: Hoare triple {34929#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34929#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:05,860 INFO L273 TraceCheckUtils]: 58: Hoare triple {34929#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34930#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:05,860 INFO L273 TraceCheckUtils]: 59: Hoare triple {34930#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34930#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:05,861 INFO L273 TraceCheckUtils]: 60: Hoare triple {34930#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34930#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:05,862 INFO L273 TraceCheckUtils]: 61: Hoare triple {34930#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34931#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:05,862 INFO L273 TraceCheckUtils]: 62: Hoare triple {34931#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34931#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:05,863 INFO L273 TraceCheckUtils]: 63: Hoare triple {34931#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34931#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:05,863 INFO L273 TraceCheckUtils]: 64: Hoare triple {34931#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34932#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:05,864 INFO L273 TraceCheckUtils]: 65: Hoare triple {34932#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34932#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:05,864 INFO L273 TraceCheckUtils]: 66: Hoare triple {34932#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34932#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:05,865 INFO L273 TraceCheckUtils]: 67: Hoare triple {34932#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34933#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:05,866 INFO L273 TraceCheckUtils]: 68: Hoare triple {34933#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34933#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:05,866 INFO L273 TraceCheckUtils]: 69: Hoare triple {34933#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34933#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:05,867 INFO L273 TraceCheckUtils]: 70: Hoare triple {34933#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34934#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:05,867 INFO L273 TraceCheckUtils]: 71: Hoare triple {34934#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34934#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:05,868 INFO L273 TraceCheckUtils]: 72: Hoare triple {34934#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34934#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:05,868 INFO L273 TraceCheckUtils]: 73: Hoare triple {34934#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34935#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:05,869 INFO L273 TraceCheckUtils]: 74: Hoare triple {34935#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34935#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:05,869 INFO L273 TraceCheckUtils]: 75: Hoare triple {34935#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34935#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:05,870 INFO L273 TraceCheckUtils]: 76: Hoare triple {34935#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34936#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:05,871 INFO L273 TraceCheckUtils]: 77: Hoare triple {34936#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34936#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:05,871 INFO L273 TraceCheckUtils]: 78: Hoare triple {34936#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34936#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:05,872 INFO L273 TraceCheckUtils]: 79: Hoare triple {34936#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34937#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:05,872 INFO L273 TraceCheckUtils]: 80: Hoare triple {34937#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34937#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:05,873 INFO L273 TraceCheckUtils]: 81: Hoare triple {34937#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34937#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:05,874 INFO L273 TraceCheckUtils]: 82: Hoare triple {34937#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34938#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:05,874 INFO L273 TraceCheckUtils]: 83: Hoare triple {34938#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34938#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:05,875 INFO L273 TraceCheckUtils]: 84: Hoare triple {34938#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34938#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:05,875 INFO L273 TraceCheckUtils]: 85: Hoare triple {34938#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34939#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:05,876 INFO L273 TraceCheckUtils]: 86: Hoare triple {34939#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34939#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:05,876 INFO L273 TraceCheckUtils]: 87: Hoare triple {34939#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34939#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:05,877 INFO L273 TraceCheckUtils]: 88: Hoare triple {34939#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34940#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:05,878 INFO L273 TraceCheckUtils]: 89: Hoare triple {34940#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34940#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:05,878 INFO L273 TraceCheckUtils]: 90: Hoare triple {34940#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34940#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:05,879 INFO L273 TraceCheckUtils]: 91: Hoare triple {34940#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34941#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:05,879 INFO L273 TraceCheckUtils]: 92: Hoare triple {34941#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34941#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:05,880 INFO L273 TraceCheckUtils]: 93: Hoare triple {34941#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34941#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:05,880 INFO L273 TraceCheckUtils]: 94: Hoare triple {34941#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34942#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:05,881 INFO L273 TraceCheckUtils]: 95: Hoare triple {34942#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34942#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:05,881 INFO L273 TraceCheckUtils]: 96: Hoare triple {34942#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34942#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:05,882 INFO L273 TraceCheckUtils]: 97: Hoare triple {34942#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34943#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:05,883 INFO L273 TraceCheckUtils]: 98: Hoare triple {34943#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34943#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:05,883 INFO L273 TraceCheckUtils]: 99: Hoare triple {34943#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34943#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:05,884 INFO L273 TraceCheckUtils]: 100: Hoare triple {34943#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34944#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:05,884 INFO L273 TraceCheckUtils]: 101: Hoare triple {34944#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34944#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:05,885 INFO L273 TraceCheckUtils]: 102: Hoare triple {34944#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34944#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:05,886 INFO L273 TraceCheckUtils]: 103: Hoare triple {34944#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34945#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:05,886 INFO L273 TraceCheckUtils]: 104: Hoare triple {34945#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34945#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:05,887 INFO L273 TraceCheckUtils]: 105: Hoare triple {34945#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34945#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:05,887 INFO L273 TraceCheckUtils]: 106: Hoare triple {34945#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34946#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:05,888 INFO L273 TraceCheckUtils]: 107: Hoare triple {34946#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34946#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:05,888 INFO L273 TraceCheckUtils]: 108: Hoare triple {34946#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34946#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:05,889 INFO L273 TraceCheckUtils]: 109: Hoare triple {34946#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34947#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:05,890 INFO L273 TraceCheckUtils]: 110: Hoare triple {34947#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34947#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:05,890 INFO L273 TraceCheckUtils]: 111: Hoare triple {34947#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34947#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:05,891 INFO L273 TraceCheckUtils]: 112: Hoare triple {34947#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34948#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:05,891 INFO L273 TraceCheckUtils]: 113: Hoare triple {34948#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34948#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:05,892 INFO L273 TraceCheckUtils]: 114: Hoare triple {34948#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34948#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:05,893 INFO L273 TraceCheckUtils]: 115: Hoare triple {34948#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34949#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:05,893 INFO L273 TraceCheckUtils]: 116: Hoare triple {34949#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34949#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:05,894 INFO L273 TraceCheckUtils]: 117: Hoare triple {34949#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34949#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:05,894 INFO L273 TraceCheckUtils]: 118: Hoare triple {34949#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34950#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:05,895 INFO L273 TraceCheckUtils]: 119: Hoare triple {34950#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34950#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:05,895 INFO L273 TraceCheckUtils]: 120: Hoare triple {34950#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34950#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:05,896 INFO L273 TraceCheckUtils]: 121: Hoare triple {34950#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34951#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:05,896 INFO L273 TraceCheckUtils]: 122: Hoare triple {34951#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34951#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:05,897 INFO L273 TraceCheckUtils]: 123: Hoare triple {34951#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34951#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:05,898 INFO L273 TraceCheckUtils]: 124: Hoare triple {34951#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34952#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:05,898 INFO L273 TraceCheckUtils]: 125: Hoare triple {34952#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34952#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:05,899 INFO L273 TraceCheckUtils]: 126: Hoare triple {34952#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34952#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:05,899 INFO L273 TraceCheckUtils]: 127: Hoare triple {34952#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34953#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:05,900 INFO L273 TraceCheckUtils]: 128: Hoare triple {34953#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34953#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:05,900 INFO L273 TraceCheckUtils]: 129: Hoare triple {34953#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34953#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:05,901 INFO L273 TraceCheckUtils]: 130: Hoare triple {34953#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34954#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:05,902 INFO L273 TraceCheckUtils]: 131: Hoare triple {34954#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34954#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:05,902 INFO L273 TraceCheckUtils]: 132: Hoare triple {34954#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34954#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:05,903 INFO L273 TraceCheckUtils]: 133: Hoare triple {34954#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34955#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:05,903 INFO L273 TraceCheckUtils]: 134: Hoare triple {34955#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {34955#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:05,904 INFO L273 TraceCheckUtils]: 135: Hoare triple {34955#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {34955#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:05,905 INFO L273 TraceCheckUtils]: 136: Hoare triple {34955#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {34956#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:05,905 INFO L273 TraceCheckUtils]: 137: Hoare triple {34956#(<= main_~i~0 45)} assume !(~i~0 < 100000); {34912#false} is VALID [2018-11-23 12:00:05,905 INFO L273 TraceCheckUtils]: 138: Hoare triple {34912#false} havoc ~x~0;~x~0 := 0; {34912#false} is VALID [2018-11-23 12:00:05,906 INFO L273 TraceCheckUtils]: 139: Hoare triple {34912#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {34912#false} is VALID [2018-11-23 12:00:05,906 INFO L256 TraceCheckUtils]: 140: Hoare triple {34912#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {34912#false} is VALID [2018-11-23 12:00:05,906 INFO L273 TraceCheckUtils]: 141: Hoare triple {34912#false} ~cond := #in~cond; {34912#false} is VALID [2018-11-23 12:00:05,906 INFO L273 TraceCheckUtils]: 142: Hoare triple {34912#false} assume 0 == ~cond; {34912#false} is VALID [2018-11-23 12:00:05,906 INFO L273 TraceCheckUtils]: 143: Hoare triple {34912#false} assume !false; {34912#false} is VALID [2018-11-23 12:00:05,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:05,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:05,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 46] total 46 [2018-11-23 12:00:05,940 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 144 [2018-11-23 12:00:05,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:05,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states. [2018-11-23 12:00:06,081 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-23 12:00:06,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-11-23 12:00:06,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-11-23 12:00:06,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:00:06,083 INFO L87 Difference]: Start difference. First operand 198 states and 289 transitions. Second operand 46 states. [2018-11-23 12:00:07,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:07,131 INFO L93 Difference]: Finished difference Result 222 states and 321 transitions. [2018-11-23 12:00:07,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-11-23 12:00:07,131 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 144 [2018-11-23 12:00:07,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:00:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 321 transitions. [2018-11-23 12:00:07,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 12:00:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 321 transitions. [2018-11-23 12:00:07,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 321 transitions. [2018-11-23 12:00:07,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:07,449 INFO L225 Difference]: With dead ends: 222 [2018-11-23 12:00:07,449 INFO L226 Difference]: Without dead ends: 205 [2018-11-23 12:00:07,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-11-23 12:00:07,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-11-23 12:00:07,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 202. [2018-11-23 12:00:07,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:07,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand 202 states. [2018-11-23 12:00:07,511 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand 202 states. [2018-11-23 12:00:07,511 INFO L87 Difference]: Start difference. First operand 205 states. Second operand 202 states. [2018-11-23 12:00:07,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:07,515 INFO L93 Difference]: Finished difference Result 205 states and 300 transitions. [2018-11-23 12:00:07,515 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 300 transitions. [2018-11-23 12:00:07,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:07,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:07,516 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 205 states. [2018-11-23 12:00:07,516 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 205 states. [2018-11-23 12:00:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:07,519 INFO L93 Difference]: Finished difference Result 205 states and 300 transitions. [2018-11-23 12:00:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 300 transitions. [2018-11-23 12:00:07,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:07,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:07,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:07,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2018-11-23 12:00:07,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 295 transitions. [2018-11-23 12:00:07,523 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 295 transitions. Word has length 144 [2018-11-23 12:00:07,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:07,523 INFO L480 AbstractCegarLoop]: Abstraction has 202 states and 295 transitions. [2018-11-23 12:00:07,523 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-11-23 12:00:07,523 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 295 transitions. [2018-11-23 12:00:07,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-11-23 12:00:07,524 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:07,524 INFO L402 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:07,524 INFO L423 AbstractCegarLoop]: === Iteration 46 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:07,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:07,525 INFO L82 PathProgramCache]: Analyzing trace with hash -2120763492, now seen corresponding path program 44 times [2018-11-23 12:00:07,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:07,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:07,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:07,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:07,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:07,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:08,577 INFO L256 TraceCheckUtils]: 0: Hoare triple {36335#true} call ULTIMATE.init(); {36335#true} is VALID [2018-11-23 12:00:08,577 INFO L273 TraceCheckUtils]: 1: Hoare triple {36335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36335#true} is VALID [2018-11-23 12:00:08,577 INFO L273 TraceCheckUtils]: 2: Hoare triple {36335#true} assume true; {36335#true} is VALID [2018-11-23 12:00:08,577 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36335#true} {36335#true} #88#return; {36335#true} is VALID [2018-11-23 12:00:08,577 INFO L256 TraceCheckUtils]: 4: Hoare triple {36335#true} call #t~ret13 := main(); {36335#true} is VALID [2018-11-23 12:00:08,578 INFO L273 TraceCheckUtils]: 5: Hoare triple {36335#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {36335#true} is VALID [2018-11-23 12:00:08,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {36335#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {36335#true} is VALID [2018-11-23 12:00:08,578 INFO L273 TraceCheckUtils]: 7: Hoare triple {36335#true} ~i~0 := 2; {36337#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:08,578 INFO L273 TraceCheckUtils]: 8: Hoare triple {36337#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36337#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:08,579 INFO L273 TraceCheckUtils]: 9: Hoare triple {36337#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36337#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:08,579 INFO L273 TraceCheckUtils]: 10: Hoare triple {36337#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36338#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:08,579 INFO L273 TraceCheckUtils]: 11: Hoare triple {36338#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36338#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:08,580 INFO L273 TraceCheckUtils]: 12: Hoare triple {36338#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36338#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:08,580 INFO L273 TraceCheckUtils]: 13: Hoare triple {36338#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36339#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:08,580 INFO L273 TraceCheckUtils]: 14: Hoare triple {36339#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36339#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:08,581 INFO L273 TraceCheckUtils]: 15: Hoare triple {36339#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36339#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:08,581 INFO L273 TraceCheckUtils]: 16: Hoare triple {36339#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36340#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:08,582 INFO L273 TraceCheckUtils]: 17: Hoare triple {36340#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36340#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:08,582 INFO L273 TraceCheckUtils]: 18: Hoare triple {36340#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36340#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:08,583 INFO L273 TraceCheckUtils]: 19: Hoare triple {36340#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36341#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:08,583 INFO L273 TraceCheckUtils]: 20: Hoare triple {36341#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36341#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:08,584 INFO L273 TraceCheckUtils]: 21: Hoare triple {36341#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36341#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:08,584 INFO L273 TraceCheckUtils]: 22: Hoare triple {36341#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36342#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:08,585 INFO L273 TraceCheckUtils]: 23: Hoare triple {36342#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36342#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:08,585 INFO L273 TraceCheckUtils]: 24: Hoare triple {36342#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36342#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:08,586 INFO L273 TraceCheckUtils]: 25: Hoare triple {36342#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36343#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:08,587 INFO L273 TraceCheckUtils]: 26: Hoare triple {36343#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36343#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:08,587 INFO L273 TraceCheckUtils]: 27: Hoare triple {36343#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36343#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:08,588 INFO L273 TraceCheckUtils]: 28: Hoare triple {36343#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36344#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:08,588 INFO L273 TraceCheckUtils]: 29: Hoare triple {36344#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36344#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:08,589 INFO L273 TraceCheckUtils]: 30: Hoare triple {36344#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36344#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:08,590 INFO L273 TraceCheckUtils]: 31: Hoare triple {36344#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36345#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:08,590 INFO L273 TraceCheckUtils]: 32: Hoare triple {36345#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36345#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:08,591 INFO L273 TraceCheckUtils]: 33: Hoare triple {36345#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36345#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:08,591 INFO L273 TraceCheckUtils]: 34: Hoare triple {36345#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36346#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:08,592 INFO L273 TraceCheckUtils]: 35: Hoare triple {36346#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36346#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:08,592 INFO L273 TraceCheckUtils]: 36: Hoare triple {36346#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36346#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:08,593 INFO L273 TraceCheckUtils]: 37: Hoare triple {36346#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36347#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:08,594 INFO L273 TraceCheckUtils]: 38: Hoare triple {36347#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36347#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:08,594 INFO L273 TraceCheckUtils]: 39: Hoare triple {36347#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36347#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:08,595 INFO L273 TraceCheckUtils]: 40: Hoare triple {36347#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36348#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:08,595 INFO L273 TraceCheckUtils]: 41: Hoare triple {36348#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36348#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:08,596 INFO L273 TraceCheckUtils]: 42: Hoare triple {36348#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36348#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:08,596 INFO L273 TraceCheckUtils]: 43: Hoare triple {36348#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36349#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:08,597 INFO L273 TraceCheckUtils]: 44: Hoare triple {36349#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36349#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:08,597 INFO L273 TraceCheckUtils]: 45: Hoare triple {36349#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36349#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:08,598 INFO L273 TraceCheckUtils]: 46: Hoare triple {36349#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36350#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:08,599 INFO L273 TraceCheckUtils]: 47: Hoare triple {36350#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36350#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:08,599 INFO L273 TraceCheckUtils]: 48: Hoare triple {36350#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36350#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:08,600 INFO L273 TraceCheckUtils]: 49: Hoare triple {36350#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36351#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:08,600 INFO L273 TraceCheckUtils]: 50: Hoare triple {36351#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36351#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:08,601 INFO L273 TraceCheckUtils]: 51: Hoare triple {36351#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36351#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:08,602 INFO L273 TraceCheckUtils]: 52: Hoare triple {36351#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36352#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:08,602 INFO L273 TraceCheckUtils]: 53: Hoare triple {36352#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36352#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:08,603 INFO L273 TraceCheckUtils]: 54: Hoare triple {36352#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36352#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:08,603 INFO L273 TraceCheckUtils]: 55: Hoare triple {36352#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36353#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:08,604 INFO L273 TraceCheckUtils]: 56: Hoare triple {36353#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36353#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:08,604 INFO L273 TraceCheckUtils]: 57: Hoare triple {36353#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36353#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:08,605 INFO L273 TraceCheckUtils]: 58: Hoare triple {36353#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36354#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:08,606 INFO L273 TraceCheckUtils]: 59: Hoare triple {36354#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36354#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:08,606 INFO L273 TraceCheckUtils]: 60: Hoare triple {36354#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36354#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:08,607 INFO L273 TraceCheckUtils]: 61: Hoare triple {36354#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36355#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:08,607 INFO L273 TraceCheckUtils]: 62: Hoare triple {36355#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36355#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:08,608 INFO L273 TraceCheckUtils]: 63: Hoare triple {36355#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36355#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:08,608 INFO L273 TraceCheckUtils]: 64: Hoare triple {36355#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36356#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:08,609 INFO L273 TraceCheckUtils]: 65: Hoare triple {36356#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36356#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:08,609 INFO L273 TraceCheckUtils]: 66: Hoare triple {36356#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36356#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:08,610 INFO L273 TraceCheckUtils]: 67: Hoare triple {36356#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36357#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:08,611 INFO L273 TraceCheckUtils]: 68: Hoare triple {36357#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36357#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:08,611 INFO L273 TraceCheckUtils]: 69: Hoare triple {36357#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36357#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:08,612 INFO L273 TraceCheckUtils]: 70: Hoare triple {36357#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36358#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:08,612 INFO L273 TraceCheckUtils]: 71: Hoare triple {36358#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36358#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:08,613 INFO L273 TraceCheckUtils]: 72: Hoare triple {36358#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36358#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:08,614 INFO L273 TraceCheckUtils]: 73: Hoare triple {36358#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36359#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:08,614 INFO L273 TraceCheckUtils]: 74: Hoare triple {36359#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36359#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:08,615 INFO L273 TraceCheckUtils]: 75: Hoare triple {36359#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36359#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:08,615 INFO L273 TraceCheckUtils]: 76: Hoare triple {36359#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36360#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:08,616 INFO L273 TraceCheckUtils]: 77: Hoare triple {36360#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36360#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:08,616 INFO L273 TraceCheckUtils]: 78: Hoare triple {36360#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36360#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:08,617 INFO L273 TraceCheckUtils]: 79: Hoare triple {36360#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36361#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:08,618 INFO L273 TraceCheckUtils]: 80: Hoare triple {36361#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36361#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:08,618 INFO L273 TraceCheckUtils]: 81: Hoare triple {36361#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36361#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:08,619 INFO L273 TraceCheckUtils]: 82: Hoare triple {36361#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36362#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:08,619 INFO L273 TraceCheckUtils]: 83: Hoare triple {36362#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36362#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:08,620 INFO L273 TraceCheckUtils]: 84: Hoare triple {36362#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36362#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:08,620 INFO L273 TraceCheckUtils]: 85: Hoare triple {36362#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36363#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:08,621 INFO L273 TraceCheckUtils]: 86: Hoare triple {36363#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36363#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:08,621 INFO L273 TraceCheckUtils]: 87: Hoare triple {36363#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36363#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:08,622 INFO L273 TraceCheckUtils]: 88: Hoare triple {36363#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36364#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:08,623 INFO L273 TraceCheckUtils]: 89: Hoare triple {36364#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36364#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:08,623 INFO L273 TraceCheckUtils]: 90: Hoare triple {36364#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36364#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:08,624 INFO L273 TraceCheckUtils]: 91: Hoare triple {36364#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36365#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:08,624 INFO L273 TraceCheckUtils]: 92: Hoare triple {36365#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36365#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:08,625 INFO L273 TraceCheckUtils]: 93: Hoare triple {36365#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36365#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:08,626 INFO L273 TraceCheckUtils]: 94: Hoare triple {36365#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36366#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:08,626 INFO L273 TraceCheckUtils]: 95: Hoare triple {36366#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36366#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:08,627 INFO L273 TraceCheckUtils]: 96: Hoare triple {36366#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36366#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:08,627 INFO L273 TraceCheckUtils]: 97: Hoare triple {36366#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36367#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:08,628 INFO L273 TraceCheckUtils]: 98: Hoare triple {36367#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36367#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:08,628 INFO L273 TraceCheckUtils]: 99: Hoare triple {36367#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36367#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:08,629 INFO L273 TraceCheckUtils]: 100: Hoare triple {36367#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36368#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:08,630 INFO L273 TraceCheckUtils]: 101: Hoare triple {36368#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36368#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:08,630 INFO L273 TraceCheckUtils]: 102: Hoare triple {36368#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36368#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:08,631 INFO L273 TraceCheckUtils]: 103: Hoare triple {36368#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36369#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:08,631 INFO L273 TraceCheckUtils]: 104: Hoare triple {36369#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36369#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:08,632 INFO L273 TraceCheckUtils]: 105: Hoare triple {36369#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36369#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:08,632 INFO L273 TraceCheckUtils]: 106: Hoare triple {36369#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36370#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:08,633 INFO L273 TraceCheckUtils]: 107: Hoare triple {36370#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36370#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:08,633 INFO L273 TraceCheckUtils]: 108: Hoare triple {36370#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36370#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:08,634 INFO L273 TraceCheckUtils]: 109: Hoare triple {36370#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36371#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:08,635 INFO L273 TraceCheckUtils]: 110: Hoare triple {36371#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36371#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:08,635 INFO L273 TraceCheckUtils]: 111: Hoare triple {36371#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36371#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:08,636 INFO L273 TraceCheckUtils]: 112: Hoare triple {36371#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36372#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:08,636 INFO L273 TraceCheckUtils]: 113: Hoare triple {36372#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36372#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:08,637 INFO L273 TraceCheckUtils]: 114: Hoare triple {36372#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36372#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:08,638 INFO L273 TraceCheckUtils]: 115: Hoare triple {36372#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36373#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:08,638 INFO L273 TraceCheckUtils]: 116: Hoare triple {36373#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36373#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:08,639 INFO L273 TraceCheckUtils]: 117: Hoare triple {36373#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36373#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:08,639 INFO L273 TraceCheckUtils]: 118: Hoare triple {36373#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36374#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:08,640 INFO L273 TraceCheckUtils]: 119: Hoare triple {36374#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36374#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:08,640 INFO L273 TraceCheckUtils]: 120: Hoare triple {36374#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36374#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:08,641 INFO L273 TraceCheckUtils]: 121: Hoare triple {36374#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36375#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:08,642 INFO L273 TraceCheckUtils]: 122: Hoare triple {36375#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36375#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:08,642 INFO L273 TraceCheckUtils]: 123: Hoare triple {36375#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36375#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:08,643 INFO L273 TraceCheckUtils]: 124: Hoare triple {36375#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36376#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:08,643 INFO L273 TraceCheckUtils]: 125: Hoare triple {36376#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36376#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:08,644 INFO L273 TraceCheckUtils]: 126: Hoare triple {36376#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36376#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:08,644 INFO L273 TraceCheckUtils]: 127: Hoare triple {36376#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36377#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:08,645 INFO L273 TraceCheckUtils]: 128: Hoare triple {36377#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36377#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:08,645 INFO L273 TraceCheckUtils]: 129: Hoare triple {36377#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36377#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:08,646 INFO L273 TraceCheckUtils]: 130: Hoare triple {36377#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36378#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:08,647 INFO L273 TraceCheckUtils]: 131: Hoare triple {36378#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36378#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:08,647 INFO L273 TraceCheckUtils]: 132: Hoare triple {36378#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36378#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:08,648 INFO L273 TraceCheckUtils]: 133: Hoare triple {36378#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36379#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:08,648 INFO L273 TraceCheckUtils]: 134: Hoare triple {36379#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36379#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:08,649 INFO L273 TraceCheckUtils]: 135: Hoare triple {36379#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36379#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:08,650 INFO L273 TraceCheckUtils]: 136: Hoare triple {36379#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36380#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:08,650 INFO L273 TraceCheckUtils]: 137: Hoare triple {36380#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36380#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:08,651 INFO L273 TraceCheckUtils]: 138: Hoare triple {36380#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36380#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:08,651 INFO L273 TraceCheckUtils]: 139: Hoare triple {36380#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36381#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:08,652 INFO L273 TraceCheckUtils]: 140: Hoare triple {36381#(<= main_~i~0 46)} assume !(~i~0 < 100000); {36336#false} is VALID [2018-11-23 12:00:08,652 INFO L273 TraceCheckUtils]: 141: Hoare triple {36336#false} havoc ~x~0;~x~0 := 0; {36336#false} is VALID [2018-11-23 12:00:08,652 INFO L273 TraceCheckUtils]: 142: Hoare triple {36336#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {36336#false} is VALID [2018-11-23 12:00:08,653 INFO L256 TraceCheckUtils]: 143: Hoare triple {36336#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {36336#false} is VALID [2018-11-23 12:00:08,653 INFO L273 TraceCheckUtils]: 144: Hoare triple {36336#false} ~cond := #in~cond; {36336#false} is VALID [2018-11-23 12:00:08,653 INFO L273 TraceCheckUtils]: 145: Hoare triple {36336#false} assume 0 == ~cond; {36336#false} is VALID [2018-11-23 12:00:08,653 INFO L273 TraceCheckUtils]: 146: Hoare triple {36336#false} assume !false; {36336#false} is VALID [2018-11-23 12:00:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:08,667 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:08,667 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-23 12:00:08,677 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:00:08,758 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:00:08,758 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:08,790 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:09,118 INFO L256 TraceCheckUtils]: 0: Hoare triple {36335#true} call ULTIMATE.init(); {36335#true} is VALID [2018-11-23 12:00:09,119 INFO L273 TraceCheckUtils]: 1: Hoare triple {36335#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {36335#true} is VALID [2018-11-23 12:00:09,119 INFO L273 TraceCheckUtils]: 2: Hoare triple {36335#true} assume true; {36335#true} is VALID [2018-11-23 12:00:09,119 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {36335#true} {36335#true} #88#return; {36335#true} is VALID [2018-11-23 12:00:09,119 INFO L256 TraceCheckUtils]: 4: Hoare triple {36335#true} call #t~ret13 := main(); {36335#true} is VALID [2018-11-23 12:00:09,119 INFO L273 TraceCheckUtils]: 5: Hoare triple {36335#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {36335#true} is VALID [2018-11-23 12:00:09,120 INFO L273 TraceCheckUtils]: 6: Hoare triple {36335#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {36335#true} is VALID [2018-11-23 12:00:09,120 INFO L273 TraceCheckUtils]: 7: Hoare triple {36335#true} ~i~0 := 2; {36337#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:09,121 INFO L273 TraceCheckUtils]: 8: Hoare triple {36337#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36337#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:09,121 INFO L273 TraceCheckUtils]: 9: Hoare triple {36337#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36337#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:09,122 INFO L273 TraceCheckUtils]: 10: Hoare triple {36337#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36338#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:09,122 INFO L273 TraceCheckUtils]: 11: Hoare triple {36338#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36338#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:09,122 INFO L273 TraceCheckUtils]: 12: Hoare triple {36338#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36338#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:09,123 INFO L273 TraceCheckUtils]: 13: Hoare triple {36338#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36339#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:09,123 INFO L273 TraceCheckUtils]: 14: Hoare triple {36339#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36339#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:09,123 INFO L273 TraceCheckUtils]: 15: Hoare triple {36339#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36339#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:09,124 INFO L273 TraceCheckUtils]: 16: Hoare triple {36339#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36340#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:09,125 INFO L273 TraceCheckUtils]: 17: Hoare triple {36340#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36340#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:09,125 INFO L273 TraceCheckUtils]: 18: Hoare triple {36340#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36340#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:09,126 INFO L273 TraceCheckUtils]: 19: Hoare triple {36340#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36341#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:09,126 INFO L273 TraceCheckUtils]: 20: Hoare triple {36341#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36341#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:09,127 INFO L273 TraceCheckUtils]: 21: Hoare triple {36341#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36341#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:09,128 INFO L273 TraceCheckUtils]: 22: Hoare triple {36341#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36342#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:09,128 INFO L273 TraceCheckUtils]: 23: Hoare triple {36342#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36342#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:09,129 INFO L273 TraceCheckUtils]: 24: Hoare triple {36342#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36342#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:09,129 INFO L273 TraceCheckUtils]: 25: Hoare triple {36342#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36343#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:09,130 INFO L273 TraceCheckUtils]: 26: Hoare triple {36343#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36343#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:09,130 INFO L273 TraceCheckUtils]: 27: Hoare triple {36343#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36343#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:09,131 INFO L273 TraceCheckUtils]: 28: Hoare triple {36343#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36344#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:09,132 INFO L273 TraceCheckUtils]: 29: Hoare triple {36344#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36344#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:09,132 INFO L273 TraceCheckUtils]: 30: Hoare triple {36344#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36344#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:09,133 INFO L273 TraceCheckUtils]: 31: Hoare triple {36344#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36345#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:09,133 INFO L273 TraceCheckUtils]: 32: Hoare triple {36345#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36345#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:09,134 INFO L273 TraceCheckUtils]: 33: Hoare triple {36345#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36345#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:09,134 INFO L273 TraceCheckUtils]: 34: Hoare triple {36345#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36346#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:09,135 INFO L273 TraceCheckUtils]: 35: Hoare triple {36346#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36346#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:09,135 INFO L273 TraceCheckUtils]: 36: Hoare triple {36346#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36346#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:09,136 INFO L273 TraceCheckUtils]: 37: Hoare triple {36346#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36347#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:09,137 INFO L273 TraceCheckUtils]: 38: Hoare triple {36347#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36347#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:09,137 INFO L273 TraceCheckUtils]: 39: Hoare triple {36347#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36347#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:09,138 INFO L273 TraceCheckUtils]: 40: Hoare triple {36347#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36348#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:09,138 INFO L273 TraceCheckUtils]: 41: Hoare triple {36348#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36348#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:09,139 INFO L273 TraceCheckUtils]: 42: Hoare triple {36348#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36348#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:09,140 INFO L273 TraceCheckUtils]: 43: Hoare triple {36348#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36349#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:09,140 INFO L273 TraceCheckUtils]: 44: Hoare triple {36349#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36349#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:09,141 INFO L273 TraceCheckUtils]: 45: Hoare triple {36349#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36349#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:09,141 INFO L273 TraceCheckUtils]: 46: Hoare triple {36349#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36350#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:09,142 INFO L273 TraceCheckUtils]: 47: Hoare triple {36350#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36350#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:09,142 INFO L273 TraceCheckUtils]: 48: Hoare triple {36350#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36350#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:09,143 INFO L273 TraceCheckUtils]: 49: Hoare triple {36350#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36351#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:09,144 INFO L273 TraceCheckUtils]: 50: Hoare triple {36351#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36351#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:09,144 INFO L273 TraceCheckUtils]: 51: Hoare triple {36351#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36351#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:09,145 INFO L273 TraceCheckUtils]: 52: Hoare triple {36351#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36352#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:09,145 INFO L273 TraceCheckUtils]: 53: Hoare triple {36352#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36352#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:09,146 INFO L273 TraceCheckUtils]: 54: Hoare triple {36352#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36352#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:09,146 INFO L273 TraceCheckUtils]: 55: Hoare triple {36352#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36353#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:09,147 INFO L273 TraceCheckUtils]: 56: Hoare triple {36353#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36353#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:09,147 INFO L273 TraceCheckUtils]: 57: Hoare triple {36353#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36353#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:09,148 INFO L273 TraceCheckUtils]: 58: Hoare triple {36353#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36354#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:09,149 INFO L273 TraceCheckUtils]: 59: Hoare triple {36354#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36354#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:09,149 INFO L273 TraceCheckUtils]: 60: Hoare triple {36354#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36354#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:09,150 INFO L273 TraceCheckUtils]: 61: Hoare triple {36354#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36355#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:09,150 INFO L273 TraceCheckUtils]: 62: Hoare triple {36355#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36355#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:09,151 INFO L273 TraceCheckUtils]: 63: Hoare triple {36355#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36355#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:09,152 INFO L273 TraceCheckUtils]: 64: Hoare triple {36355#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36356#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:09,152 INFO L273 TraceCheckUtils]: 65: Hoare triple {36356#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36356#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:09,153 INFO L273 TraceCheckUtils]: 66: Hoare triple {36356#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36356#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:09,153 INFO L273 TraceCheckUtils]: 67: Hoare triple {36356#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36357#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:09,154 INFO L273 TraceCheckUtils]: 68: Hoare triple {36357#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36357#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:09,154 INFO L273 TraceCheckUtils]: 69: Hoare triple {36357#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36357#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:09,155 INFO L273 TraceCheckUtils]: 70: Hoare triple {36357#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36358#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:09,156 INFO L273 TraceCheckUtils]: 71: Hoare triple {36358#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36358#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:09,156 INFO L273 TraceCheckUtils]: 72: Hoare triple {36358#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36358#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:09,157 INFO L273 TraceCheckUtils]: 73: Hoare triple {36358#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36359#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:09,157 INFO L273 TraceCheckUtils]: 74: Hoare triple {36359#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36359#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:09,158 INFO L273 TraceCheckUtils]: 75: Hoare triple {36359#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36359#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:09,158 INFO L273 TraceCheckUtils]: 76: Hoare triple {36359#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36360#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:09,159 INFO L273 TraceCheckUtils]: 77: Hoare triple {36360#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36360#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:09,159 INFO L273 TraceCheckUtils]: 78: Hoare triple {36360#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36360#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:09,160 INFO L273 TraceCheckUtils]: 79: Hoare triple {36360#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36361#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:09,161 INFO L273 TraceCheckUtils]: 80: Hoare triple {36361#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36361#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:09,161 INFO L273 TraceCheckUtils]: 81: Hoare triple {36361#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36361#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:09,162 INFO L273 TraceCheckUtils]: 82: Hoare triple {36361#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36362#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:09,162 INFO L273 TraceCheckUtils]: 83: Hoare triple {36362#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36362#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:09,163 INFO L273 TraceCheckUtils]: 84: Hoare triple {36362#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36362#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:09,164 INFO L273 TraceCheckUtils]: 85: Hoare triple {36362#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36363#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:09,164 INFO L273 TraceCheckUtils]: 86: Hoare triple {36363#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36363#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:09,165 INFO L273 TraceCheckUtils]: 87: Hoare triple {36363#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36363#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:09,165 INFO L273 TraceCheckUtils]: 88: Hoare triple {36363#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36364#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:09,166 INFO L273 TraceCheckUtils]: 89: Hoare triple {36364#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36364#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:09,166 INFO L273 TraceCheckUtils]: 90: Hoare triple {36364#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36364#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:09,167 INFO L273 TraceCheckUtils]: 91: Hoare triple {36364#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36365#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:09,168 INFO L273 TraceCheckUtils]: 92: Hoare triple {36365#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36365#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:09,168 INFO L273 TraceCheckUtils]: 93: Hoare triple {36365#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36365#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:09,169 INFO L273 TraceCheckUtils]: 94: Hoare triple {36365#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36366#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:09,169 INFO L273 TraceCheckUtils]: 95: Hoare triple {36366#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36366#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:09,170 INFO L273 TraceCheckUtils]: 96: Hoare triple {36366#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36366#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:09,170 INFO L273 TraceCheckUtils]: 97: Hoare triple {36366#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36367#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:09,171 INFO L273 TraceCheckUtils]: 98: Hoare triple {36367#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36367#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:09,171 INFO L273 TraceCheckUtils]: 99: Hoare triple {36367#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36367#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:09,172 INFO L273 TraceCheckUtils]: 100: Hoare triple {36367#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36368#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:09,173 INFO L273 TraceCheckUtils]: 101: Hoare triple {36368#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36368#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:09,173 INFO L273 TraceCheckUtils]: 102: Hoare triple {36368#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36368#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:09,174 INFO L273 TraceCheckUtils]: 103: Hoare triple {36368#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36369#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:09,174 INFO L273 TraceCheckUtils]: 104: Hoare triple {36369#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36369#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:09,175 INFO L273 TraceCheckUtils]: 105: Hoare triple {36369#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36369#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:09,176 INFO L273 TraceCheckUtils]: 106: Hoare triple {36369#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36370#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:09,176 INFO L273 TraceCheckUtils]: 107: Hoare triple {36370#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36370#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:09,177 INFO L273 TraceCheckUtils]: 108: Hoare triple {36370#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36370#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:09,177 INFO L273 TraceCheckUtils]: 109: Hoare triple {36370#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36371#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:09,178 INFO L273 TraceCheckUtils]: 110: Hoare triple {36371#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36371#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:09,178 INFO L273 TraceCheckUtils]: 111: Hoare triple {36371#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36371#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:09,179 INFO L273 TraceCheckUtils]: 112: Hoare triple {36371#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36372#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:09,180 INFO L273 TraceCheckUtils]: 113: Hoare triple {36372#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36372#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:09,180 INFO L273 TraceCheckUtils]: 114: Hoare triple {36372#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36372#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:09,181 INFO L273 TraceCheckUtils]: 115: Hoare triple {36372#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36373#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:09,181 INFO L273 TraceCheckUtils]: 116: Hoare triple {36373#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36373#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:09,182 INFO L273 TraceCheckUtils]: 117: Hoare triple {36373#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36373#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:09,182 INFO L273 TraceCheckUtils]: 118: Hoare triple {36373#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36374#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:09,183 INFO L273 TraceCheckUtils]: 119: Hoare triple {36374#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36374#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:09,184 INFO L273 TraceCheckUtils]: 120: Hoare triple {36374#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36374#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:09,184 INFO L273 TraceCheckUtils]: 121: Hoare triple {36374#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36375#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:09,185 INFO L273 TraceCheckUtils]: 122: Hoare triple {36375#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36375#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:09,185 INFO L273 TraceCheckUtils]: 123: Hoare triple {36375#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36375#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:09,186 INFO L273 TraceCheckUtils]: 124: Hoare triple {36375#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36376#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:09,186 INFO L273 TraceCheckUtils]: 125: Hoare triple {36376#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36376#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:09,187 INFO L273 TraceCheckUtils]: 126: Hoare triple {36376#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36376#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:09,188 INFO L273 TraceCheckUtils]: 127: Hoare triple {36376#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36377#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:09,188 INFO L273 TraceCheckUtils]: 128: Hoare triple {36377#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36377#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:09,189 INFO L273 TraceCheckUtils]: 129: Hoare triple {36377#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36377#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:09,189 INFO L273 TraceCheckUtils]: 130: Hoare triple {36377#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36378#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:09,190 INFO L273 TraceCheckUtils]: 131: Hoare triple {36378#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36378#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:09,190 INFO L273 TraceCheckUtils]: 132: Hoare triple {36378#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36378#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:09,191 INFO L273 TraceCheckUtils]: 133: Hoare triple {36378#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36379#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:09,192 INFO L273 TraceCheckUtils]: 134: Hoare triple {36379#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36379#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:09,192 INFO L273 TraceCheckUtils]: 135: Hoare triple {36379#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36379#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:09,193 INFO L273 TraceCheckUtils]: 136: Hoare triple {36379#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36380#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:09,193 INFO L273 TraceCheckUtils]: 137: Hoare triple {36380#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {36380#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:09,194 INFO L273 TraceCheckUtils]: 138: Hoare triple {36380#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {36380#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:09,195 INFO L273 TraceCheckUtils]: 139: Hoare triple {36380#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {36381#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:09,195 INFO L273 TraceCheckUtils]: 140: Hoare triple {36381#(<= main_~i~0 46)} assume !(~i~0 < 100000); {36336#false} is VALID [2018-11-23 12:00:09,195 INFO L273 TraceCheckUtils]: 141: Hoare triple {36336#false} havoc ~x~0;~x~0 := 0; {36336#false} is VALID [2018-11-23 12:00:09,196 INFO L273 TraceCheckUtils]: 142: Hoare triple {36336#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {36336#false} is VALID [2018-11-23 12:00:09,196 INFO L256 TraceCheckUtils]: 143: Hoare triple {36336#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {36336#false} is VALID [2018-11-23 12:00:09,196 INFO L273 TraceCheckUtils]: 144: Hoare triple {36336#false} ~cond := #in~cond; {36336#false} is VALID [2018-11-23 12:00:09,196 INFO L273 TraceCheckUtils]: 145: Hoare triple {36336#false} assume 0 == ~cond; {36336#false} is VALID [2018-11-23 12:00:09,196 INFO L273 TraceCheckUtils]: 146: Hoare triple {36336#false} assume !false; {36336#false} is VALID [2018-11-23 12:00:09,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:09,229 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:09,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 47] total 47 [2018-11-23 12:00:09,229 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 147 [2018-11-23 12:00:09,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:09,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states. [2018-11-23 12:00:09,401 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-23 12:00:09,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-11-23 12:00:09,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-11-23 12:00:09,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:00:09,402 INFO L87 Difference]: Start difference. First operand 202 states and 295 transitions. Second operand 47 states. [2018-11-23 12:00:10,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:10,917 INFO L93 Difference]: Finished difference Result 226 states and 327 transitions. [2018-11-23 12:00:10,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-11-23 12:00:10,917 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 147 [2018-11-23 12:00:10,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:10,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:00:10,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 327 transitions. [2018-11-23 12:00:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 12:00:10,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 327 transitions. [2018-11-23 12:00:10,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 327 transitions. [2018-11-23 12:00:11,234 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-23 12:00:11,240 INFO L225 Difference]: With dead ends: 226 [2018-11-23 12:00:11,240 INFO L226 Difference]: Without dead ends: 209 [2018-11-23 12:00:11,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-11-23 12:00:11,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-11-23 12:00:11,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-11-23 12:00:11,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:11,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 206 states. [2018-11-23 12:00:11,328 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 206 states. [2018-11-23 12:00:11,328 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 206 states. [2018-11-23 12:00:11,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:11,332 INFO L93 Difference]: Finished difference Result 209 states and 306 transitions. [2018-11-23 12:00:11,333 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 306 transitions. [2018-11-23 12:00:11,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:11,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:11,333 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 209 states. [2018-11-23 12:00:11,333 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 209 states. [2018-11-23 12:00:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:11,337 INFO L93 Difference]: Finished difference Result 209 states and 306 transitions. [2018-11-23 12:00:11,338 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 306 transitions. [2018-11-23 12:00:11,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:11,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:11,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:11,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-11-23 12:00:11,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 301 transitions. [2018-11-23 12:00:11,342 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 301 transitions. Word has length 147 [2018-11-23 12:00:11,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:11,343 INFO L480 AbstractCegarLoop]: Abstraction has 206 states and 301 transitions. [2018-11-23 12:00:11,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-11-23 12:00:11,343 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 301 transitions. [2018-11-23 12:00:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-11-23 12:00:11,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:11,344 INFO L402 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:11,344 INFO L423 AbstractCegarLoop]: === Iteration 47 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:11,344 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:11,344 INFO L82 PathProgramCache]: Analyzing trace with hash -46484095, now seen corresponding path program 45 times [2018-11-23 12:00:11,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:11,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:11,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:11,345 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:11,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:11,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:13,146 INFO L256 TraceCheckUtils]: 0: Hoare triple {37787#true} call ULTIMATE.init(); {37787#true} is VALID [2018-11-23 12:00:13,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {37787#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37787#true} is VALID [2018-11-23 12:00:13,147 INFO L273 TraceCheckUtils]: 2: Hoare triple {37787#true} assume true; {37787#true} is VALID [2018-11-23 12:00:13,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37787#true} {37787#true} #88#return; {37787#true} is VALID [2018-11-23 12:00:13,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {37787#true} call #t~ret13 := main(); {37787#true} is VALID [2018-11-23 12:00:13,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {37787#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {37787#true} is VALID [2018-11-23 12:00:13,147 INFO L273 TraceCheckUtils]: 6: Hoare triple {37787#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {37787#true} is VALID [2018-11-23 12:00:13,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {37787#true} ~i~0 := 2; {37789#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:13,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {37789#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37789#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:13,149 INFO L273 TraceCheckUtils]: 9: Hoare triple {37789#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37789#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:13,149 INFO L273 TraceCheckUtils]: 10: Hoare triple {37789#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37790#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:13,150 INFO L273 TraceCheckUtils]: 11: Hoare triple {37790#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37790#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:13,150 INFO L273 TraceCheckUtils]: 12: Hoare triple {37790#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37790#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:13,151 INFO L273 TraceCheckUtils]: 13: Hoare triple {37790#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37791#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:13,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {37791#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37791#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:13,152 INFO L273 TraceCheckUtils]: 15: Hoare triple {37791#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37791#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:13,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {37791#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37792#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:13,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {37792#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37792#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:13,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {37792#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37792#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:13,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {37792#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37793#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:13,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {37793#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37793#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:13,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {37793#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37793#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:13,156 INFO L273 TraceCheckUtils]: 22: Hoare triple {37793#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37794#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:13,157 INFO L273 TraceCheckUtils]: 23: Hoare triple {37794#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37794#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:13,157 INFO L273 TraceCheckUtils]: 24: Hoare triple {37794#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37794#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:13,158 INFO L273 TraceCheckUtils]: 25: Hoare triple {37794#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37795#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:13,158 INFO L273 TraceCheckUtils]: 26: Hoare triple {37795#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37795#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:13,159 INFO L273 TraceCheckUtils]: 27: Hoare triple {37795#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37795#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:13,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {37795#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37796#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:13,160 INFO L273 TraceCheckUtils]: 29: Hoare triple {37796#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37796#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:13,161 INFO L273 TraceCheckUtils]: 30: Hoare triple {37796#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37796#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:13,161 INFO L273 TraceCheckUtils]: 31: Hoare triple {37796#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37797#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:13,162 INFO L273 TraceCheckUtils]: 32: Hoare triple {37797#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37797#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:13,162 INFO L273 TraceCheckUtils]: 33: Hoare triple {37797#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37797#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:13,163 INFO L273 TraceCheckUtils]: 34: Hoare triple {37797#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37798#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:13,164 INFO L273 TraceCheckUtils]: 35: Hoare triple {37798#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37798#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:13,164 INFO L273 TraceCheckUtils]: 36: Hoare triple {37798#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37798#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:13,165 INFO L273 TraceCheckUtils]: 37: Hoare triple {37798#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37799#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:13,165 INFO L273 TraceCheckUtils]: 38: Hoare triple {37799#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37799#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:13,166 INFO L273 TraceCheckUtils]: 39: Hoare triple {37799#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37799#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:13,167 INFO L273 TraceCheckUtils]: 40: Hoare triple {37799#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37800#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:13,167 INFO L273 TraceCheckUtils]: 41: Hoare triple {37800#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37800#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:13,168 INFO L273 TraceCheckUtils]: 42: Hoare triple {37800#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37800#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:13,168 INFO L273 TraceCheckUtils]: 43: Hoare triple {37800#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37801#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:13,169 INFO L273 TraceCheckUtils]: 44: Hoare triple {37801#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37801#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:13,169 INFO L273 TraceCheckUtils]: 45: Hoare triple {37801#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37801#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:13,170 INFO L273 TraceCheckUtils]: 46: Hoare triple {37801#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37802#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:13,170 INFO L273 TraceCheckUtils]: 47: Hoare triple {37802#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37802#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:13,171 INFO L273 TraceCheckUtils]: 48: Hoare triple {37802#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37802#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:13,172 INFO L273 TraceCheckUtils]: 49: Hoare triple {37802#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37803#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:13,172 INFO L273 TraceCheckUtils]: 50: Hoare triple {37803#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37803#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:13,173 INFO L273 TraceCheckUtils]: 51: Hoare triple {37803#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37803#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:13,173 INFO L273 TraceCheckUtils]: 52: Hoare triple {37803#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37804#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:13,174 INFO L273 TraceCheckUtils]: 53: Hoare triple {37804#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37804#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:13,174 INFO L273 TraceCheckUtils]: 54: Hoare triple {37804#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37804#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:13,175 INFO L273 TraceCheckUtils]: 55: Hoare triple {37804#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37805#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:13,176 INFO L273 TraceCheckUtils]: 56: Hoare triple {37805#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37805#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:13,176 INFO L273 TraceCheckUtils]: 57: Hoare triple {37805#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37805#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:13,177 INFO L273 TraceCheckUtils]: 58: Hoare triple {37805#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37806#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:13,177 INFO L273 TraceCheckUtils]: 59: Hoare triple {37806#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37806#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:13,178 INFO L273 TraceCheckUtils]: 60: Hoare triple {37806#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37806#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:13,179 INFO L273 TraceCheckUtils]: 61: Hoare triple {37806#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37807#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:13,179 INFO L273 TraceCheckUtils]: 62: Hoare triple {37807#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37807#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:13,180 INFO L273 TraceCheckUtils]: 63: Hoare triple {37807#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37807#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:13,180 INFO L273 TraceCheckUtils]: 64: Hoare triple {37807#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37808#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:13,181 INFO L273 TraceCheckUtils]: 65: Hoare triple {37808#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37808#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:13,181 INFO L273 TraceCheckUtils]: 66: Hoare triple {37808#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37808#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:13,182 INFO L273 TraceCheckUtils]: 67: Hoare triple {37808#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37809#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:13,183 INFO L273 TraceCheckUtils]: 68: Hoare triple {37809#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37809#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:13,183 INFO L273 TraceCheckUtils]: 69: Hoare triple {37809#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37809#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:13,184 INFO L273 TraceCheckUtils]: 70: Hoare triple {37809#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37810#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:13,184 INFO L273 TraceCheckUtils]: 71: Hoare triple {37810#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37810#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:13,185 INFO L273 TraceCheckUtils]: 72: Hoare triple {37810#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37810#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:13,185 INFO L273 TraceCheckUtils]: 73: Hoare triple {37810#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37811#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:13,186 INFO L273 TraceCheckUtils]: 74: Hoare triple {37811#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37811#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:13,186 INFO L273 TraceCheckUtils]: 75: Hoare triple {37811#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37811#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:13,187 INFO L273 TraceCheckUtils]: 76: Hoare triple {37811#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37812#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:13,188 INFO L273 TraceCheckUtils]: 77: Hoare triple {37812#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37812#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:13,188 INFO L273 TraceCheckUtils]: 78: Hoare triple {37812#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37812#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:13,189 INFO L273 TraceCheckUtils]: 79: Hoare triple {37812#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37813#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:13,189 INFO L273 TraceCheckUtils]: 80: Hoare triple {37813#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37813#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:13,190 INFO L273 TraceCheckUtils]: 81: Hoare triple {37813#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37813#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:13,191 INFO L273 TraceCheckUtils]: 82: Hoare triple {37813#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37814#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:13,191 INFO L273 TraceCheckUtils]: 83: Hoare triple {37814#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37814#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:13,192 INFO L273 TraceCheckUtils]: 84: Hoare triple {37814#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37814#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:13,192 INFO L273 TraceCheckUtils]: 85: Hoare triple {37814#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37815#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:13,193 INFO L273 TraceCheckUtils]: 86: Hoare triple {37815#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37815#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:13,193 INFO L273 TraceCheckUtils]: 87: Hoare triple {37815#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37815#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:13,194 INFO L273 TraceCheckUtils]: 88: Hoare triple {37815#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37816#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:13,195 INFO L273 TraceCheckUtils]: 89: Hoare triple {37816#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37816#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:13,195 INFO L273 TraceCheckUtils]: 90: Hoare triple {37816#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37816#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:13,196 INFO L273 TraceCheckUtils]: 91: Hoare triple {37816#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37817#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:13,196 INFO L273 TraceCheckUtils]: 92: Hoare triple {37817#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37817#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:13,197 INFO L273 TraceCheckUtils]: 93: Hoare triple {37817#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37817#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:13,197 INFO L273 TraceCheckUtils]: 94: Hoare triple {37817#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37818#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:13,198 INFO L273 TraceCheckUtils]: 95: Hoare triple {37818#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37818#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:13,198 INFO L273 TraceCheckUtils]: 96: Hoare triple {37818#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37818#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:13,199 INFO L273 TraceCheckUtils]: 97: Hoare triple {37818#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37819#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:13,200 INFO L273 TraceCheckUtils]: 98: Hoare triple {37819#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37819#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:13,200 INFO L273 TraceCheckUtils]: 99: Hoare triple {37819#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37819#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:13,201 INFO L273 TraceCheckUtils]: 100: Hoare triple {37819#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37820#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:13,201 INFO L273 TraceCheckUtils]: 101: Hoare triple {37820#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37820#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:13,202 INFO L273 TraceCheckUtils]: 102: Hoare triple {37820#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37820#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:13,203 INFO L273 TraceCheckUtils]: 103: Hoare triple {37820#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37821#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:13,203 INFO L273 TraceCheckUtils]: 104: Hoare triple {37821#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37821#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:13,204 INFO L273 TraceCheckUtils]: 105: Hoare triple {37821#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37821#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:13,204 INFO L273 TraceCheckUtils]: 106: Hoare triple {37821#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37822#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:13,205 INFO L273 TraceCheckUtils]: 107: Hoare triple {37822#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37822#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:13,205 INFO L273 TraceCheckUtils]: 108: Hoare triple {37822#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37822#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:13,206 INFO L273 TraceCheckUtils]: 109: Hoare triple {37822#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37823#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:13,206 INFO L273 TraceCheckUtils]: 110: Hoare triple {37823#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37823#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:13,207 INFO L273 TraceCheckUtils]: 111: Hoare triple {37823#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37823#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:13,208 INFO L273 TraceCheckUtils]: 112: Hoare triple {37823#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37824#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:13,208 INFO L273 TraceCheckUtils]: 113: Hoare triple {37824#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37824#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:13,209 INFO L273 TraceCheckUtils]: 114: Hoare triple {37824#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37824#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:13,209 INFO L273 TraceCheckUtils]: 115: Hoare triple {37824#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37825#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:13,210 INFO L273 TraceCheckUtils]: 116: Hoare triple {37825#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37825#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:13,210 INFO L273 TraceCheckUtils]: 117: Hoare triple {37825#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37825#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:13,211 INFO L273 TraceCheckUtils]: 118: Hoare triple {37825#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37826#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:13,212 INFO L273 TraceCheckUtils]: 119: Hoare triple {37826#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37826#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:13,212 INFO L273 TraceCheckUtils]: 120: Hoare triple {37826#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37826#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:13,213 INFO L273 TraceCheckUtils]: 121: Hoare triple {37826#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37827#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:13,213 INFO L273 TraceCheckUtils]: 122: Hoare triple {37827#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37827#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:13,214 INFO L273 TraceCheckUtils]: 123: Hoare triple {37827#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37827#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:13,215 INFO L273 TraceCheckUtils]: 124: Hoare triple {37827#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37828#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:13,215 INFO L273 TraceCheckUtils]: 125: Hoare triple {37828#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37828#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:13,216 INFO L273 TraceCheckUtils]: 126: Hoare triple {37828#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37828#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:13,216 INFO L273 TraceCheckUtils]: 127: Hoare triple {37828#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37829#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:13,217 INFO L273 TraceCheckUtils]: 128: Hoare triple {37829#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37829#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:13,217 INFO L273 TraceCheckUtils]: 129: Hoare triple {37829#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37829#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:13,218 INFO L273 TraceCheckUtils]: 130: Hoare triple {37829#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37830#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:13,218 INFO L273 TraceCheckUtils]: 131: Hoare triple {37830#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37830#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:13,219 INFO L273 TraceCheckUtils]: 132: Hoare triple {37830#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37830#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:13,220 INFO L273 TraceCheckUtils]: 133: Hoare triple {37830#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37831#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:13,220 INFO L273 TraceCheckUtils]: 134: Hoare triple {37831#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37831#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:13,221 INFO L273 TraceCheckUtils]: 135: Hoare triple {37831#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37831#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:13,221 INFO L273 TraceCheckUtils]: 136: Hoare triple {37831#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37832#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:13,222 INFO L273 TraceCheckUtils]: 137: Hoare triple {37832#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37832#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:13,222 INFO L273 TraceCheckUtils]: 138: Hoare triple {37832#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37832#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:13,223 INFO L273 TraceCheckUtils]: 139: Hoare triple {37832#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37833#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:13,224 INFO L273 TraceCheckUtils]: 140: Hoare triple {37833#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37833#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:13,224 INFO L273 TraceCheckUtils]: 141: Hoare triple {37833#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37833#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:13,225 INFO L273 TraceCheckUtils]: 142: Hoare triple {37833#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37834#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:13,226 INFO L273 TraceCheckUtils]: 143: Hoare triple {37834#(<= main_~i~0 47)} assume !(~i~0 < 100000); {37788#false} is VALID [2018-11-23 12:00:13,226 INFO L273 TraceCheckUtils]: 144: Hoare triple {37788#false} havoc ~x~0;~x~0 := 0; {37788#false} is VALID [2018-11-23 12:00:13,226 INFO L273 TraceCheckUtils]: 145: Hoare triple {37788#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {37788#false} is VALID [2018-11-23 12:00:13,226 INFO L256 TraceCheckUtils]: 146: Hoare triple {37788#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {37788#false} is VALID [2018-11-23 12:00:13,226 INFO L273 TraceCheckUtils]: 147: Hoare triple {37788#false} ~cond := #in~cond; {37788#false} is VALID [2018-11-23 12:00:13,226 INFO L273 TraceCheckUtils]: 148: Hoare triple {37788#false} assume 0 == ~cond; {37788#false} is VALID [2018-11-23 12:00:13,227 INFO L273 TraceCheckUtils]: 149: Hoare triple {37788#false} assume !false; {37788#false} is VALID [2018-11-23 12:00:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:13,241 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:13,241 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-23 12:00:13,250 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:00:13,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 46 check-sat command(s) [2018-11-23 12:00:13,384 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:13,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:14,735 INFO L256 TraceCheckUtils]: 0: Hoare triple {37787#true} call ULTIMATE.init(); {37787#true} is VALID [2018-11-23 12:00:14,735 INFO L273 TraceCheckUtils]: 1: Hoare triple {37787#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {37787#true} is VALID [2018-11-23 12:00:14,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {37787#true} assume true; {37787#true} is VALID [2018-11-23 12:00:14,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37787#true} {37787#true} #88#return; {37787#true} is VALID [2018-11-23 12:00:14,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {37787#true} call #t~ret13 := main(); {37787#true} is VALID [2018-11-23 12:00:14,735 INFO L273 TraceCheckUtils]: 5: Hoare triple {37787#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {37787#true} is VALID [2018-11-23 12:00:14,736 INFO L273 TraceCheckUtils]: 6: Hoare triple {37787#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {37787#true} is VALID [2018-11-23 12:00:14,736 INFO L273 TraceCheckUtils]: 7: Hoare triple {37787#true} ~i~0 := 2; {37789#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:14,738 INFO L273 TraceCheckUtils]: 8: Hoare triple {37789#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37789#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:14,738 INFO L273 TraceCheckUtils]: 9: Hoare triple {37789#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37789#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:14,740 INFO L273 TraceCheckUtils]: 10: Hoare triple {37789#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37790#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:14,740 INFO L273 TraceCheckUtils]: 11: Hoare triple {37790#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37790#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:14,742 INFO L273 TraceCheckUtils]: 12: Hoare triple {37790#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37790#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:14,742 INFO L273 TraceCheckUtils]: 13: Hoare triple {37790#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37791#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:14,745 INFO L273 TraceCheckUtils]: 14: Hoare triple {37791#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37791#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:14,745 INFO L273 TraceCheckUtils]: 15: Hoare triple {37791#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37791#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:14,747 INFO L273 TraceCheckUtils]: 16: Hoare triple {37791#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37792#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:14,747 INFO L273 TraceCheckUtils]: 17: Hoare triple {37792#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37792#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:14,750 INFO L273 TraceCheckUtils]: 18: Hoare triple {37792#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37792#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:14,750 INFO L273 TraceCheckUtils]: 19: Hoare triple {37792#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37793#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:14,752 INFO L273 TraceCheckUtils]: 20: Hoare triple {37793#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37793#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:14,752 INFO L273 TraceCheckUtils]: 21: Hoare triple {37793#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37793#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:14,755 INFO L273 TraceCheckUtils]: 22: Hoare triple {37793#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37794#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:14,755 INFO L273 TraceCheckUtils]: 23: Hoare triple {37794#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37794#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:14,757 INFO L273 TraceCheckUtils]: 24: Hoare triple {37794#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37794#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:14,757 INFO L273 TraceCheckUtils]: 25: Hoare triple {37794#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37795#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:14,759 INFO L273 TraceCheckUtils]: 26: Hoare triple {37795#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37795#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:14,759 INFO L273 TraceCheckUtils]: 27: Hoare triple {37795#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37795#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:14,761 INFO L273 TraceCheckUtils]: 28: Hoare triple {37795#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37796#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:14,761 INFO L273 TraceCheckUtils]: 29: Hoare triple {37796#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37796#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:14,764 INFO L273 TraceCheckUtils]: 30: Hoare triple {37796#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37796#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:14,764 INFO L273 TraceCheckUtils]: 31: Hoare triple {37796#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37797#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:14,766 INFO L273 TraceCheckUtils]: 32: Hoare triple {37797#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37797#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:14,766 INFO L273 TraceCheckUtils]: 33: Hoare triple {37797#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37797#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:14,769 INFO L273 TraceCheckUtils]: 34: Hoare triple {37797#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37798#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:14,769 INFO L273 TraceCheckUtils]: 35: Hoare triple {37798#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37798#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:14,771 INFO L273 TraceCheckUtils]: 36: Hoare triple {37798#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37798#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:14,771 INFO L273 TraceCheckUtils]: 37: Hoare triple {37798#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37799#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:14,774 INFO L273 TraceCheckUtils]: 38: Hoare triple {37799#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37799#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:14,774 INFO L273 TraceCheckUtils]: 39: Hoare triple {37799#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37799#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:14,776 INFO L273 TraceCheckUtils]: 40: Hoare triple {37799#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37800#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:14,776 INFO L273 TraceCheckUtils]: 41: Hoare triple {37800#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37800#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:14,779 INFO L273 TraceCheckUtils]: 42: Hoare triple {37800#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37800#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:14,779 INFO L273 TraceCheckUtils]: 43: Hoare triple {37800#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37801#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:14,781 INFO L273 TraceCheckUtils]: 44: Hoare triple {37801#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37801#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:14,781 INFO L273 TraceCheckUtils]: 45: Hoare triple {37801#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37801#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:14,784 INFO L273 TraceCheckUtils]: 46: Hoare triple {37801#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37802#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:14,784 INFO L273 TraceCheckUtils]: 47: Hoare triple {37802#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37802#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:14,786 INFO L273 TraceCheckUtils]: 48: Hoare triple {37802#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37802#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:14,786 INFO L273 TraceCheckUtils]: 49: Hoare triple {37802#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37803#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:14,789 INFO L273 TraceCheckUtils]: 50: Hoare triple {37803#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37803#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:14,789 INFO L273 TraceCheckUtils]: 51: Hoare triple {37803#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37803#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:14,791 INFO L273 TraceCheckUtils]: 52: Hoare triple {37803#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37804#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:14,791 INFO L273 TraceCheckUtils]: 53: Hoare triple {37804#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37804#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:14,793 INFO L273 TraceCheckUtils]: 54: Hoare triple {37804#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37804#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:14,793 INFO L273 TraceCheckUtils]: 55: Hoare triple {37804#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37805#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:14,795 INFO L273 TraceCheckUtils]: 56: Hoare triple {37805#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37805#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:14,795 INFO L273 TraceCheckUtils]: 57: Hoare triple {37805#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37805#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:14,797 INFO L273 TraceCheckUtils]: 58: Hoare triple {37805#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37806#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:14,797 INFO L273 TraceCheckUtils]: 59: Hoare triple {37806#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37806#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:14,799 INFO L273 TraceCheckUtils]: 60: Hoare triple {37806#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37806#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:14,799 INFO L273 TraceCheckUtils]: 61: Hoare triple {37806#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37807#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:14,801 INFO L273 TraceCheckUtils]: 62: Hoare triple {37807#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37807#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:14,801 INFO L273 TraceCheckUtils]: 63: Hoare triple {37807#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37807#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:14,803 INFO L273 TraceCheckUtils]: 64: Hoare triple {37807#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37808#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:14,803 INFO L273 TraceCheckUtils]: 65: Hoare triple {37808#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37808#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:14,806 INFO L273 TraceCheckUtils]: 66: Hoare triple {37808#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37808#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:14,806 INFO L273 TraceCheckUtils]: 67: Hoare triple {37808#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37809#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:14,808 INFO L273 TraceCheckUtils]: 68: Hoare triple {37809#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37809#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:14,808 INFO L273 TraceCheckUtils]: 69: Hoare triple {37809#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37809#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:14,811 INFO L273 TraceCheckUtils]: 70: Hoare triple {37809#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37810#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:14,811 INFO L273 TraceCheckUtils]: 71: Hoare triple {37810#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37810#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:14,814 INFO L273 TraceCheckUtils]: 72: Hoare triple {37810#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37810#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:14,814 INFO L273 TraceCheckUtils]: 73: Hoare triple {37810#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37811#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:14,816 INFO L273 TraceCheckUtils]: 74: Hoare triple {37811#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37811#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:14,816 INFO L273 TraceCheckUtils]: 75: Hoare triple {37811#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37811#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:14,819 INFO L273 TraceCheckUtils]: 76: Hoare triple {37811#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37812#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:14,819 INFO L273 TraceCheckUtils]: 77: Hoare triple {37812#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37812#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:14,821 INFO L273 TraceCheckUtils]: 78: Hoare triple {37812#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37812#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:14,821 INFO L273 TraceCheckUtils]: 79: Hoare triple {37812#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37813#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:14,823 INFO L273 TraceCheckUtils]: 80: Hoare triple {37813#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37813#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:14,823 INFO L273 TraceCheckUtils]: 81: Hoare triple {37813#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37813#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:14,825 INFO L273 TraceCheckUtils]: 82: Hoare triple {37813#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37814#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:14,825 INFO L273 TraceCheckUtils]: 83: Hoare triple {37814#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37814#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:14,827 INFO L273 TraceCheckUtils]: 84: Hoare triple {37814#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37814#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:14,830 INFO L273 TraceCheckUtils]: 85: Hoare triple {37814#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37815#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:14,832 INFO L273 TraceCheckUtils]: 86: Hoare triple {37815#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37815#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:14,832 INFO L273 TraceCheckUtils]: 87: Hoare triple {37815#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37815#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:14,834 INFO L273 TraceCheckUtils]: 88: Hoare triple {37815#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37816#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:14,834 INFO L273 TraceCheckUtils]: 89: Hoare triple {37816#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37816#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:14,837 INFO L273 TraceCheckUtils]: 90: Hoare triple {37816#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37816#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:14,837 INFO L273 TraceCheckUtils]: 91: Hoare triple {37816#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37817#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:14,839 INFO L273 TraceCheckUtils]: 92: Hoare triple {37817#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37817#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:14,839 INFO L273 TraceCheckUtils]: 93: Hoare triple {37817#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37817#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:14,841 INFO L273 TraceCheckUtils]: 94: Hoare triple {37817#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37818#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:14,841 INFO L273 TraceCheckUtils]: 95: Hoare triple {37818#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37818#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:14,843 INFO L273 TraceCheckUtils]: 96: Hoare triple {37818#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37818#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:14,843 INFO L273 TraceCheckUtils]: 97: Hoare triple {37818#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37819#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:14,846 INFO L273 TraceCheckUtils]: 98: Hoare triple {37819#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37819#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:14,846 INFO L273 TraceCheckUtils]: 99: Hoare triple {37819#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37819#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:14,848 INFO L273 TraceCheckUtils]: 100: Hoare triple {37819#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37820#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:14,848 INFO L273 TraceCheckUtils]: 101: Hoare triple {37820#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37820#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:14,851 INFO L273 TraceCheckUtils]: 102: Hoare triple {37820#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37820#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:14,851 INFO L273 TraceCheckUtils]: 103: Hoare triple {37820#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37821#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:14,853 INFO L273 TraceCheckUtils]: 104: Hoare triple {37821#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37821#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:14,853 INFO L273 TraceCheckUtils]: 105: Hoare triple {37821#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37821#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:14,855 INFO L273 TraceCheckUtils]: 106: Hoare triple {37821#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37822#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:14,855 INFO L273 TraceCheckUtils]: 107: Hoare triple {37822#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37822#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:14,857 INFO L273 TraceCheckUtils]: 108: Hoare triple {37822#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37822#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:14,857 INFO L273 TraceCheckUtils]: 109: Hoare triple {37822#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37823#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:14,859 INFO L273 TraceCheckUtils]: 110: Hoare triple {37823#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37823#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:14,859 INFO L273 TraceCheckUtils]: 111: Hoare triple {37823#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37823#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:14,861 INFO L273 TraceCheckUtils]: 112: Hoare triple {37823#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37824#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:14,861 INFO L273 TraceCheckUtils]: 113: Hoare triple {37824#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37824#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:14,864 INFO L273 TraceCheckUtils]: 114: Hoare triple {37824#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37824#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:14,864 INFO L273 TraceCheckUtils]: 115: Hoare triple {37824#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37825#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:14,867 INFO L273 TraceCheckUtils]: 116: Hoare triple {37825#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37825#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:14,867 INFO L273 TraceCheckUtils]: 117: Hoare triple {37825#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37825#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:14,869 INFO L273 TraceCheckUtils]: 118: Hoare triple {37825#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37826#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:14,869 INFO L273 TraceCheckUtils]: 119: Hoare triple {37826#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37826#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:14,871 INFO L273 TraceCheckUtils]: 120: Hoare triple {37826#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37826#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:14,871 INFO L273 TraceCheckUtils]: 121: Hoare triple {37826#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37827#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:14,873 INFO L273 TraceCheckUtils]: 122: Hoare triple {37827#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37827#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:14,873 INFO L273 TraceCheckUtils]: 123: Hoare triple {37827#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37827#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:14,875 INFO L273 TraceCheckUtils]: 124: Hoare triple {37827#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37828#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:14,875 INFO L273 TraceCheckUtils]: 125: Hoare triple {37828#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37828#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:14,878 INFO L273 TraceCheckUtils]: 126: Hoare triple {37828#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37828#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:14,878 INFO L273 TraceCheckUtils]: 127: Hoare triple {37828#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37829#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:14,881 INFO L273 TraceCheckUtils]: 128: Hoare triple {37829#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37829#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:14,881 INFO L273 TraceCheckUtils]: 129: Hoare triple {37829#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37829#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:14,883 INFO L273 TraceCheckUtils]: 130: Hoare triple {37829#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37830#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:14,883 INFO L273 TraceCheckUtils]: 131: Hoare triple {37830#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37830#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:14,885 INFO L273 TraceCheckUtils]: 132: Hoare triple {37830#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37830#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:14,885 INFO L273 TraceCheckUtils]: 133: Hoare triple {37830#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37831#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:14,885 INFO L273 TraceCheckUtils]: 134: Hoare triple {37831#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37831#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:14,886 INFO L273 TraceCheckUtils]: 135: Hoare triple {37831#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37831#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:14,886 INFO L273 TraceCheckUtils]: 136: Hoare triple {37831#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37832#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:14,886 INFO L273 TraceCheckUtils]: 137: Hoare triple {37832#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37832#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:14,887 INFO L273 TraceCheckUtils]: 138: Hoare triple {37832#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37832#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:14,887 INFO L273 TraceCheckUtils]: 139: Hoare triple {37832#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37833#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:14,887 INFO L273 TraceCheckUtils]: 140: Hoare triple {37833#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {37833#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:14,888 INFO L273 TraceCheckUtils]: 141: Hoare triple {37833#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {37833#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:14,889 INFO L273 TraceCheckUtils]: 142: Hoare triple {37833#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {37834#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:14,889 INFO L273 TraceCheckUtils]: 143: Hoare triple {37834#(<= main_~i~0 47)} assume !(~i~0 < 100000); {37788#false} is VALID [2018-11-23 12:00:14,890 INFO L273 TraceCheckUtils]: 144: Hoare triple {37788#false} havoc ~x~0;~x~0 := 0; {37788#false} is VALID [2018-11-23 12:00:14,890 INFO L273 TraceCheckUtils]: 145: Hoare triple {37788#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {37788#false} is VALID [2018-11-23 12:00:14,890 INFO L256 TraceCheckUtils]: 146: Hoare triple {37788#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {37788#false} is VALID [2018-11-23 12:00:14,890 INFO L273 TraceCheckUtils]: 147: Hoare triple {37788#false} ~cond := #in~cond; {37788#false} is VALID [2018-11-23 12:00:14,890 INFO L273 TraceCheckUtils]: 148: Hoare triple {37788#false} assume 0 == ~cond; {37788#false} is VALID [2018-11-23 12:00:14,891 INFO L273 TraceCheckUtils]: 149: Hoare triple {37788#false} assume !false; {37788#false} is VALID [2018-11-23 12:00:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:14,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:14,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 48] total 48 [2018-11-23 12:00:14,933 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 150 [2018-11-23 12:00:14,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:14,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 12:00:15,150 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:15,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 12:00:15,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 12:00:15,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:00:15,151 INFO L87 Difference]: Start difference. First operand 206 states and 301 transitions. Second operand 48 states. [2018-11-23 12:00:16,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:16,224 INFO L93 Difference]: Finished difference Result 230 states and 333 transitions. [2018-11-23 12:00:16,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 12:00:16,225 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 150 [2018-11-23 12:00:16,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:00:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 333 transitions. [2018-11-23 12:00:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 12:00:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 333 transitions. [2018-11-23 12:00:16,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 333 transitions. [2018-11-23 12:00:16,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:16,553 INFO L225 Difference]: With dead ends: 230 [2018-11-23 12:00:16,553 INFO L226 Difference]: Without dead ends: 213 [2018-11-23 12:00:16,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 12:00:16,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-11-23 12:00:17,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 210. [2018-11-23 12:00:17,040 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:17,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 210 states. [2018-11-23 12:00:17,040 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 210 states. [2018-11-23 12:00:17,040 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 210 states. [2018-11-23 12:00:17,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:17,043 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2018-11-23 12:00:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 312 transitions. [2018-11-23 12:00:17,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:17,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:17,044 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 213 states. [2018-11-23 12:00:17,044 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 213 states. [2018-11-23 12:00:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:17,047 INFO L93 Difference]: Finished difference Result 213 states and 312 transitions. [2018-11-23 12:00:17,047 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 312 transitions. [2018-11-23 12:00:17,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:17,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:17,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:17,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-23 12:00:17,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 307 transitions. [2018-11-23 12:00:17,051 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 307 transitions. Word has length 150 [2018-11-23 12:00:17,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:17,051 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 307 transitions. [2018-11-23 12:00:17,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 12:00:17,051 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 307 transitions. [2018-11-23 12:00:17,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-23 12:00:17,052 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:17,052 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:17,052 INFO L423 AbstractCegarLoop]: === Iteration 48 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:17,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:17,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1178422916, now seen corresponding path program 46 times [2018-11-23 12:00:17,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:17,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:17,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:17,053 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:17,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:17,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:18,420 INFO L256 TraceCheckUtils]: 0: Hoare triple {39267#true} call ULTIMATE.init(); {39267#true} is VALID [2018-11-23 12:00:18,420 INFO L273 TraceCheckUtils]: 1: Hoare triple {39267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39267#true} is VALID [2018-11-23 12:00:18,420 INFO L273 TraceCheckUtils]: 2: Hoare triple {39267#true} assume true; {39267#true} is VALID [2018-11-23 12:00:18,420 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39267#true} {39267#true} #88#return; {39267#true} is VALID [2018-11-23 12:00:18,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {39267#true} call #t~ret13 := main(); {39267#true} is VALID [2018-11-23 12:00:18,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {39267#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {39267#true} is VALID [2018-11-23 12:00:18,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {39267#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {39267#true} is VALID [2018-11-23 12:00:18,421 INFO L273 TraceCheckUtils]: 7: Hoare triple {39267#true} ~i~0 := 2; {39269#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:18,422 INFO L273 TraceCheckUtils]: 8: Hoare triple {39269#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39269#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:18,422 INFO L273 TraceCheckUtils]: 9: Hoare triple {39269#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39269#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:18,423 INFO L273 TraceCheckUtils]: 10: Hoare triple {39269#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39270#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:18,423 INFO L273 TraceCheckUtils]: 11: Hoare triple {39270#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39270#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:18,423 INFO L273 TraceCheckUtils]: 12: Hoare triple {39270#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39270#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:18,424 INFO L273 TraceCheckUtils]: 13: Hoare triple {39270#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39271#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:18,424 INFO L273 TraceCheckUtils]: 14: Hoare triple {39271#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39271#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:18,425 INFO L273 TraceCheckUtils]: 15: Hoare triple {39271#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39271#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:18,425 INFO L273 TraceCheckUtils]: 16: Hoare triple {39271#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39272#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:18,426 INFO L273 TraceCheckUtils]: 17: Hoare triple {39272#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39272#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:18,426 INFO L273 TraceCheckUtils]: 18: Hoare triple {39272#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39272#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:18,427 INFO L273 TraceCheckUtils]: 19: Hoare triple {39272#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39273#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:18,428 INFO L273 TraceCheckUtils]: 20: Hoare triple {39273#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39273#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:18,428 INFO L273 TraceCheckUtils]: 21: Hoare triple {39273#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39273#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:18,429 INFO L273 TraceCheckUtils]: 22: Hoare triple {39273#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39274#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:18,429 INFO L273 TraceCheckUtils]: 23: Hoare triple {39274#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39274#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:18,430 INFO L273 TraceCheckUtils]: 24: Hoare triple {39274#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39274#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:18,431 INFO L273 TraceCheckUtils]: 25: Hoare triple {39274#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39275#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:18,431 INFO L273 TraceCheckUtils]: 26: Hoare triple {39275#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39275#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:18,432 INFO L273 TraceCheckUtils]: 27: Hoare triple {39275#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39275#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:18,432 INFO L273 TraceCheckUtils]: 28: Hoare triple {39275#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39276#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:18,433 INFO L273 TraceCheckUtils]: 29: Hoare triple {39276#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39276#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:18,433 INFO L273 TraceCheckUtils]: 30: Hoare triple {39276#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39276#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:18,434 INFO L273 TraceCheckUtils]: 31: Hoare triple {39276#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39277#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:18,435 INFO L273 TraceCheckUtils]: 32: Hoare triple {39277#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39277#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:18,435 INFO L273 TraceCheckUtils]: 33: Hoare triple {39277#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39277#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:18,436 INFO L273 TraceCheckUtils]: 34: Hoare triple {39277#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39278#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:18,436 INFO L273 TraceCheckUtils]: 35: Hoare triple {39278#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39278#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:18,437 INFO L273 TraceCheckUtils]: 36: Hoare triple {39278#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39278#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:18,438 INFO L273 TraceCheckUtils]: 37: Hoare triple {39278#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39279#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:18,438 INFO L273 TraceCheckUtils]: 38: Hoare triple {39279#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39279#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:18,439 INFO L273 TraceCheckUtils]: 39: Hoare triple {39279#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39279#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:18,439 INFO L273 TraceCheckUtils]: 40: Hoare triple {39279#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39280#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:18,440 INFO L273 TraceCheckUtils]: 41: Hoare triple {39280#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39280#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:18,440 INFO L273 TraceCheckUtils]: 42: Hoare triple {39280#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39280#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:18,441 INFO L273 TraceCheckUtils]: 43: Hoare triple {39280#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39281#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:18,441 INFO L273 TraceCheckUtils]: 44: Hoare triple {39281#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39281#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:18,442 INFO L273 TraceCheckUtils]: 45: Hoare triple {39281#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39281#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:18,443 INFO L273 TraceCheckUtils]: 46: Hoare triple {39281#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39282#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:18,443 INFO L273 TraceCheckUtils]: 47: Hoare triple {39282#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39282#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:18,444 INFO L273 TraceCheckUtils]: 48: Hoare triple {39282#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39282#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:18,444 INFO L273 TraceCheckUtils]: 49: Hoare triple {39282#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39283#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:18,445 INFO L273 TraceCheckUtils]: 50: Hoare triple {39283#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39283#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:18,445 INFO L273 TraceCheckUtils]: 51: Hoare triple {39283#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39283#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:18,446 INFO L273 TraceCheckUtils]: 52: Hoare triple {39283#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39284#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:18,447 INFO L273 TraceCheckUtils]: 53: Hoare triple {39284#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39284#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:18,447 INFO L273 TraceCheckUtils]: 54: Hoare triple {39284#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39284#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:18,448 INFO L273 TraceCheckUtils]: 55: Hoare triple {39284#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39285#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:18,448 INFO L273 TraceCheckUtils]: 56: Hoare triple {39285#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39285#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:18,449 INFO L273 TraceCheckUtils]: 57: Hoare triple {39285#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39285#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:18,450 INFO L273 TraceCheckUtils]: 58: Hoare triple {39285#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39286#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:18,450 INFO L273 TraceCheckUtils]: 59: Hoare triple {39286#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39286#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:18,451 INFO L273 TraceCheckUtils]: 60: Hoare triple {39286#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39286#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:18,451 INFO L273 TraceCheckUtils]: 61: Hoare triple {39286#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39287#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:18,452 INFO L273 TraceCheckUtils]: 62: Hoare triple {39287#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39287#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:18,452 INFO L273 TraceCheckUtils]: 63: Hoare triple {39287#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39287#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:18,453 INFO L273 TraceCheckUtils]: 64: Hoare triple {39287#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39288#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:18,453 INFO L273 TraceCheckUtils]: 65: Hoare triple {39288#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39288#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:18,454 INFO L273 TraceCheckUtils]: 66: Hoare triple {39288#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39288#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:18,455 INFO L273 TraceCheckUtils]: 67: Hoare triple {39288#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39289#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:18,455 INFO L273 TraceCheckUtils]: 68: Hoare triple {39289#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39289#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:18,456 INFO L273 TraceCheckUtils]: 69: Hoare triple {39289#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39289#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:18,456 INFO L273 TraceCheckUtils]: 70: Hoare triple {39289#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39290#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:18,457 INFO L273 TraceCheckUtils]: 71: Hoare triple {39290#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39290#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:18,457 INFO L273 TraceCheckUtils]: 72: Hoare triple {39290#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39290#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:18,458 INFO L273 TraceCheckUtils]: 73: Hoare triple {39290#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39291#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:18,459 INFO L273 TraceCheckUtils]: 74: Hoare triple {39291#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39291#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:18,459 INFO L273 TraceCheckUtils]: 75: Hoare triple {39291#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39291#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:18,460 INFO L273 TraceCheckUtils]: 76: Hoare triple {39291#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39292#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:18,460 INFO L273 TraceCheckUtils]: 77: Hoare triple {39292#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39292#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:18,461 INFO L273 TraceCheckUtils]: 78: Hoare triple {39292#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39292#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:18,462 INFO L273 TraceCheckUtils]: 79: Hoare triple {39292#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39293#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:18,462 INFO L273 TraceCheckUtils]: 80: Hoare triple {39293#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39293#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:18,463 INFO L273 TraceCheckUtils]: 81: Hoare triple {39293#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39293#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:18,463 INFO L273 TraceCheckUtils]: 82: Hoare triple {39293#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39294#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:18,464 INFO L273 TraceCheckUtils]: 83: Hoare triple {39294#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39294#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:18,464 INFO L273 TraceCheckUtils]: 84: Hoare triple {39294#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39294#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:18,465 INFO L273 TraceCheckUtils]: 85: Hoare triple {39294#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39295#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:18,466 INFO L273 TraceCheckUtils]: 86: Hoare triple {39295#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39295#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:18,466 INFO L273 TraceCheckUtils]: 87: Hoare triple {39295#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39295#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:18,467 INFO L273 TraceCheckUtils]: 88: Hoare triple {39295#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39296#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:18,467 INFO L273 TraceCheckUtils]: 89: Hoare triple {39296#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39296#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:18,468 INFO L273 TraceCheckUtils]: 90: Hoare triple {39296#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39296#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:18,468 INFO L273 TraceCheckUtils]: 91: Hoare triple {39296#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39297#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:18,469 INFO L273 TraceCheckUtils]: 92: Hoare triple {39297#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39297#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:18,469 INFO L273 TraceCheckUtils]: 93: Hoare triple {39297#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39297#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:18,470 INFO L273 TraceCheckUtils]: 94: Hoare triple {39297#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39298#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:18,471 INFO L273 TraceCheckUtils]: 95: Hoare triple {39298#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39298#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:18,471 INFO L273 TraceCheckUtils]: 96: Hoare triple {39298#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39298#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:18,472 INFO L273 TraceCheckUtils]: 97: Hoare triple {39298#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39299#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:18,472 INFO L273 TraceCheckUtils]: 98: Hoare triple {39299#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39299#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:18,473 INFO L273 TraceCheckUtils]: 99: Hoare triple {39299#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39299#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:18,474 INFO L273 TraceCheckUtils]: 100: Hoare triple {39299#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39300#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:18,474 INFO L273 TraceCheckUtils]: 101: Hoare triple {39300#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39300#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:18,475 INFO L273 TraceCheckUtils]: 102: Hoare triple {39300#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39300#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:18,475 INFO L273 TraceCheckUtils]: 103: Hoare triple {39300#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39301#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:18,476 INFO L273 TraceCheckUtils]: 104: Hoare triple {39301#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39301#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:18,476 INFO L273 TraceCheckUtils]: 105: Hoare triple {39301#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39301#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:18,477 INFO L273 TraceCheckUtils]: 106: Hoare triple {39301#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39302#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:18,478 INFO L273 TraceCheckUtils]: 107: Hoare triple {39302#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39302#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:18,478 INFO L273 TraceCheckUtils]: 108: Hoare triple {39302#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39302#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:18,479 INFO L273 TraceCheckUtils]: 109: Hoare triple {39302#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39303#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:18,479 INFO L273 TraceCheckUtils]: 110: Hoare triple {39303#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39303#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:18,480 INFO L273 TraceCheckUtils]: 111: Hoare triple {39303#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39303#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:18,480 INFO L273 TraceCheckUtils]: 112: Hoare triple {39303#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39304#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:18,481 INFO L273 TraceCheckUtils]: 113: Hoare triple {39304#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39304#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:18,481 INFO L273 TraceCheckUtils]: 114: Hoare triple {39304#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39304#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:18,482 INFO L273 TraceCheckUtils]: 115: Hoare triple {39304#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39305#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:18,483 INFO L273 TraceCheckUtils]: 116: Hoare triple {39305#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39305#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:18,483 INFO L273 TraceCheckUtils]: 117: Hoare triple {39305#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39305#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:18,484 INFO L273 TraceCheckUtils]: 118: Hoare triple {39305#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39306#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:18,484 INFO L273 TraceCheckUtils]: 119: Hoare triple {39306#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39306#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:18,485 INFO L273 TraceCheckUtils]: 120: Hoare triple {39306#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39306#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:18,486 INFO L273 TraceCheckUtils]: 121: Hoare triple {39306#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39307#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:18,486 INFO L273 TraceCheckUtils]: 122: Hoare triple {39307#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39307#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:18,487 INFO L273 TraceCheckUtils]: 123: Hoare triple {39307#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39307#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:18,487 INFO L273 TraceCheckUtils]: 124: Hoare triple {39307#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39308#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:18,488 INFO L273 TraceCheckUtils]: 125: Hoare triple {39308#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39308#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:18,488 INFO L273 TraceCheckUtils]: 126: Hoare triple {39308#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39308#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:18,489 INFO L273 TraceCheckUtils]: 127: Hoare triple {39308#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39309#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:18,490 INFO L273 TraceCheckUtils]: 128: Hoare triple {39309#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39309#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:18,490 INFO L273 TraceCheckUtils]: 129: Hoare triple {39309#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39309#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:18,491 INFO L273 TraceCheckUtils]: 130: Hoare triple {39309#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39310#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:18,491 INFO L273 TraceCheckUtils]: 131: Hoare triple {39310#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39310#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:18,492 INFO L273 TraceCheckUtils]: 132: Hoare triple {39310#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39310#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:18,492 INFO L273 TraceCheckUtils]: 133: Hoare triple {39310#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39311#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:18,493 INFO L273 TraceCheckUtils]: 134: Hoare triple {39311#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39311#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:18,493 INFO L273 TraceCheckUtils]: 135: Hoare triple {39311#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39311#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:18,494 INFO L273 TraceCheckUtils]: 136: Hoare triple {39311#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39312#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:18,495 INFO L273 TraceCheckUtils]: 137: Hoare triple {39312#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39312#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:18,495 INFO L273 TraceCheckUtils]: 138: Hoare triple {39312#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39312#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:18,496 INFO L273 TraceCheckUtils]: 139: Hoare triple {39312#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39313#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:18,496 INFO L273 TraceCheckUtils]: 140: Hoare triple {39313#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39313#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:18,497 INFO L273 TraceCheckUtils]: 141: Hoare triple {39313#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39313#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:18,498 INFO L273 TraceCheckUtils]: 142: Hoare triple {39313#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39314#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:18,498 INFO L273 TraceCheckUtils]: 143: Hoare triple {39314#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39314#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:18,499 INFO L273 TraceCheckUtils]: 144: Hoare triple {39314#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39314#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:18,499 INFO L273 TraceCheckUtils]: 145: Hoare triple {39314#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39315#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:18,500 INFO L273 TraceCheckUtils]: 146: Hoare triple {39315#(<= main_~i~0 48)} assume !(~i~0 < 100000); {39268#false} is VALID [2018-11-23 12:00:18,500 INFO L273 TraceCheckUtils]: 147: Hoare triple {39268#false} havoc ~x~0;~x~0 := 0; {39268#false} is VALID [2018-11-23 12:00:18,500 INFO L273 TraceCheckUtils]: 148: Hoare triple {39268#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {39268#false} is VALID [2018-11-23 12:00:18,501 INFO L256 TraceCheckUtils]: 149: Hoare triple {39268#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {39268#false} is VALID [2018-11-23 12:00:18,501 INFO L273 TraceCheckUtils]: 150: Hoare triple {39268#false} ~cond := #in~cond; {39268#false} is VALID [2018-11-23 12:00:18,501 INFO L273 TraceCheckUtils]: 151: Hoare triple {39268#false} assume 0 == ~cond; {39268#false} is VALID [2018-11-23 12:00:18,501 INFO L273 TraceCheckUtils]: 152: Hoare triple {39268#false} assume !false; {39268#false} is VALID [2018-11-23 12:00:18,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:18,515 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:18,515 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-23 12:00:18,527 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:00:18,604 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:00:18,604 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:18,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:18,966 INFO L256 TraceCheckUtils]: 0: Hoare triple {39267#true} call ULTIMATE.init(); {39267#true} is VALID [2018-11-23 12:00:18,966 INFO L273 TraceCheckUtils]: 1: Hoare triple {39267#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {39267#true} is VALID [2018-11-23 12:00:18,966 INFO L273 TraceCheckUtils]: 2: Hoare triple {39267#true} assume true; {39267#true} is VALID [2018-11-23 12:00:18,966 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {39267#true} {39267#true} #88#return; {39267#true} is VALID [2018-11-23 12:00:18,966 INFO L256 TraceCheckUtils]: 4: Hoare triple {39267#true} call #t~ret13 := main(); {39267#true} is VALID [2018-11-23 12:00:18,967 INFO L273 TraceCheckUtils]: 5: Hoare triple {39267#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {39267#true} is VALID [2018-11-23 12:00:18,967 INFO L273 TraceCheckUtils]: 6: Hoare triple {39267#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {39267#true} is VALID [2018-11-23 12:00:18,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {39267#true} ~i~0 := 2; {39269#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:18,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {39269#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39269#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:18,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {39269#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39269#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:18,969 INFO L273 TraceCheckUtils]: 10: Hoare triple {39269#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39270#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:18,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {39270#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39270#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:18,969 INFO L273 TraceCheckUtils]: 12: Hoare triple {39270#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39270#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:18,970 INFO L273 TraceCheckUtils]: 13: Hoare triple {39270#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39271#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:18,970 INFO L273 TraceCheckUtils]: 14: Hoare triple {39271#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39271#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:18,970 INFO L273 TraceCheckUtils]: 15: Hoare triple {39271#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39271#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:18,971 INFO L273 TraceCheckUtils]: 16: Hoare triple {39271#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39272#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:18,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {39272#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39272#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:18,972 INFO L273 TraceCheckUtils]: 18: Hoare triple {39272#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39272#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:18,972 INFO L273 TraceCheckUtils]: 19: Hoare triple {39272#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39273#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:18,973 INFO L273 TraceCheckUtils]: 20: Hoare triple {39273#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39273#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:18,973 INFO L273 TraceCheckUtils]: 21: Hoare triple {39273#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39273#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:18,974 INFO L273 TraceCheckUtils]: 22: Hoare triple {39273#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39274#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:18,974 INFO L273 TraceCheckUtils]: 23: Hoare triple {39274#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39274#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:18,975 INFO L273 TraceCheckUtils]: 24: Hoare triple {39274#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39274#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:18,976 INFO L273 TraceCheckUtils]: 25: Hoare triple {39274#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39275#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:18,976 INFO L273 TraceCheckUtils]: 26: Hoare triple {39275#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39275#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:18,977 INFO L273 TraceCheckUtils]: 27: Hoare triple {39275#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39275#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:18,977 INFO L273 TraceCheckUtils]: 28: Hoare triple {39275#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39276#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:18,978 INFO L273 TraceCheckUtils]: 29: Hoare triple {39276#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39276#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:18,978 INFO L273 TraceCheckUtils]: 30: Hoare triple {39276#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39276#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:18,979 INFO L273 TraceCheckUtils]: 31: Hoare triple {39276#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39277#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:18,980 INFO L273 TraceCheckUtils]: 32: Hoare triple {39277#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39277#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:18,980 INFO L273 TraceCheckUtils]: 33: Hoare triple {39277#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39277#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:18,981 INFO L273 TraceCheckUtils]: 34: Hoare triple {39277#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39278#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:18,981 INFO L273 TraceCheckUtils]: 35: Hoare triple {39278#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39278#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:18,982 INFO L273 TraceCheckUtils]: 36: Hoare triple {39278#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39278#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:18,983 INFO L273 TraceCheckUtils]: 37: Hoare triple {39278#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39279#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:18,983 INFO L273 TraceCheckUtils]: 38: Hoare triple {39279#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39279#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:18,984 INFO L273 TraceCheckUtils]: 39: Hoare triple {39279#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39279#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:18,984 INFO L273 TraceCheckUtils]: 40: Hoare triple {39279#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39280#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:18,985 INFO L273 TraceCheckUtils]: 41: Hoare triple {39280#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39280#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:18,985 INFO L273 TraceCheckUtils]: 42: Hoare triple {39280#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39280#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:18,986 INFO L273 TraceCheckUtils]: 43: Hoare triple {39280#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39281#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:18,986 INFO L273 TraceCheckUtils]: 44: Hoare triple {39281#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39281#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:18,987 INFO L273 TraceCheckUtils]: 45: Hoare triple {39281#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39281#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:18,988 INFO L273 TraceCheckUtils]: 46: Hoare triple {39281#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39282#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:18,988 INFO L273 TraceCheckUtils]: 47: Hoare triple {39282#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39282#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:18,989 INFO L273 TraceCheckUtils]: 48: Hoare triple {39282#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39282#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:18,989 INFO L273 TraceCheckUtils]: 49: Hoare triple {39282#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39283#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:18,990 INFO L273 TraceCheckUtils]: 50: Hoare triple {39283#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39283#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:18,990 INFO L273 TraceCheckUtils]: 51: Hoare triple {39283#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39283#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:18,991 INFO L273 TraceCheckUtils]: 52: Hoare triple {39283#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39284#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:18,992 INFO L273 TraceCheckUtils]: 53: Hoare triple {39284#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39284#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:18,992 INFO L273 TraceCheckUtils]: 54: Hoare triple {39284#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39284#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:18,993 INFO L273 TraceCheckUtils]: 55: Hoare triple {39284#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39285#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:18,993 INFO L273 TraceCheckUtils]: 56: Hoare triple {39285#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39285#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:18,994 INFO L273 TraceCheckUtils]: 57: Hoare triple {39285#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39285#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:18,995 INFO L273 TraceCheckUtils]: 58: Hoare triple {39285#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39286#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:18,995 INFO L273 TraceCheckUtils]: 59: Hoare triple {39286#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39286#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:18,996 INFO L273 TraceCheckUtils]: 60: Hoare triple {39286#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39286#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:18,996 INFO L273 TraceCheckUtils]: 61: Hoare triple {39286#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39287#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:18,997 INFO L273 TraceCheckUtils]: 62: Hoare triple {39287#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39287#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:18,997 INFO L273 TraceCheckUtils]: 63: Hoare triple {39287#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39287#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:18,998 INFO L273 TraceCheckUtils]: 64: Hoare triple {39287#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39288#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:18,999 INFO L273 TraceCheckUtils]: 65: Hoare triple {39288#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39288#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:18,999 INFO L273 TraceCheckUtils]: 66: Hoare triple {39288#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39288#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:19,000 INFO L273 TraceCheckUtils]: 67: Hoare triple {39288#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39289#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:19,000 INFO L273 TraceCheckUtils]: 68: Hoare triple {39289#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39289#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:19,001 INFO L273 TraceCheckUtils]: 69: Hoare triple {39289#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39289#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:19,001 INFO L273 TraceCheckUtils]: 70: Hoare triple {39289#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39290#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:19,002 INFO L273 TraceCheckUtils]: 71: Hoare triple {39290#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39290#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:19,002 INFO L273 TraceCheckUtils]: 72: Hoare triple {39290#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39290#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:19,003 INFO L273 TraceCheckUtils]: 73: Hoare triple {39290#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39291#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:19,004 INFO L273 TraceCheckUtils]: 74: Hoare triple {39291#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39291#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:19,004 INFO L273 TraceCheckUtils]: 75: Hoare triple {39291#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39291#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:19,005 INFO L273 TraceCheckUtils]: 76: Hoare triple {39291#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39292#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:19,005 INFO L273 TraceCheckUtils]: 77: Hoare triple {39292#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39292#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:19,006 INFO L273 TraceCheckUtils]: 78: Hoare triple {39292#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39292#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:19,007 INFO L273 TraceCheckUtils]: 79: Hoare triple {39292#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39293#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:19,007 INFO L273 TraceCheckUtils]: 80: Hoare triple {39293#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39293#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:19,008 INFO L273 TraceCheckUtils]: 81: Hoare triple {39293#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39293#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:19,008 INFO L273 TraceCheckUtils]: 82: Hoare triple {39293#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39294#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:19,009 INFO L273 TraceCheckUtils]: 83: Hoare triple {39294#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39294#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:19,009 INFO L273 TraceCheckUtils]: 84: Hoare triple {39294#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39294#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:19,010 INFO L273 TraceCheckUtils]: 85: Hoare triple {39294#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39295#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:19,011 INFO L273 TraceCheckUtils]: 86: Hoare triple {39295#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39295#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:19,011 INFO L273 TraceCheckUtils]: 87: Hoare triple {39295#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39295#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:19,012 INFO L273 TraceCheckUtils]: 88: Hoare triple {39295#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39296#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:19,012 INFO L273 TraceCheckUtils]: 89: Hoare triple {39296#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39296#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:19,013 INFO L273 TraceCheckUtils]: 90: Hoare triple {39296#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39296#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:19,013 INFO L273 TraceCheckUtils]: 91: Hoare triple {39296#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39297#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:19,014 INFO L273 TraceCheckUtils]: 92: Hoare triple {39297#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39297#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:19,014 INFO L273 TraceCheckUtils]: 93: Hoare triple {39297#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39297#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:19,015 INFO L273 TraceCheckUtils]: 94: Hoare triple {39297#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39298#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:19,016 INFO L273 TraceCheckUtils]: 95: Hoare triple {39298#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39298#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:19,016 INFO L273 TraceCheckUtils]: 96: Hoare triple {39298#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39298#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:19,017 INFO L273 TraceCheckUtils]: 97: Hoare triple {39298#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39299#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:19,017 INFO L273 TraceCheckUtils]: 98: Hoare triple {39299#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39299#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:19,018 INFO L273 TraceCheckUtils]: 99: Hoare triple {39299#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39299#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:19,019 INFO L273 TraceCheckUtils]: 100: Hoare triple {39299#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39300#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:19,019 INFO L273 TraceCheckUtils]: 101: Hoare triple {39300#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39300#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:19,020 INFO L273 TraceCheckUtils]: 102: Hoare triple {39300#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39300#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:19,020 INFO L273 TraceCheckUtils]: 103: Hoare triple {39300#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39301#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:19,021 INFO L273 TraceCheckUtils]: 104: Hoare triple {39301#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39301#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:19,021 INFO L273 TraceCheckUtils]: 105: Hoare triple {39301#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39301#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:19,022 INFO L273 TraceCheckUtils]: 106: Hoare triple {39301#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39302#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:19,023 INFO L273 TraceCheckUtils]: 107: Hoare triple {39302#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39302#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:19,023 INFO L273 TraceCheckUtils]: 108: Hoare triple {39302#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39302#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:19,024 INFO L273 TraceCheckUtils]: 109: Hoare triple {39302#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39303#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:19,024 INFO L273 TraceCheckUtils]: 110: Hoare triple {39303#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39303#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:19,025 INFO L273 TraceCheckUtils]: 111: Hoare triple {39303#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39303#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:19,026 INFO L273 TraceCheckUtils]: 112: Hoare triple {39303#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39304#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:19,026 INFO L273 TraceCheckUtils]: 113: Hoare triple {39304#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39304#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:19,027 INFO L273 TraceCheckUtils]: 114: Hoare triple {39304#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39304#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:19,027 INFO L273 TraceCheckUtils]: 115: Hoare triple {39304#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39305#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:19,028 INFO L273 TraceCheckUtils]: 116: Hoare triple {39305#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39305#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:19,028 INFO L273 TraceCheckUtils]: 117: Hoare triple {39305#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39305#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:19,029 INFO L273 TraceCheckUtils]: 118: Hoare triple {39305#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39306#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:19,029 INFO L273 TraceCheckUtils]: 119: Hoare triple {39306#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39306#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:19,030 INFO L273 TraceCheckUtils]: 120: Hoare triple {39306#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39306#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:19,031 INFO L273 TraceCheckUtils]: 121: Hoare triple {39306#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39307#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:19,031 INFO L273 TraceCheckUtils]: 122: Hoare triple {39307#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39307#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:19,032 INFO L273 TraceCheckUtils]: 123: Hoare triple {39307#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39307#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:19,032 INFO L273 TraceCheckUtils]: 124: Hoare triple {39307#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39308#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:19,033 INFO L273 TraceCheckUtils]: 125: Hoare triple {39308#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39308#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:19,033 INFO L273 TraceCheckUtils]: 126: Hoare triple {39308#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39308#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:19,034 INFO L273 TraceCheckUtils]: 127: Hoare triple {39308#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39309#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:19,035 INFO L273 TraceCheckUtils]: 128: Hoare triple {39309#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39309#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:19,035 INFO L273 TraceCheckUtils]: 129: Hoare triple {39309#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39309#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:19,036 INFO L273 TraceCheckUtils]: 130: Hoare triple {39309#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39310#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:19,036 INFO L273 TraceCheckUtils]: 131: Hoare triple {39310#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39310#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:19,037 INFO L273 TraceCheckUtils]: 132: Hoare triple {39310#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39310#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:19,038 INFO L273 TraceCheckUtils]: 133: Hoare triple {39310#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39311#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:19,038 INFO L273 TraceCheckUtils]: 134: Hoare triple {39311#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39311#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:19,039 INFO L273 TraceCheckUtils]: 135: Hoare triple {39311#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39311#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:19,039 INFO L273 TraceCheckUtils]: 136: Hoare triple {39311#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39312#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:19,040 INFO L273 TraceCheckUtils]: 137: Hoare triple {39312#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39312#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:19,040 INFO L273 TraceCheckUtils]: 138: Hoare triple {39312#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39312#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:19,041 INFO L273 TraceCheckUtils]: 139: Hoare triple {39312#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39313#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:19,042 INFO L273 TraceCheckUtils]: 140: Hoare triple {39313#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39313#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:19,042 INFO L273 TraceCheckUtils]: 141: Hoare triple {39313#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39313#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:19,043 INFO L273 TraceCheckUtils]: 142: Hoare triple {39313#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39314#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:19,043 INFO L273 TraceCheckUtils]: 143: Hoare triple {39314#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {39314#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:19,044 INFO L273 TraceCheckUtils]: 144: Hoare triple {39314#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {39314#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:19,044 INFO L273 TraceCheckUtils]: 145: Hoare triple {39314#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {39315#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:19,045 INFO L273 TraceCheckUtils]: 146: Hoare triple {39315#(<= main_~i~0 48)} assume !(~i~0 < 100000); {39268#false} is VALID [2018-11-23 12:00:19,045 INFO L273 TraceCheckUtils]: 147: Hoare triple {39268#false} havoc ~x~0;~x~0 := 0; {39268#false} is VALID [2018-11-23 12:00:19,045 INFO L273 TraceCheckUtils]: 148: Hoare triple {39268#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {39268#false} is VALID [2018-11-23 12:00:19,046 INFO L256 TraceCheckUtils]: 149: Hoare triple {39268#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {39268#false} is VALID [2018-11-23 12:00:19,046 INFO L273 TraceCheckUtils]: 150: Hoare triple {39268#false} ~cond := #in~cond; {39268#false} is VALID [2018-11-23 12:00:19,046 INFO L273 TraceCheckUtils]: 151: Hoare triple {39268#false} assume 0 == ~cond; {39268#false} is VALID [2018-11-23 12:00:19,046 INFO L273 TraceCheckUtils]: 152: Hoare triple {39268#false} assume !false; {39268#false} is VALID [2018-11-23 12:00:19,061 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:19,080 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:19,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 49 [2018-11-23 12:00:19,081 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 153 [2018-11-23 12:00:19,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:19,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states. [2018-11-23 12:00:19,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:19,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-11-23 12:00:19,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-11-23 12:00:19,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:00:19,231 INFO L87 Difference]: Start difference. First operand 210 states and 307 transitions. Second operand 49 states. [2018-11-23 12:00:20,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:20,591 INFO L93 Difference]: Finished difference Result 234 states and 339 transitions. [2018-11-23 12:00:20,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-11-23 12:00:20,591 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 153 [2018-11-23 12:00:20,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:20,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:00:20,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 339 transitions. [2018-11-23 12:00:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 12:00:20,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 339 transitions. [2018-11-23 12:00:20,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 49 states and 339 transitions. [2018-11-23 12:00:20,919 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 339 edges. 339 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:20,923 INFO L225 Difference]: With dead ends: 234 [2018-11-23 12:00:20,923 INFO L226 Difference]: Without dead ends: 217 [2018-11-23 12:00:20,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-11-23 12:00:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-23 12:00:20,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 214. [2018-11-23 12:00:20,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:20,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand 214 states. [2018-11-23 12:00:20,985 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 214 states. [2018-11-23 12:00:20,985 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 214 states. [2018-11-23 12:00:20,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:20,988 INFO L93 Difference]: Finished difference Result 217 states and 318 transitions. [2018-11-23 12:00:20,989 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 318 transitions. [2018-11-23 12:00:20,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:20,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:20,989 INFO L74 IsIncluded]: Start isIncluded. First operand 214 states. Second operand 217 states. [2018-11-23 12:00:20,989 INFO L87 Difference]: Start difference. First operand 214 states. Second operand 217 states. [2018-11-23 12:00:20,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:20,992 INFO L93 Difference]: Finished difference Result 217 states and 318 transitions. [2018-11-23 12:00:20,992 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 318 transitions. [2018-11-23 12:00:20,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:20,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:20,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:20,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:20,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214 states. [2018-11-23 12:00:20,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 313 transitions. [2018-11-23 12:00:20,996 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 313 transitions. Word has length 153 [2018-11-23 12:00:20,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:20,996 INFO L480 AbstractCegarLoop]: Abstraction has 214 states and 313 transitions. [2018-11-23 12:00:20,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-11-23 12:00:20,996 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 313 transitions. [2018-11-23 12:00:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-11-23 12:00:20,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:20,997 INFO L402 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:20,997 INFO L423 AbstractCegarLoop]: === Iteration 49 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:20,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:20,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1315368865, now seen corresponding path program 47 times [2018-11-23 12:00:20,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:20,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:20,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:20,999 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:20,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:21,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:22,162 INFO L256 TraceCheckUtils]: 0: Hoare triple {40775#true} call ULTIMATE.init(); {40775#true} is VALID [2018-11-23 12:00:22,162 INFO L273 TraceCheckUtils]: 1: Hoare triple {40775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40775#true} is VALID [2018-11-23 12:00:22,162 INFO L273 TraceCheckUtils]: 2: Hoare triple {40775#true} assume true; {40775#true} is VALID [2018-11-23 12:00:22,162 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40775#true} {40775#true} #88#return; {40775#true} is VALID [2018-11-23 12:00:22,162 INFO L256 TraceCheckUtils]: 4: Hoare triple {40775#true} call #t~ret13 := main(); {40775#true} is VALID [2018-11-23 12:00:22,162 INFO L273 TraceCheckUtils]: 5: Hoare triple {40775#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {40775#true} is VALID [2018-11-23 12:00:22,163 INFO L273 TraceCheckUtils]: 6: Hoare triple {40775#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {40775#true} is VALID [2018-11-23 12:00:22,163 INFO L273 TraceCheckUtils]: 7: Hoare triple {40775#true} ~i~0 := 2; {40777#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:22,163 INFO L273 TraceCheckUtils]: 8: Hoare triple {40777#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40777#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:22,164 INFO L273 TraceCheckUtils]: 9: Hoare triple {40777#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40777#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:22,165 INFO L273 TraceCheckUtils]: 10: Hoare triple {40777#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40778#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:22,165 INFO L273 TraceCheckUtils]: 11: Hoare triple {40778#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40778#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:22,166 INFO L273 TraceCheckUtils]: 12: Hoare triple {40778#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40778#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:22,166 INFO L273 TraceCheckUtils]: 13: Hoare triple {40778#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40779#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:22,167 INFO L273 TraceCheckUtils]: 14: Hoare triple {40779#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40779#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:22,167 INFO L273 TraceCheckUtils]: 15: Hoare triple {40779#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40779#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:22,168 INFO L273 TraceCheckUtils]: 16: Hoare triple {40779#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40780#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:22,169 INFO L273 TraceCheckUtils]: 17: Hoare triple {40780#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40780#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:22,169 INFO L273 TraceCheckUtils]: 18: Hoare triple {40780#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40780#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:22,170 INFO L273 TraceCheckUtils]: 19: Hoare triple {40780#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40781#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:22,170 INFO L273 TraceCheckUtils]: 20: Hoare triple {40781#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40781#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:22,171 INFO L273 TraceCheckUtils]: 21: Hoare triple {40781#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40781#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:22,171 INFO L273 TraceCheckUtils]: 22: Hoare triple {40781#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40782#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:22,172 INFO L273 TraceCheckUtils]: 23: Hoare triple {40782#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40782#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:22,173 INFO L273 TraceCheckUtils]: 24: Hoare triple {40782#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40782#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:22,173 INFO L273 TraceCheckUtils]: 25: Hoare triple {40782#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40783#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:22,174 INFO L273 TraceCheckUtils]: 26: Hoare triple {40783#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40783#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:22,174 INFO L273 TraceCheckUtils]: 27: Hoare triple {40783#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40783#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:22,175 INFO L273 TraceCheckUtils]: 28: Hoare triple {40783#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40784#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:22,175 INFO L273 TraceCheckUtils]: 29: Hoare triple {40784#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40784#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:22,176 INFO L273 TraceCheckUtils]: 30: Hoare triple {40784#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40784#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:22,177 INFO L273 TraceCheckUtils]: 31: Hoare triple {40784#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40785#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:22,177 INFO L273 TraceCheckUtils]: 32: Hoare triple {40785#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40785#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:22,178 INFO L273 TraceCheckUtils]: 33: Hoare triple {40785#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40785#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:22,178 INFO L273 TraceCheckUtils]: 34: Hoare triple {40785#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40786#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:22,179 INFO L273 TraceCheckUtils]: 35: Hoare triple {40786#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40786#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:22,179 INFO L273 TraceCheckUtils]: 36: Hoare triple {40786#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40786#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:22,180 INFO L273 TraceCheckUtils]: 37: Hoare triple {40786#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40787#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:22,181 INFO L273 TraceCheckUtils]: 38: Hoare triple {40787#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40787#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:22,181 INFO L273 TraceCheckUtils]: 39: Hoare triple {40787#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40787#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:22,182 INFO L273 TraceCheckUtils]: 40: Hoare triple {40787#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40788#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:22,182 INFO L273 TraceCheckUtils]: 41: Hoare triple {40788#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40788#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:22,183 INFO L273 TraceCheckUtils]: 42: Hoare triple {40788#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40788#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:22,184 INFO L273 TraceCheckUtils]: 43: Hoare triple {40788#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40789#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:22,184 INFO L273 TraceCheckUtils]: 44: Hoare triple {40789#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40789#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:22,185 INFO L273 TraceCheckUtils]: 45: Hoare triple {40789#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40789#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:22,185 INFO L273 TraceCheckUtils]: 46: Hoare triple {40789#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40790#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:22,186 INFO L273 TraceCheckUtils]: 47: Hoare triple {40790#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40790#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:22,186 INFO L273 TraceCheckUtils]: 48: Hoare triple {40790#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40790#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:22,187 INFO L273 TraceCheckUtils]: 49: Hoare triple {40790#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40791#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:22,187 INFO L273 TraceCheckUtils]: 50: Hoare triple {40791#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40791#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:22,188 INFO L273 TraceCheckUtils]: 51: Hoare triple {40791#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40791#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:22,189 INFO L273 TraceCheckUtils]: 52: Hoare triple {40791#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40792#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:22,189 INFO L273 TraceCheckUtils]: 53: Hoare triple {40792#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40792#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:22,190 INFO L273 TraceCheckUtils]: 54: Hoare triple {40792#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40792#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:22,190 INFO L273 TraceCheckUtils]: 55: Hoare triple {40792#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40793#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:22,191 INFO L273 TraceCheckUtils]: 56: Hoare triple {40793#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40793#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:22,191 INFO L273 TraceCheckUtils]: 57: Hoare triple {40793#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40793#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:22,192 INFO L273 TraceCheckUtils]: 58: Hoare triple {40793#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40794#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:22,193 INFO L273 TraceCheckUtils]: 59: Hoare triple {40794#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40794#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:22,193 INFO L273 TraceCheckUtils]: 60: Hoare triple {40794#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40794#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:22,194 INFO L273 TraceCheckUtils]: 61: Hoare triple {40794#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40795#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:22,194 INFO L273 TraceCheckUtils]: 62: Hoare triple {40795#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40795#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:22,195 INFO L273 TraceCheckUtils]: 63: Hoare triple {40795#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40795#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:22,195 INFO L273 TraceCheckUtils]: 64: Hoare triple {40795#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40796#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:22,196 INFO L273 TraceCheckUtils]: 65: Hoare triple {40796#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40796#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:22,197 INFO L273 TraceCheckUtils]: 66: Hoare triple {40796#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40796#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:22,197 INFO L273 TraceCheckUtils]: 67: Hoare triple {40796#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40797#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:22,198 INFO L273 TraceCheckUtils]: 68: Hoare triple {40797#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40797#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:22,198 INFO L273 TraceCheckUtils]: 69: Hoare triple {40797#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40797#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:22,199 INFO L273 TraceCheckUtils]: 70: Hoare triple {40797#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40798#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:22,199 INFO L273 TraceCheckUtils]: 71: Hoare triple {40798#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40798#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:22,200 INFO L273 TraceCheckUtils]: 72: Hoare triple {40798#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40798#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:22,201 INFO L273 TraceCheckUtils]: 73: Hoare triple {40798#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40799#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:22,201 INFO L273 TraceCheckUtils]: 74: Hoare triple {40799#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40799#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:22,202 INFO L273 TraceCheckUtils]: 75: Hoare triple {40799#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40799#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:22,202 INFO L273 TraceCheckUtils]: 76: Hoare triple {40799#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40800#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:22,203 INFO L273 TraceCheckUtils]: 77: Hoare triple {40800#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40800#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:22,203 INFO L273 TraceCheckUtils]: 78: Hoare triple {40800#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40800#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:22,204 INFO L273 TraceCheckUtils]: 79: Hoare triple {40800#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40801#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:22,205 INFO L273 TraceCheckUtils]: 80: Hoare triple {40801#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40801#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:22,205 INFO L273 TraceCheckUtils]: 81: Hoare triple {40801#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40801#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:22,206 INFO L273 TraceCheckUtils]: 82: Hoare triple {40801#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40802#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:22,206 INFO L273 TraceCheckUtils]: 83: Hoare triple {40802#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40802#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:22,207 INFO L273 TraceCheckUtils]: 84: Hoare triple {40802#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40802#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:22,208 INFO L273 TraceCheckUtils]: 85: Hoare triple {40802#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40803#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:22,208 INFO L273 TraceCheckUtils]: 86: Hoare triple {40803#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40803#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:22,209 INFO L273 TraceCheckUtils]: 87: Hoare triple {40803#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40803#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:22,209 INFO L273 TraceCheckUtils]: 88: Hoare triple {40803#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40804#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:22,210 INFO L273 TraceCheckUtils]: 89: Hoare triple {40804#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40804#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:22,210 INFO L273 TraceCheckUtils]: 90: Hoare triple {40804#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40804#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:22,211 INFO L273 TraceCheckUtils]: 91: Hoare triple {40804#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40805#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:22,211 INFO L273 TraceCheckUtils]: 92: Hoare triple {40805#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40805#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:22,212 INFO L273 TraceCheckUtils]: 93: Hoare triple {40805#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40805#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:22,213 INFO L273 TraceCheckUtils]: 94: Hoare triple {40805#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40806#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:22,213 INFO L273 TraceCheckUtils]: 95: Hoare triple {40806#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40806#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:22,214 INFO L273 TraceCheckUtils]: 96: Hoare triple {40806#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40806#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:22,214 INFO L273 TraceCheckUtils]: 97: Hoare triple {40806#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40807#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:22,215 INFO L273 TraceCheckUtils]: 98: Hoare triple {40807#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40807#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:22,215 INFO L273 TraceCheckUtils]: 99: Hoare triple {40807#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40807#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:22,216 INFO L273 TraceCheckUtils]: 100: Hoare triple {40807#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40808#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:22,217 INFO L273 TraceCheckUtils]: 101: Hoare triple {40808#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40808#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:22,217 INFO L273 TraceCheckUtils]: 102: Hoare triple {40808#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40808#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:22,218 INFO L273 TraceCheckUtils]: 103: Hoare triple {40808#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40809#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:22,218 INFO L273 TraceCheckUtils]: 104: Hoare triple {40809#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40809#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:22,219 INFO L273 TraceCheckUtils]: 105: Hoare triple {40809#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40809#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:22,220 INFO L273 TraceCheckUtils]: 106: Hoare triple {40809#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40810#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:22,220 INFO L273 TraceCheckUtils]: 107: Hoare triple {40810#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40810#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:22,221 INFO L273 TraceCheckUtils]: 108: Hoare triple {40810#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40810#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:22,221 INFO L273 TraceCheckUtils]: 109: Hoare triple {40810#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40811#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:22,222 INFO L273 TraceCheckUtils]: 110: Hoare triple {40811#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40811#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:22,222 INFO L273 TraceCheckUtils]: 111: Hoare triple {40811#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40811#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:22,223 INFO L273 TraceCheckUtils]: 112: Hoare triple {40811#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40812#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:22,224 INFO L273 TraceCheckUtils]: 113: Hoare triple {40812#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40812#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:22,224 INFO L273 TraceCheckUtils]: 114: Hoare triple {40812#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40812#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:22,225 INFO L273 TraceCheckUtils]: 115: Hoare triple {40812#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40813#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:22,225 INFO L273 TraceCheckUtils]: 116: Hoare triple {40813#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40813#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:22,226 INFO L273 TraceCheckUtils]: 117: Hoare triple {40813#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40813#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:22,226 INFO L273 TraceCheckUtils]: 118: Hoare triple {40813#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40814#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:22,227 INFO L273 TraceCheckUtils]: 119: Hoare triple {40814#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40814#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:22,227 INFO L273 TraceCheckUtils]: 120: Hoare triple {40814#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40814#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:22,228 INFO L273 TraceCheckUtils]: 121: Hoare triple {40814#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40815#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:22,229 INFO L273 TraceCheckUtils]: 122: Hoare triple {40815#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40815#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:22,229 INFO L273 TraceCheckUtils]: 123: Hoare triple {40815#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40815#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:22,230 INFO L273 TraceCheckUtils]: 124: Hoare triple {40815#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40816#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:22,230 INFO L273 TraceCheckUtils]: 125: Hoare triple {40816#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40816#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:22,231 INFO L273 TraceCheckUtils]: 126: Hoare triple {40816#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40816#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:22,232 INFO L273 TraceCheckUtils]: 127: Hoare triple {40816#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40817#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:22,232 INFO L273 TraceCheckUtils]: 128: Hoare triple {40817#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40817#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:22,233 INFO L273 TraceCheckUtils]: 129: Hoare triple {40817#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40817#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:22,233 INFO L273 TraceCheckUtils]: 130: Hoare triple {40817#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40818#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:22,234 INFO L273 TraceCheckUtils]: 131: Hoare triple {40818#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40818#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:22,234 INFO L273 TraceCheckUtils]: 132: Hoare triple {40818#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40818#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:22,235 INFO L273 TraceCheckUtils]: 133: Hoare triple {40818#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40819#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:22,236 INFO L273 TraceCheckUtils]: 134: Hoare triple {40819#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40819#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:22,236 INFO L273 TraceCheckUtils]: 135: Hoare triple {40819#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40819#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:22,237 INFO L273 TraceCheckUtils]: 136: Hoare triple {40819#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40820#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:22,237 INFO L273 TraceCheckUtils]: 137: Hoare triple {40820#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40820#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:22,238 INFO L273 TraceCheckUtils]: 138: Hoare triple {40820#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40820#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:22,238 INFO L273 TraceCheckUtils]: 139: Hoare triple {40820#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40821#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:22,239 INFO L273 TraceCheckUtils]: 140: Hoare triple {40821#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40821#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:22,239 INFO L273 TraceCheckUtils]: 141: Hoare triple {40821#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40821#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:22,240 INFO L273 TraceCheckUtils]: 142: Hoare triple {40821#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40822#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:22,241 INFO L273 TraceCheckUtils]: 143: Hoare triple {40822#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40822#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:22,241 INFO L273 TraceCheckUtils]: 144: Hoare triple {40822#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40822#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:22,242 INFO L273 TraceCheckUtils]: 145: Hoare triple {40822#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40823#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:22,242 INFO L273 TraceCheckUtils]: 146: Hoare triple {40823#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40823#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:22,243 INFO L273 TraceCheckUtils]: 147: Hoare triple {40823#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40823#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:22,244 INFO L273 TraceCheckUtils]: 148: Hoare triple {40823#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40824#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:22,244 INFO L273 TraceCheckUtils]: 149: Hoare triple {40824#(<= main_~i~0 49)} assume !(~i~0 < 100000); {40776#false} is VALID [2018-11-23 12:00:22,245 INFO L273 TraceCheckUtils]: 150: Hoare triple {40776#false} havoc ~x~0;~x~0 := 0; {40776#false} is VALID [2018-11-23 12:00:22,245 INFO L273 TraceCheckUtils]: 151: Hoare triple {40776#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {40776#false} is VALID [2018-11-23 12:00:22,245 INFO L256 TraceCheckUtils]: 152: Hoare triple {40776#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {40776#false} is VALID [2018-11-23 12:00:22,245 INFO L273 TraceCheckUtils]: 153: Hoare triple {40776#false} ~cond := #in~cond; {40776#false} is VALID [2018-11-23 12:00:22,245 INFO L273 TraceCheckUtils]: 154: Hoare triple {40776#false} assume 0 == ~cond; {40776#false} is VALID [2018-11-23 12:00:22,245 INFO L273 TraceCheckUtils]: 155: Hoare triple {40776#false} assume !false; {40776#false} is VALID [2018-11-23 12:00:22,261 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:22,261 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:22,261 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-23 12:00:22,277 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:00:22,674 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 48 check-sat command(s) [2018-11-23 12:00:22,675 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:22,725 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:23,250 INFO L256 TraceCheckUtils]: 0: Hoare triple {40775#true} call ULTIMATE.init(); {40775#true} is VALID [2018-11-23 12:00:23,250 INFO L273 TraceCheckUtils]: 1: Hoare triple {40775#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {40775#true} is VALID [2018-11-23 12:00:23,251 INFO L273 TraceCheckUtils]: 2: Hoare triple {40775#true} assume true; {40775#true} is VALID [2018-11-23 12:00:23,251 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {40775#true} {40775#true} #88#return; {40775#true} is VALID [2018-11-23 12:00:23,251 INFO L256 TraceCheckUtils]: 4: Hoare triple {40775#true} call #t~ret13 := main(); {40775#true} is VALID [2018-11-23 12:00:23,251 INFO L273 TraceCheckUtils]: 5: Hoare triple {40775#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {40775#true} is VALID [2018-11-23 12:00:23,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {40775#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {40775#true} is VALID [2018-11-23 12:00:23,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {40775#true} ~i~0 := 2; {40777#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:23,252 INFO L273 TraceCheckUtils]: 8: Hoare triple {40777#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40777#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:23,253 INFO L273 TraceCheckUtils]: 9: Hoare triple {40777#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40777#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:23,253 INFO L273 TraceCheckUtils]: 10: Hoare triple {40777#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40778#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:23,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {40778#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40778#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:23,254 INFO L273 TraceCheckUtils]: 12: Hoare triple {40778#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40778#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:23,254 INFO L273 TraceCheckUtils]: 13: Hoare triple {40778#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40779#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:23,255 INFO L273 TraceCheckUtils]: 14: Hoare triple {40779#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40779#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:23,255 INFO L273 TraceCheckUtils]: 15: Hoare triple {40779#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40779#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:23,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {40779#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40780#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:23,256 INFO L273 TraceCheckUtils]: 17: Hoare triple {40780#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40780#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:23,257 INFO L273 TraceCheckUtils]: 18: Hoare triple {40780#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40780#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:23,257 INFO L273 TraceCheckUtils]: 19: Hoare triple {40780#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40781#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:23,258 INFO L273 TraceCheckUtils]: 20: Hoare triple {40781#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40781#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:23,258 INFO L273 TraceCheckUtils]: 21: Hoare triple {40781#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40781#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:23,259 INFO L273 TraceCheckUtils]: 22: Hoare triple {40781#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40782#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:23,260 INFO L273 TraceCheckUtils]: 23: Hoare triple {40782#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40782#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:23,260 INFO L273 TraceCheckUtils]: 24: Hoare triple {40782#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40782#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:23,261 INFO L273 TraceCheckUtils]: 25: Hoare triple {40782#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40783#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:23,261 INFO L273 TraceCheckUtils]: 26: Hoare triple {40783#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40783#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:23,262 INFO L273 TraceCheckUtils]: 27: Hoare triple {40783#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40783#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:23,263 INFO L273 TraceCheckUtils]: 28: Hoare triple {40783#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40784#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:23,263 INFO L273 TraceCheckUtils]: 29: Hoare triple {40784#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40784#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:23,264 INFO L273 TraceCheckUtils]: 30: Hoare triple {40784#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40784#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:23,264 INFO L273 TraceCheckUtils]: 31: Hoare triple {40784#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40785#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:23,265 INFO L273 TraceCheckUtils]: 32: Hoare triple {40785#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40785#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:23,265 INFO L273 TraceCheckUtils]: 33: Hoare triple {40785#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40785#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:23,266 INFO L273 TraceCheckUtils]: 34: Hoare triple {40785#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40786#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:23,267 INFO L273 TraceCheckUtils]: 35: Hoare triple {40786#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40786#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:23,267 INFO L273 TraceCheckUtils]: 36: Hoare triple {40786#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40786#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:23,268 INFO L273 TraceCheckUtils]: 37: Hoare triple {40786#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40787#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:23,268 INFO L273 TraceCheckUtils]: 38: Hoare triple {40787#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40787#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:23,269 INFO L273 TraceCheckUtils]: 39: Hoare triple {40787#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40787#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:23,269 INFO L273 TraceCheckUtils]: 40: Hoare triple {40787#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40788#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:23,270 INFO L273 TraceCheckUtils]: 41: Hoare triple {40788#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40788#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:23,270 INFO L273 TraceCheckUtils]: 42: Hoare triple {40788#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40788#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:23,271 INFO L273 TraceCheckUtils]: 43: Hoare triple {40788#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40789#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:23,272 INFO L273 TraceCheckUtils]: 44: Hoare triple {40789#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40789#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:23,272 INFO L273 TraceCheckUtils]: 45: Hoare triple {40789#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40789#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:23,273 INFO L273 TraceCheckUtils]: 46: Hoare triple {40789#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40790#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:23,273 INFO L273 TraceCheckUtils]: 47: Hoare triple {40790#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40790#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:23,274 INFO L273 TraceCheckUtils]: 48: Hoare triple {40790#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40790#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:23,275 INFO L273 TraceCheckUtils]: 49: Hoare triple {40790#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40791#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:23,275 INFO L273 TraceCheckUtils]: 50: Hoare triple {40791#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40791#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:23,276 INFO L273 TraceCheckUtils]: 51: Hoare triple {40791#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40791#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:23,276 INFO L273 TraceCheckUtils]: 52: Hoare triple {40791#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40792#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:23,277 INFO L273 TraceCheckUtils]: 53: Hoare triple {40792#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40792#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:23,277 INFO L273 TraceCheckUtils]: 54: Hoare triple {40792#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40792#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:23,278 INFO L273 TraceCheckUtils]: 55: Hoare triple {40792#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40793#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:23,279 INFO L273 TraceCheckUtils]: 56: Hoare triple {40793#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40793#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:23,279 INFO L273 TraceCheckUtils]: 57: Hoare triple {40793#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40793#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:23,280 INFO L273 TraceCheckUtils]: 58: Hoare triple {40793#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40794#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:23,280 INFO L273 TraceCheckUtils]: 59: Hoare triple {40794#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40794#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:23,281 INFO L273 TraceCheckUtils]: 60: Hoare triple {40794#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40794#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:23,281 INFO L273 TraceCheckUtils]: 61: Hoare triple {40794#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40795#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:23,282 INFO L273 TraceCheckUtils]: 62: Hoare triple {40795#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40795#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:23,282 INFO L273 TraceCheckUtils]: 63: Hoare triple {40795#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40795#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:23,283 INFO L273 TraceCheckUtils]: 64: Hoare triple {40795#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40796#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:23,284 INFO L273 TraceCheckUtils]: 65: Hoare triple {40796#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40796#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:23,284 INFO L273 TraceCheckUtils]: 66: Hoare triple {40796#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40796#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:23,285 INFO L273 TraceCheckUtils]: 67: Hoare triple {40796#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40797#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:23,285 INFO L273 TraceCheckUtils]: 68: Hoare triple {40797#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40797#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:23,286 INFO L273 TraceCheckUtils]: 69: Hoare triple {40797#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40797#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:23,287 INFO L273 TraceCheckUtils]: 70: Hoare triple {40797#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40798#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:23,287 INFO L273 TraceCheckUtils]: 71: Hoare triple {40798#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40798#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:23,288 INFO L273 TraceCheckUtils]: 72: Hoare triple {40798#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40798#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:23,288 INFO L273 TraceCheckUtils]: 73: Hoare triple {40798#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40799#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:23,289 INFO L273 TraceCheckUtils]: 74: Hoare triple {40799#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40799#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:23,289 INFO L273 TraceCheckUtils]: 75: Hoare triple {40799#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40799#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:23,290 INFO L273 TraceCheckUtils]: 76: Hoare triple {40799#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40800#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:23,291 INFO L273 TraceCheckUtils]: 77: Hoare triple {40800#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40800#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:23,291 INFO L273 TraceCheckUtils]: 78: Hoare triple {40800#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40800#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:23,292 INFO L273 TraceCheckUtils]: 79: Hoare triple {40800#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40801#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:23,292 INFO L273 TraceCheckUtils]: 80: Hoare triple {40801#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40801#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:23,293 INFO L273 TraceCheckUtils]: 81: Hoare triple {40801#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40801#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:23,293 INFO L273 TraceCheckUtils]: 82: Hoare triple {40801#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40802#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:23,294 INFO L273 TraceCheckUtils]: 83: Hoare triple {40802#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40802#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:23,294 INFO L273 TraceCheckUtils]: 84: Hoare triple {40802#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40802#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:23,295 INFO L273 TraceCheckUtils]: 85: Hoare triple {40802#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40803#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:23,296 INFO L273 TraceCheckUtils]: 86: Hoare triple {40803#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40803#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:23,296 INFO L273 TraceCheckUtils]: 87: Hoare triple {40803#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40803#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:23,297 INFO L273 TraceCheckUtils]: 88: Hoare triple {40803#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40804#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:23,297 INFO L273 TraceCheckUtils]: 89: Hoare triple {40804#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40804#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:23,298 INFO L273 TraceCheckUtils]: 90: Hoare triple {40804#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40804#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:23,299 INFO L273 TraceCheckUtils]: 91: Hoare triple {40804#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40805#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:23,299 INFO L273 TraceCheckUtils]: 92: Hoare triple {40805#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40805#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:23,300 INFO L273 TraceCheckUtils]: 93: Hoare triple {40805#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40805#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:23,300 INFO L273 TraceCheckUtils]: 94: Hoare triple {40805#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40806#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:23,301 INFO L273 TraceCheckUtils]: 95: Hoare triple {40806#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40806#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:23,301 INFO L273 TraceCheckUtils]: 96: Hoare triple {40806#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40806#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:23,302 INFO L273 TraceCheckUtils]: 97: Hoare triple {40806#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40807#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:23,303 INFO L273 TraceCheckUtils]: 98: Hoare triple {40807#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40807#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:23,303 INFO L273 TraceCheckUtils]: 99: Hoare triple {40807#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40807#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:23,304 INFO L273 TraceCheckUtils]: 100: Hoare triple {40807#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40808#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:23,304 INFO L273 TraceCheckUtils]: 101: Hoare triple {40808#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40808#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:23,305 INFO L273 TraceCheckUtils]: 102: Hoare triple {40808#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40808#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:23,305 INFO L273 TraceCheckUtils]: 103: Hoare triple {40808#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40809#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:23,306 INFO L273 TraceCheckUtils]: 104: Hoare triple {40809#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40809#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:23,306 INFO L273 TraceCheckUtils]: 105: Hoare triple {40809#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40809#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:23,307 INFO L273 TraceCheckUtils]: 106: Hoare triple {40809#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40810#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:23,308 INFO L273 TraceCheckUtils]: 107: Hoare triple {40810#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40810#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:23,308 INFO L273 TraceCheckUtils]: 108: Hoare triple {40810#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40810#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:23,309 INFO L273 TraceCheckUtils]: 109: Hoare triple {40810#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40811#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:23,309 INFO L273 TraceCheckUtils]: 110: Hoare triple {40811#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40811#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:23,310 INFO L273 TraceCheckUtils]: 111: Hoare triple {40811#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40811#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:23,311 INFO L273 TraceCheckUtils]: 112: Hoare triple {40811#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40812#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:23,311 INFO L273 TraceCheckUtils]: 113: Hoare triple {40812#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40812#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:23,312 INFO L273 TraceCheckUtils]: 114: Hoare triple {40812#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40812#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:23,312 INFO L273 TraceCheckUtils]: 115: Hoare triple {40812#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40813#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:23,313 INFO L273 TraceCheckUtils]: 116: Hoare triple {40813#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40813#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:23,313 INFO L273 TraceCheckUtils]: 117: Hoare triple {40813#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40813#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:23,314 INFO L273 TraceCheckUtils]: 118: Hoare triple {40813#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40814#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:23,315 INFO L273 TraceCheckUtils]: 119: Hoare triple {40814#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40814#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:23,315 INFO L273 TraceCheckUtils]: 120: Hoare triple {40814#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40814#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:23,316 INFO L273 TraceCheckUtils]: 121: Hoare triple {40814#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40815#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:23,316 INFO L273 TraceCheckUtils]: 122: Hoare triple {40815#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40815#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:23,317 INFO L273 TraceCheckUtils]: 123: Hoare triple {40815#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40815#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:23,317 INFO L273 TraceCheckUtils]: 124: Hoare triple {40815#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40816#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:23,318 INFO L273 TraceCheckUtils]: 125: Hoare triple {40816#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40816#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:23,318 INFO L273 TraceCheckUtils]: 126: Hoare triple {40816#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40816#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:23,319 INFO L273 TraceCheckUtils]: 127: Hoare triple {40816#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40817#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:23,320 INFO L273 TraceCheckUtils]: 128: Hoare triple {40817#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40817#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:23,320 INFO L273 TraceCheckUtils]: 129: Hoare triple {40817#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40817#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:23,321 INFO L273 TraceCheckUtils]: 130: Hoare triple {40817#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40818#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:23,321 INFO L273 TraceCheckUtils]: 131: Hoare triple {40818#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40818#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:23,322 INFO L273 TraceCheckUtils]: 132: Hoare triple {40818#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40818#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:23,323 INFO L273 TraceCheckUtils]: 133: Hoare triple {40818#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40819#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:23,323 INFO L273 TraceCheckUtils]: 134: Hoare triple {40819#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40819#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:23,324 INFO L273 TraceCheckUtils]: 135: Hoare triple {40819#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40819#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:23,324 INFO L273 TraceCheckUtils]: 136: Hoare triple {40819#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40820#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:23,325 INFO L273 TraceCheckUtils]: 137: Hoare triple {40820#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40820#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:23,325 INFO L273 TraceCheckUtils]: 138: Hoare triple {40820#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40820#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:23,326 INFO L273 TraceCheckUtils]: 139: Hoare triple {40820#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40821#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:23,327 INFO L273 TraceCheckUtils]: 140: Hoare triple {40821#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40821#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:23,327 INFO L273 TraceCheckUtils]: 141: Hoare triple {40821#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40821#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:23,328 INFO L273 TraceCheckUtils]: 142: Hoare triple {40821#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40822#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:23,328 INFO L273 TraceCheckUtils]: 143: Hoare triple {40822#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40822#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:23,329 INFO L273 TraceCheckUtils]: 144: Hoare triple {40822#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40822#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:23,329 INFO L273 TraceCheckUtils]: 145: Hoare triple {40822#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40823#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:23,330 INFO L273 TraceCheckUtils]: 146: Hoare triple {40823#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {40823#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:23,330 INFO L273 TraceCheckUtils]: 147: Hoare triple {40823#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {40823#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:23,331 INFO L273 TraceCheckUtils]: 148: Hoare triple {40823#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {40824#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:23,332 INFO L273 TraceCheckUtils]: 149: Hoare triple {40824#(<= main_~i~0 49)} assume !(~i~0 < 100000); {40776#false} is VALID [2018-11-23 12:00:23,332 INFO L273 TraceCheckUtils]: 150: Hoare triple {40776#false} havoc ~x~0;~x~0 := 0; {40776#false} is VALID [2018-11-23 12:00:23,332 INFO L273 TraceCheckUtils]: 151: Hoare triple {40776#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {40776#false} is VALID [2018-11-23 12:00:23,332 INFO L256 TraceCheckUtils]: 152: Hoare triple {40776#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {40776#false} is VALID [2018-11-23 12:00:23,333 INFO L273 TraceCheckUtils]: 153: Hoare triple {40776#false} ~cond := #in~cond; {40776#false} is VALID [2018-11-23 12:00:23,333 INFO L273 TraceCheckUtils]: 154: Hoare triple {40776#false} assume 0 == ~cond; {40776#false} is VALID [2018-11-23 12:00:23,333 INFO L273 TraceCheckUtils]: 155: Hoare triple {40776#false} assume !false; {40776#false} is VALID [2018-11-23 12:00:23,365 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:23,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:23,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 50 [2018-11-23 12:00:23,384 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 156 [2018-11-23 12:00:23,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:23,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 12:00:23,543 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-23 12:00:23,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 12:00:23,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 12:00:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:00:23,544 INFO L87 Difference]: Start difference. First operand 214 states and 313 transitions. Second operand 50 states. [2018-11-23 12:00:25,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:25,450 INFO L93 Difference]: Finished difference Result 238 states and 345 transitions. [2018-11-23 12:00:25,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-11-23 12:00:25,450 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 156 [2018-11-23 12:00:25,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:25,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:00:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 345 transitions. [2018-11-23 12:00:25,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 12:00:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 345 transitions. [2018-11-23 12:00:25,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states and 345 transitions. [2018-11-23 12:00:25,782 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 345 edges. 345 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:25,788 INFO L225 Difference]: With dead ends: 238 [2018-11-23 12:00:25,788 INFO L226 Difference]: Without dead ends: 221 [2018-11-23 12:00:25,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 12:00:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-11-23 12:00:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-11-23 12:00:25,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:25,829 INFO L82 GeneralOperation]: Start isEquivalent. First operand 221 states. Second operand 218 states. [2018-11-23 12:00:25,829 INFO L74 IsIncluded]: Start isIncluded. First operand 221 states. Second operand 218 states. [2018-11-23 12:00:25,829 INFO L87 Difference]: Start difference. First operand 221 states. Second operand 218 states. [2018-11-23 12:00:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:25,834 INFO L93 Difference]: Finished difference Result 221 states and 324 transitions. [2018-11-23 12:00:25,834 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 324 transitions. [2018-11-23 12:00:25,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:25,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:25,835 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 221 states. [2018-11-23 12:00:25,835 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 221 states. [2018-11-23 12:00:25,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:25,838 INFO L93 Difference]: Finished difference Result 221 states and 324 transitions. [2018-11-23 12:00:25,838 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 324 transitions. [2018-11-23 12:00:25,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:25,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:25,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:25,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:25,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-23 12:00:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 319 transitions. [2018-11-23 12:00:25,842 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 319 transitions. Word has length 156 [2018-11-23 12:00:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:25,842 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 319 transitions. [2018-11-23 12:00:25,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 12:00:25,842 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 319 transitions. [2018-11-23 12:00:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-11-23 12:00:25,843 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:25,843 INFO L402 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:25,843 INFO L423 AbstractCegarLoop]: === Iteration 50 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:25,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:25,843 INFO L82 PathProgramCache]: Analyzing trace with hash -477969572, now seen corresponding path program 48 times [2018-11-23 12:00:25,843 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:25,843 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:25,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:25,844 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:25,844 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:27,372 INFO L256 TraceCheckUtils]: 0: Hoare triple {42311#true} call ULTIMATE.init(); {42311#true} is VALID [2018-11-23 12:00:27,372 INFO L273 TraceCheckUtils]: 1: Hoare triple {42311#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42311#true} is VALID [2018-11-23 12:00:27,373 INFO L273 TraceCheckUtils]: 2: Hoare triple {42311#true} assume true; {42311#true} is VALID [2018-11-23 12:00:27,373 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42311#true} {42311#true} #88#return; {42311#true} is VALID [2018-11-23 12:00:27,373 INFO L256 TraceCheckUtils]: 4: Hoare triple {42311#true} call #t~ret13 := main(); {42311#true} is VALID [2018-11-23 12:00:27,373 INFO L273 TraceCheckUtils]: 5: Hoare triple {42311#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {42311#true} is VALID [2018-11-23 12:00:27,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {42311#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {42311#true} is VALID [2018-11-23 12:00:27,374 INFO L273 TraceCheckUtils]: 7: Hoare triple {42311#true} ~i~0 := 2; {42313#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:27,375 INFO L273 TraceCheckUtils]: 8: Hoare triple {42313#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42313#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:27,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {42313#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42313#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:27,376 INFO L273 TraceCheckUtils]: 10: Hoare triple {42313#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42314#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:27,376 INFO L273 TraceCheckUtils]: 11: Hoare triple {42314#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42314#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:27,376 INFO L273 TraceCheckUtils]: 12: Hoare triple {42314#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42314#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:27,377 INFO L273 TraceCheckUtils]: 13: Hoare triple {42314#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42315#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:27,377 INFO L273 TraceCheckUtils]: 14: Hoare triple {42315#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42315#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:27,377 INFO L273 TraceCheckUtils]: 15: Hoare triple {42315#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42315#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:27,378 INFO L273 TraceCheckUtils]: 16: Hoare triple {42315#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42316#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:27,379 INFO L273 TraceCheckUtils]: 17: Hoare triple {42316#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42316#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:27,379 INFO L273 TraceCheckUtils]: 18: Hoare triple {42316#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42316#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:27,380 INFO L273 TraceCheckUtils]: 19: Hoare triple {42316#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42317#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:27,380 INFO L273 TraceCheckUtils]: 20: Hoare triple {42317#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42317#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:27,381 INFO L273 TraceCheckUtils]: 21: Hoare triple {42317#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42317#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:27,381 INFO L273 TraceCheckUtils]: 22: Hoare triple {42317#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42318#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:27,382 INFO L273 TraceCheckUtils]: 23: Hoare triple {42318#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42318#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:27,382 INFO L273 TraceCheckUtils]: 24: Hoare triple {42318#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42318#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:27,383 INFO L273 TraceCheckUtils]: 25: Hoare triple {42318#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42319#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:27,384 INFO L273 TraceCheckUtils]: 26: Hoare triple {42319#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42319#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:27,384 INFO L273 TraceCheckUtils]: 27: Hoare triple {42319#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42319#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:27,385 INFO L273 TraceCheckUtils]: 28: Hoare triple {42319#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42320#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:27,385 INFO L273 TraceCheckUtils]: 29: Hoare triple {42320#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42320#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:27,386 INFO L273 TraceCheckUtils]: 30: Hoare triple {42320#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42320#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:27,387 INFO L273 TraceCheckUtils]: 31: Hoare triple {42320#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42321#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:27,387 INFO L273 TraceCheckUtils]: 32: Hoare triple {42321#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42321#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:27,388 INFO L273 TraceCheckUtils]: 33: Hoare triple {42321#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42321#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:27,388 INFO L273 TraceCheckUtils]: 34: Hoare triple {42321#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42322#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:27,389 INFO L273 TraceCheckUtils]: 35: Hoare triple {42322#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42322#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:27,389 INFO L273 TraceCheckUtils]: 36: Hoare triple {42322#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42322#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:27,390 INFO L273 TraceCheckUtils]: 37: Hoare triple {42322#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42323#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:27,391 INFO L273 TraceCheckUtils]: 38: Hoare triple {42323#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42323#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:27,391 INFO L273 TraceCheckUtils]: 39: Hoare triple {42323#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42323#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:27,392 INFO L273 TraceCheckUtils]: 40: Hoare triple {42323#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42324#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:27,392 INFO L273 TraceCheckUtils]: 41: Hoare triple {42324#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42324#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:27,393 INFO L273 TraceCheckUtils]: 42: Hoare triple {42324#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42324#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:27,393 INFO L273 TraceCheckUtils]: 43: Hoare triple {42324#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42325#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:27,394 INFO L273 TraceCheckUtils]: 44: Hoare triple {42325#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42325#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:27,394 INFO L273 TraceCheckUtils]: 45: Hoare triple {42325#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42325#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:27,395 INFO L273 TraceCheckUtils]: 46: Hoare triple {42325#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42326#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:27,396 INFO L273 TraceCheckUtils]: 47: Hoare triple {42326#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42326#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:27,396 INFO L273 TraceCheckUtils]: 48: Hoare triple {42326#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42326#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:27,397 INFO L273 TraceCheckUtils]: 49: Hoare triple {42326#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42327#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:27,397 INFO L273 TraceCheckUtils]: 50: Hoare triple {42327#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42327#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:27,398 INFO L273 TraceCheckUtils]: 51: Hoare triple {42327#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42327#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:27,399 INFO L273 TraceCheckUtils]: 52: Hoare triple {42327#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42328#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:27,399 INFO L273 TraceCheckUtils]: 53: Hoare triple {42328#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42328#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:27,400 INFO L273 TraceCheckUtils]: 54: Hoare triple {42328#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42328#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:27,400 INFO L273 TraceCheckUtils]: 55: Hoare triple {42328#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42329#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:27,401 INFO L273 TraceCheckUtils]: 56: Hoare triple {42329#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42329#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:27,401 INFO L273 TraceCheckUtils]: 57: Hoare triple {42329#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42329#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:27,402 INFO L273 TraceCheckUtils]: 58: Hoare triple {42329#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42330#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:27,403 INFO L273 TraceCheckUtils]: 59: Hoare triple {42330#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42330#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:27,403 INFO L273 TraceCheckUtils]: 60: Hoare triple {42330#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42330#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:27,404 INFO L273 TraceCheckUtils]: 61: Hoare triple {42330#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42331#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:27,404 INFO L273 TraceCheckUtils]: 62: Hoare triple {42331#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42331#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:27,405 INFO L273 TraceCheckUtils]: 63: Hoare triple {42331#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42331#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:27,406 INFO L273 TraceCheckUtils]: 64: Hoare triple {42331#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42332#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:27,406 INFO L273 TraceCheckUtils]: 65: Hoare triple {42332#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42332#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:27,407 INFO L273 TraceCheckUtils]: 66: Hoare triple {42332#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42332#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:27,407 INFO L273 TraceCheckUtils]: 67: Hoare triple {42332#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42333#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:27,408 INFO L273 TraceCheckUtils]: 68: Hoare triple {42333#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42333#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:27,408 INFO L273 TraceCheckUtils]: 69: Hoare triple {42333#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42333#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:27,409 INFO L273 TraceCheckUtils]: 70: Hoare triple {42333#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42334#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:27,409 INFO L273 TraceCheckUtils]: 71: Hoare triple {42334#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42334#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:27,410 INFO L273 TraceCheckUtils]: 72: Hoare triple {42334#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42334#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:27,411 INFO L273 TraceCheckUtils]: 73: Hoare triple {42334#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42335#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:27,411 INFO L273 TraceCheckUtils]: 74: Hoare triple {42335#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42335#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:27,412 INFO L273 TraceCheckUtils]: 75: Hoare triple {42335#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42335#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:27,412 INFO L273 TraceCheckUtils]: 76: Hoare triple {42335#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42336#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:27,413 INFO L273 TraceCheckUtils]: 77: Hoare triple {42336#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42336#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:27,413 INFO L273 TraceCheckUtils]: 78: Hoare triple {42336#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42336#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:27,414 INFO L273 TraceCheckUtils]: 79: Hoare triple {42336#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42337#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:27,415 INFO L273 TraceCheckUtils]: 80: Hoare triple {42337#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42337#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:27,415 INFO L273 TraceCheckUtils]: 81: Hoare triple {42337#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42337#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:27,416 INFO L273 TraceCheckUtils]: 82: Hoare triple {42337#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42338#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:27,416 INFO L273 TraceCheckUtils]: 83: Hoare triple {42338#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42338#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:27,417 INFO L273 TraceCheckUtils]: 84: Hoare triple {42338#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42338#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:27,418 INFO L273 TraceCheckUtils]: 85: Hoare triple {42338#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42339#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:27,418 INFO L273 TraceCheckUtils]: 86: Hoare triple {42339#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42339#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:27,419 INFO L273 TraceCheckUtils]: 87: Hoare triple {42339#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42339#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:27,419 INFO L273 TraceCheckUtils]: 88: Hoare triple {42339#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42340#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:27,420 INFO L273 TraceCheckUtils]: 89: Hoare triple {42340#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42340#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:27,420 INFO L273 TraceCheckUtils]: 90: Hoare triple {42340#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42340#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:27,421 INFO L273 TraceCheckUtils]: 91: Hoare triple {42340#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42341#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:27,421 INFO L273 TraceCheckUtils]: 92: Hoare triple {42341#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42341#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:27,422 INFO L273 TraceCheckUtils]: 93: Hoare triple {42341#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42341#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:27,423 INFO L273 TraceCheckUtils]: 94: Hoare triple {42341#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42342#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:27,423 INFO L273 TraceCheckUtils]: 95: Hoare triple {42342#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42342#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:27,424 INFO L273 TraceCheckUtils]: 96: Hoare triple {42342#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42342#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:27,424 INFO L273 TraceCheckUtils]: 97: Hoare triple {42342#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42343#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:27,425 INFO L273 TraceCheckUtils]: 98: Hoare triple {42343#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42343#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:27,425 INFO L273 TraceCheckUtils]: 99: Hoare triple {42343#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42343#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:27,426 INFO L273 TraceCheckUtils]: 100: Hoare triple {42343#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42344#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:27,427 INFO L273 TraceCheckUtils]: 101: Hoare triple {42344#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42344#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:27,427 INFO L273 TraceCheckUtils]: 102: Hoare triple {42344#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42344#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:27,428 INFO L273 TraceCheckUtils]: 103: Hoare triple {42344#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42345#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:27,428 INFO L273 TraceCheckUtils]: 104: Hoare triple {42345#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42345#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:27,429 INFO L273 TraceCheckUtils]: 105: Hoare triple {42345#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42345#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:27,430 INFO L273 TraceCheckUtils]: 106: Hoare triple {42345#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42346#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:27,430 INFO L273 TraceCheckUtils]: 107: Hoare triple {42346#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42346#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:27,431 INFO L273 TraceCheckUtils]: 108: Hoare triple {42346#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42346#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:27,431 INFO L273 TraceCheckUtils]: 109: Hoare triple {42346#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42347#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:27,432 INFO L273 TraceCheckUtils]: 110: Hoare triple {42347#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42347#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:27,432 INFO L273 TraceCheckUtils]: 111: Hoare triple {42347#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42347#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:27,433 INFO L273 TraceCheckUtils]: 112: Hoare triple {42347#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42348#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:27,434 INFO L273 TraceCheckUtils]: 113: Hoare triple {42348#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42348#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:27,434 INFO L273 TraceCheckUtils]: 114: Hoare triple {42348#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42348#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:27,435 INFO L273 TraceCheckUtils]: 115: Hoare triple {42348#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42349#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:27,435 INFO L273 TraceCheckUtils]: 116: Hoare triple {42349#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42349#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:27,436 INFO L273 TraceCheckUtils]: 117: Hoare triple {42349#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42349#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:27,437 INFO L273 TraceCheckUtils]: 118: Hoare triple {42349#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42350#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:27,437 INFO L273 TraceCheckUtils]: 119: Hoare triple {42350#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42350#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:27,438 INFO L273 TraceCheckUtils]: 120: Hoare triple {42350#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42350#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:27,438 INFO L273 TraceCheckUtils]: 121: Hoare triple {42350#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42351#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:27,439 INFO L273 TraceCheckUtils]: 122: Hoare triple {42351#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42351#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:27,439 INFO L273 TraceCheckUtils]: 123: Hoare triple {42351#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42351#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:27,440 INFO L273 TraceCheckUtils]: 124: Hoare triple {42351#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42352#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:27,440 INFO L273 TraceCheckUtils]: 125: Hoare triple {42352#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42352#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:27,441 INFO L273 TraceCheckUtils]: 126: Hoare triple {42352#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42352#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:27,442 INFO L273 TraceCheckUtils]: 127: Hoare triple {42352#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42353#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:27,442 INFO L273 TraceCheckUtils]: 128: Hoare triple {42353#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42353#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:27,443 INFO L273 TraceCheckUtils]: 129: Hoare triple {42353#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42353#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:27,443 INFO L273 TraceCheckUtils]: 130: Hoare triple {42353#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42354#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:27,444 INFO L273 TraceCheckUtils]: 131: Hoare triple {42354#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42354#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:27,444 INFO L273 TraceCheckUtils]: 132: Hoare triple {42354#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42354#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:27,445 INFO L273 TraceCheckUtils]: 133: Hoare triple {42354#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42355#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:27,446 INFO L273 TraceCheckUtils]: 134: Hoare triple {42355#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42355#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:27,446 INFO L273 TraceCheckUtils]: 135: Hoare triple {42355#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42355#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:27,447 INFO L273 TraceCheckUtils]: 136: Hoare triple {42355#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42356#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:27,447 INFO L273 TraceCheckUtils]: 137: Hoare triple {42356#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42356#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:27,448 INFO L273 TraceCheckUtils]: 138: Hoare triple {42356#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42356#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:27,449 INFO L273 TraceCheckUtils]: 139: Hoare triple {42356#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42357#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:27,449 INFO L273 TraceCheckUtils]: 140: Hoare triple {42357#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42357#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:27,450 INFO L273 TraceCheckUtils]: 141: Hoare triple {42357#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42357#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:27,450 INFO L273 TraceCheckUtils]: 142: Hoare triple {42357#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42358#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:27,451 INFO L273 TraceCheckUtils]: 143: Hoare triple {42358#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42358#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:27,451 INFO L273 TraceCheckUtils]: 144: Hoare triple {42358#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42358#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:27,452 INFO L273 TraceCheckUtils]: 145: Hoare triple {42358#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42359#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:27,453 INFO L273 TraceCheckUtils]: 146: Hoare triple {42359#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42359#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:27,453 INFO L273 TraceCheckUtils]: 147: Hoare triple {42359#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42359#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:27,454 INFO L273 TraceCheckUtils]: 148: Hoare triple {42359#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42360#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:27,454 INFO L273 TraceCheckUtils]: 149: Hoare triple {42360#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42360#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:27,455 INFO L273 TraceCheckUtils]: 150: Hoare triple {42360#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42360#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:27,455 INFO L273 TraceCheckUtils]: 151: Hoare triple {42360#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42361#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:27,456 INFO L273 TraceCheckUtils]: 152: Hoare triple {42361#(<= main_~i~0 50)} assume !(~i~0 < 100000); {42312#false} is VALID [2018-11-23 12:00:27,456 INFO L273 TraceCheckUtils]: 153: Hoare triple {42312#false} havoc ~x~0;~x~0 := 0; {42312#false} is VALID [2018-11-23 12:00:27,456 INFO L273 TraceCheckUtils]: 154: Hoare triple {42312#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {42312#false} is VALID [2018-11-23 12:00:27,457 INFO L256 TraceCheckUtils]: 155: Hoare triple {42312#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {42312#false} is VALID [2018-11-23 12:00:27,457 INFO L273 TraceCheckUtils]: 156: Hoare triple {42312#false} ~cond := #in~cond; {42312#false} is VALID [2018-11-23 12:00:27,457 INFO L273 TraceCheckUtils]: 157: Hoare triple {42312#false} assume 0 == ~cond; {42312#false} is VALID [2018-11-23 12:00:27,457 INFO L273 TraceCheckUtils]: 158: Hoare triple {42312#false} assume !false; {42312#false} is VALID [2018-11-23 12:00:27,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:27,473 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:27,473 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-23 12:00:27,481 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:00:27,631 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 49 check-sat command(s) [2018-11-23 12:00:27,631 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:27,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:27,693 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:28,516 INFO L256 TraceCheckUtils]: 0: Hoare triple {42311#true} call ULTIMATE.init(); {42311#true} is VALID [2018-11-23 12:00:28,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {42311#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {42311#true} is VALID [2018-11-23 12:00:28,516 INFO L273 TraceCheckUtils]: 2: Hoare triple {42311#true} assume true; {42311#true} is VALID [2018-11-23 12:00:28,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {42311#true} {42311#true} #88#return; {42311#true} is VALID [2018-11-23 12:00:28,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {42311#true} call #t~ret13 := main(); {42311#true} is VALID [2018-11-23 12:00:28,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {42311#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {42311#true} is VALID [2018-11-23 12:00:28,517 INFO L273 TraceCheckUtils]: 6: Hoare triple {42311#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {42311#true} is VALID [2018-11-23 12:00:28,517 INFO L273 TraceCheckUtils]: 7: Hoare triple {42311#true} ~i~0 := 2; {42313#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:28,518 INFO L273 TraceCheckUtils]: 8: Hoare triple {42313#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42313#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:28,518 INFO L273 TraceCheckUtils]: 9: Hoare triple {42313#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42313#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:28,518 INFO L273 TraceCheckUtils]: 10: Hoare triple {42313#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42314#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:28,519 INFO L273 TraceCheckUtils]: 11: Hoare triple {42314#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42314#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:28,519 INFO L273 TraceCheckUtils]: 12: Hoare triple {42314#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42314#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:28,519 INFO L273 TraceCheckUtils]: 13: Hoare triple {42314#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42315#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:28,520 INFO L273 TraceCheckUtils]: 14: Hoare triple {42315#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42315#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:28,520 INFO L273 TraceCheckUtils]: 15: Hoare triple {42315#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42315#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:28,521 INFO L273 TraceCheckUtils]: 16: Hoare triple {42315#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42316#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:28,521 INFO L273 TraceCheckUtils]: 17: Hoare triple {42316#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42316#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:28,522 INFO L273 TraceCheckUtils]: 18: Hoare triple {42316#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42316#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:28,523 INFO L273 TraceCheckUtils]: 19: Hoare triple {42316#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42317#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:28,523 INFO L273 TraceCheckUtils]: 20: Hoare triple {42317#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42317#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:28,524 INFO L273 TraceCheckUtils]: 21: Hoare triple {42317#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42317#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:28,524 INFO L273 TraceCheckUtils]: 22: Hoare triple {42317#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42318#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:28,525 INFO L273 TraceCheckUtils]: 23: Hoare triple {42318#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42318#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:28,525 INFO L273 TraceCheckUtils]: 24: Hoare triple {42318#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42318#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:28,526 INFO L273 TraceCheckUtils]: 25: Hoare triple {42318#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42319#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:28,526 INFO L273 TraceCheckUtils]: 26: Hoare triple {42319#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42319#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:28,527 INFO L273 TraceCheckUtils]: 27: Hoare triple {42319#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42319#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:28,528 INFO L273 TraceCheckUtils]: 28: Hoare triple {42319#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42320#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:28,528 INFO L273 TraceCheckUtils]: 29: Hoare triple {42320#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42320#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:28,529 INFO L273 TraceCheckUtils]: 30: Hoare triple {42320#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42320#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:28,529 INFO L273 TraceCheckUtils]: 31: Hoare triple {42320#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42321#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:28,530 INFO L273 TraceCheckUtils]: 32: Hoare triple {42321#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42321#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:28,530 INFO L273 TraceCheckUtils]: 33: Hoare triple {42321#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42321#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:28,531 INFO L273 TraceCheckUtils]: 34: Hoare triple {42321#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42322#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:28,532 INFO L273 TraceCheckUtils]: 35: Hoare triple {42322#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42322#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:28,532 INFO L273 TraceCheckUtils]: 36: Hoare triple {42322#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42322#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:28,533 INFO L273 TraceCheckUtils]: 37: Hoare triple {42322#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42323#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:28,533 INFO L273 TraceCheckUtils]: 38: Hoare triple {42323#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42323#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:28,534 INFO L273 TraceCheckUtils]: 39: Hoare triple {42323#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42323#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:28,535 INFO L273 TraceCheckUtils]: 40: Hoare triple {42323#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42324#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:28,535 INFO L273 TraceCheckUtils]: 41: Hoare triple {42324#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42324#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:28,536 INFO L273 TraceCheckUtils]: 42: Hoare triple {42324#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42324#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:28,536 INFO L273 TraceCheckUtils]: 43: Hoare triple {42324#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42325#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:28,537 INFO L273 TraceCheckUtils]: 44: Hoare triple {42325#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42325#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:28,537 INFO L273 TraceCheckUtils]: 45: Hoare triple {42325#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42325#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:28,538 INFO L273 TraceCheckUtils]: 46: Hoare triple {42325#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42326#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:28,539 INFO L273 TraceCheckUtils]: 47: Hoare triple {42326#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42326#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:28,539 INFO L273 TraceCheckUtils]: 48: Hoare triple {42326#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42326#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:28,540 INFO L273 TraceCheckUtils]: 49: Hoare triple {42326#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42327#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:28,540 INFO L273 TraceCheckUtils]: 50: Hoare triple {42327#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42327#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:28,541 INFO L273 TraceCheckUtils]: 51: Hoare triple {42327#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42327#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:28,541 INFO L273 TraceCheckUtils]: 52: Hoare triple {42327#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42328#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:28,542 INFO L273 TraceCheckUtils]: 53: Hoare triple {42328#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42328#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:28,542 INFO L273 TraceCheckUtils]: 54: Hoare triple {42328#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42328#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:28,543 INFO L273 TraceCheckUtils]: 55: Hoare triple {42328#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42329#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:28,544 INFO L273 TraceCheckUtils]: 56: Hoare triple {42329#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42329#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:28,544 INFO L273 TraceCheckUtils]: 57: Hoare triple {42329#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42329#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:28,545 INFO L273 TraceCheckUtils]: 58: Hoare triple {42329#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42330#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:28,545 INFO L273 TraceCheckUtils]: 59: Hoare triple {42330#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42330#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:28,546 INFO L273 TraceCheckUtils]: 60: Hoare triple {42330#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42330#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:28,547 INFO L273 TraceCheckUtils]: 61: Hoare triple {42330#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42331#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:28,547 INFO L273 TraceCheckUtils]: 62: Hoare triple {42331#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42331#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:28,548 INFO L273 TraceCheckUtils]: 63: Hoare triple {42331#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42331#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:28,548 INFO L273 TraceCheckUtils]: 64: Hoare triple {42331#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42332#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:28,549 INFO L273 TraceCheckUtils]: 65: Hoare triple {42332#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42332#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:28,549 INFO L273 TraceCheckUtils]: 66: Hoare triple {42332#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42332#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:28,550 INFO L273 TraceCheckUtils]: 67: Hoare triple {42332#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42333#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:28,551 INFO L273 TraceCheckUtils]: 68: Hoare triple {42333#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42333#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:28,551 INFO L273 TraceCheckUtils]: 69: Hoare triple {42333#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42333#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:28,552 INFO L273 TraceCheckUtils]: 70: Hoare triple {42333#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42334#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:28,552 INFO L273 TraceCheckUtils]: 71: Hoare triple {42334#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42334#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:28,553 INFO L273 TraceCheckUtils]: 72: Hoare triple {42334#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42334#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:28,554 INFO L273 TraceCheckUtils]: 73: Hoare triple {42334#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42335#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:28,554 INFO L273 TraceCheckUtils]: 74: Hoare triple {42335#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42335#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:28,555 INFO L273 TraceCheckUtils]: 75: Hoare triple {42335#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42335#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:28,555 INFO L273 TraceCheckUtils]: 76: Hoare triple {42335#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42336#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:28,556 INFO L273 TraceCheckUtils]: 77: Hoare triple {42336#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42336#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:28,556 INFO L273 TraceCheckUtils]: 78: Hoare triple {42336#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42336#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:28,557 INFO L273 TraceCheckUtils]: 79: Hoare triple {42336#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42337#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:28,557 INFO L273 TraceCheckUtils]: 80: Hoare triple {42337#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42337#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:28,558 INFO L273 TraceCheckUtils]: 81: Hoare triple {42337#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42337#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:28,559 INFO L273 TraceCheckUtils]: 82: Hoare triple {42337#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42338#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:28,559 INFO L273 TraceCheckUtils]: 83: Hoare triple {42338#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42338#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:28,560 INFO L273 TraceCheckUtils]: 84: Hoare triple {42338#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42338#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:28,560 INFO L273 TraceCheckUtils]: 85: Hoare triple {42338#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42339#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:28,561 INFO L273 TraceCheckUtils]: 86: Hoare triple {42339#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42339#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:28,561 INFO L273 TraceCheckUtils]: 87: Hoare triple {42339#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42339#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:28,562 INFO L273 TraceCheckUtils]: 88: Hoare triple {42339#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42340#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:28,563 INFO L273 TraceCheckUtils]: 89: Hoare triple {42340#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42340#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:28,563 INFO L273 TraceCheckUtils]: 90: Hoare triple {42340#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42340#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:28,564 INFO L273 TraceCheckUtils]: 91: Hoare triple {42340#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42341#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:28,564 INFO L273 TraceCheckUtils]: 92: Hoare triple {42341#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42341#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:28,565 INFO L273 TraceCheckUtils]: 93: Hoare triple {42341#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42341#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:28,566 INFO L273 TraceCheckUtils]: 94: Hoare triple {42341#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42342#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:28,566 INFO L273 TraceCheckUtils]: 95: Hoare triple {42342#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42342#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:28,567 INFO L273 TraceCheckUtils]: 96: Hoare triple {42342#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42342#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:28,567 INFO L273 TraceCheckUtils]: 97: Hoare triple {42342#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42343#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:28,568 INFO L273 TraceCheckUtils]: 98: Hoare triple {42343#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42343#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:28,568 INFO L273 TraceCheckUtils]: 99: Hoare triple {42343#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42343#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:28,569 INFO L273 TraceCheckUtils]: 100: Hoare triple {42343#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42344#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:28,570 INFO L273 TraceCheckUtils]: 101: Hoare triple {42344#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42344#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:28,570 INFO L273 TraceCheckUtils]: 102: Hoare triple {42344#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42344#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:28,571 INFO L273 TraceCheckUtils]: 103: Hoare triple {42344#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42345#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:28,571 INFO L273 TraceCheckUtils]: 104: Hoare triple {42345#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42345#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:28,572 INFO L273 TraceCheckUtils]: 105: Hoare triple {42345#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42345#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:28,572 INFO L273 TraceCheckUtils]: 106: Hoare triple {42345#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42346#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:28,573 INFO L273 TraceCheckUtils]: 107: Hoare triple {42346#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42346#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:28,573 INFO L273 TraceCheckUtils]: 108: Hoare triple {42346#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42346#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:28,574 INFO L273 TraceCheckUtils]: 109: Hoare triple {42346#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42347#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:28,575 INFO L273 TraceCheckUtils]: 110: Hoare triple {42347#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42347#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:28,575 INFO L273 TraceCheckUtils]: 111: Hoare triple {42347#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42347#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:28,576 INFO L273 TraceCheckUtils]: 112: Hoare triple {42347#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42348#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:28,576 INFO L273 TraceCheckUtils]: 113: Hoare triple {42348#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42348#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:28,577 INFO L273 TraceCheckUtils]: 114: Hoare triple {42348#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42348#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:28,578 INFO L273 TraceCheckUtils]: 115: Hoare triple {42348#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42349#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:28,578 INFO L273 TraceCheckUtils]: 116: Hoare triple {42349#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42349#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:28,579 INFO L273 TraceCheckUtils]: 117: Hoare triple {42349#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42349#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:28,579 INFO L273 TraceCheckUtils]: 118: Hoare triple {42349#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42350#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:28,580 INFO L273 TraceCheckUtils]: 119: Hoare triple {42350#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42350#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:28,580 INFO L273 TraceCheckUtils]: 120: Hoare triple {42350#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42350#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:28,581 INFO L273 TraceCheckUtils]: 121: Hoare triple {42350#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42351#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:28,582 INFO L273 TraceCheckUtils]: 122: Hoare triple {42351#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42351#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:28,582 INFO L273 TraceCheckUtils]: 123: Hoare triple {42351#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42351#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:28,583 INFO L273 TraceCheckUtils]: 124: Hoare triple {42351#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42352#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:28,583 INFO L273 TraceCheckUtils]: 125: Hoare triple {42352#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42352#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:28,584 INFO L273 TraceCheckUtils]: 126: Hoare triple {42352#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42352#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:28,584 INFO L273 TraceCheckUtils]: 127: Hoare triple {42352#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42353#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:28,585 INFO L273 TraceCheckUtils]: 128: Hoare triple {42353#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42353#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:28,585 INFO L273 TraceCheckUtils]: 129: Hoare triple {42353#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42353#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:28,586 INFO L273 TraceCheckUtils]: 130: Hoare triple {42353#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42354#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:28,587 INFO L273 TraceCheckUtils]: 131: Hoare triple {42354#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42354#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:28,587 INFO L273 TraceCheckUtils]: 132: Hoare triple {42354#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42354#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:28,588 INFO L273 TraceCheckUtils]: 133: Hoare triple {42354#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42355#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:28,588 INFO L273 TraceCheckUtils]: 134: Hoare triple {42355#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42355#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:28,589 INFO L273 TraceCheckUtils]: 135: Hoare triple {42355#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42355#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:28,590 INFO L273 TraceCheckUtils]: 136: Hoare triple {42355#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42356#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:28,590 INFO L273 TraceCheckUtils]: 137: Hoare triple {42356#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42356#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:28,591 INFO L273 TraceCheckUtils]: 138: Hoare triple {42356#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42356#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:28,591 INFO L273 TraceCheckUtils]: 139: Hoare triple {42356#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42357#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:28,592 INFO L273 TraceCheckUtils]: 140: Hoare triple {42357#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42357#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:28,592 INFO L273 TraceCheckUtils]: 141: Hoare triple {42357#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42357#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:28,593 INFO L273 TraceCheckUtils]: 142: Hoare triple {42357#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42358#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:28,594 INFO L273 TraceCheckUtils]: 143: Hoare triple {42358#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42358#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:28,594 INFO L273 TraceCheckUtils]: 144: Hoare triple {42358#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42358#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:28,595 INFO L273 TraceCheckUtils]: 145: Hoare triple {42358#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42359#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:28,595 INFO L273 TraceCheckUtils]: 146: Hoare triple {42359#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42359#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:28,596 INFO L273 TraceCheckUtils]: 147: Hoare triple {42359#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42359#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:28,597 INFO L273 TraceCheckUtils]: 148: Hoare triple {42359#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42360#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:28,597 INFO L273 TraceCheckUtils]: 149: Hoare triple {42360#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {42360#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:28,598 INFO L273 TraceCheckUtils]: 150: Hoare triple {42360#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {42360#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:28,598 INFO L273 TraceCheckUtils]: 151: Hoare triple {42360#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {42361#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:28,599 INFO L273 TraceCheckUtils]: 152: Hoare triple {42361#(<= main_~i~0 50)} assume !(~i~0 < 100000); {42312#false} is VALID [2018-11-23 12:00:28,599 INFO L273 TraceCheckUtils]: 153: Hoare triple {42312#false} havoc ~x~0;~x~0 := 0; {42312#false} is VALID [2018-11-23 12:00:28,599 INFO L273 TraceCheckUtils]: 154: Hoare triple {42312#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {42312#false} is VALID [2018-11-23 12:00:28,599 INFO L256 TraceCheckUtils]: 155: Hoare triple {42312#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {42312#false} is VALID [2018-11-23 12:00:28,600 INFO L273 TraceCheckUtils]: 156: Hoare triple {42312#false} ~cond := #in~cond; {42312#false} is VALID [2018-11-23 12:00:28,600 INFO L273 TraceCheckUtils]: 157: Hoare triple {42312#false} assume 0 == ~cond; {42312#false} is VALID [2018-11-23 12:00:28,600 INFO L273 TraceCheckUtils]: 158: Hoare triple {42312#false} assume !false; {42312#false} is VALID [2018-11-23 12:00:28,616 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:28,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:28,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 51] total 51 [2018-11-23 12:00:28,636 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 159 [2018-11-23 12:00:28,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:28,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states. [2018-11-23 12:00:28,791 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:28,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-11-23 12:00:28,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-11-23 12:00:28,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:00:28,792 INFO L87 Difference]: Start difference. First operand 218 states and 319 transitions. Second operand 51 states. [2018-11-23 12:00:30,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:30,808 INFO L93 Difference]: Finished difference Result 242 states and 351 transitions. [2018-11-23 12:00:30,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-11-23 12:00:30,808 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 159 [2018-11-23 12:00:30,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:30,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:00:30,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 351 transitions. [2018-11-23 12:00:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 12:00:30,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 351 transitions. [2018-11-23 12:00:30,813 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 351 transitions. [2018-11-23 12:00:31,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 351 edges. 351 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:31,156 INFO L225 Difference]: With dead ends: 242 [2018-11-23 12:00:31,156 INFO L226 Difference]: Without dead ends: 225 [2018-11-23 12:00:31,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-11-23 12:00:31,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-11-23 12:00:31,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 222. [2018-11-23 12:00:31,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:31,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand 222 states. [2018-11-23 12:00:31,198 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand 222 states. [2018-11-23 12:00:31,198 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 222 states. [2018-11-23 12:00:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:31,202 INFO L93 Difference]: Finished difference Result 225 states and 330 transitions. [2018-11-23 12:00:31,202 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 330 transitions. [2018-11-23 12:00:31,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:31,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:31,202 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand 225 states. [2018-11-23 12:00:31,203 INFO L87 Difference]: Start difference. First operand 222 states. Second operand 225 states. [2018-11-23 12:00:31,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:31,206 INFO L93 Difference]: Finished difference Result 225 states and 330 transitions. [2018-11-23 12:00:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 330 transitions. [2018-11-23 12:00:31,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:31,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:31,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:31,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-11-23 12:00:31,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 325 transitions. [2018-11-23 12:00:31,210 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 325 transitions. Word has length 159 [2018-11-23 12:00:31,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:31,210 INFO L480 AbstractCegarLoop]: Abstraction has 222 states and 325 transitions. [2018-11-23 12:00:31,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-11-23 12:00:31,211 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 325 transitions. [2018-11-23 12:00:31,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-11-23 12:00:31,211 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:31,211 INFO L402 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:31,212 INFO L423 AbstractCegarLoop]: === Iteration 51 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:31,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:31,212 INFO L82 PathProgramCache]: Analyzing trace with hash -725151295, now seen corresponding path program 49 times [2018-11-23 12:00:31,212 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:31,212 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:31,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:31,213 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:31,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:31,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:32,348 INFO L256 TraceCheckUtils]: 0: Hoare triple {43875#true} call ULTIMATE.init(); {43875#true} is VALID [2018-11-23 12:00:32,349 INFO L273 TraceCheckUtils]: 1: Hoare triple {43875#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43875#true} is VALID [2018-11-23 12:00:32,349 INFO L273 TraceCheckUtils]: 2: Hoare triple {43875#true} assume true; {43875#true} is VALID [2018-11-23 12:00:32,349 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43875#true} {43875#true} #88#return; {43875#true} is VALID [2018-11-23 12:00:32,349 INFO L256 TraceCheckUtils]: 4: Hoare triple {43875#true} call #t~ret13 := main(); {43875#true} is VALID [2018-11-23 12:00:32,350 INFO L273 TraceCheckUtils]: 5: Hoare triple {43875#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {43875#true} is VALID [2018-11-23 12:00:32,350 INFO L273 TraceCheckUtils]: 6: Hoare triple {43875#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {43875#true} is VALID [2018-11-23 12:00:32,350 INFO L273 TraceCheckUtils]: 7: Hoare triple {43875#true} ~i~0 := 2; {43877#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:32,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {43877#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43877#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:32,351 INFO L273 TraceCheckUtils]: 9: Hoare triple {43877#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43877#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:32,351 INFO L273 TraceCheckUtils]: 10: Hoare triple {43877#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43878#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:32,352 INFO L273 TraceCheckUtils]: 11: Hoare triple {43878#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43878#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:32,352 INFO L273 TraceCheckUtils]: 12: Hoare triple {43878#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43878#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:32,352 INFO L273 TraceCheckUtils]: 13: Hoare triple {43878#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43879#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:32,353 INFO L273 TraceCheckUtils]: 14: Hoare triple {43879#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43879#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:32,353 INFO L273 TraceCheckUtils]: 15: Hoare triple {43879#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43879#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:32,354 INFO L273 TraceCheckUtils]: 16: Hoare triple {43879#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43880#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:32,355 INFO L273 TraceCheckUtils]: 17: Hoare triple {43880#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43880#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:32,355 INFO L273 TraceCheckUtils]: 18: Hoare triple {43880#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43880#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:32,356 INFO L273 TraceCheckUtils]: 19: Hoare triple {43880#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43881#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:32,356 INFO L273 TraceCheckUtils]: 20: Hoare triple {43881#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43881#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:32,357 INFO L273 TraceCheckUtils]: 21: Hoare triple {43881#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43881#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:32,358 INFO L273 TraceCheckUtils]: 22: Hoare triple {43881#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43882#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:32,358 INFO L273 TraceCheckUtils]: 23: Hoare triple {43882#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43882#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:32,359 INFO L273 TraceCheckUtils]: 24: Hoare triple {43882#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43882#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:32,359 INFO L273 TraceCheckUtils]: 25: Hoare triple {43882#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43883#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:32,360 INFO L273 TraceCheckUtils]: 26: Hoare triple {43883#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43883#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:32,360 INFO L273 TraceCheckUtils]: 27: Hoare triple {43883#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43883#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:32,361 INFO L273 TraceCheckUtils]: 28: Hoare triple {43883#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43884#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:32,362 INFO L273 TraceCheckUtils]: 29: Hoare triple {43884#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43884#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:32,362 INFO L273 TraceCheckUtils]: 30: Hoare triple {43884#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43884#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:32,363 INFO L273 TraceCheckUtils]: 31: Hoare triple {43884#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43885#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:32,363 INFO L273 TraceCheckUtils]: 32: Hoare triple {43885#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43885#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:32,364 INFO L273 TraceCheckUtils]: 33: Hoare triple {43885#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43885#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:32,364 INFO L273 TraceCheckUtils]: 34: Hoare triple {43885#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43886#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:32,365 INFO L273 TraceCheckUtils]: 35: Hoare triple {43886#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43886#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:32,365 INFO L273 TraceCheckUtils]: 36: Hoare triple {43886#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43886#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:32,366 INFO L273 TraceCheckUtils]: 37: Hoare triple {43886#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43887#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:32,367 INFO L273 TraceCheckUtils]: 38: Hoare triple {43887#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43887#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:32,367 INFO L273 TraceCheckUtils]: 39: Hoare triple {43887#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43887#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:32,368 INFO L273 TraceCheckUtils]: 40: Hoare triple {43887#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43888#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:32,368 INFO L273 TraceCheckUtils]: 41: Hoare triple {43888#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43888#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:32,369 INFO L273 TraceCheckUtils]: 42: Hoare triple {43888#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43888#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:32,370 INFO L273 TraceCheckUtils]: 43: Hoare triple {43888#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43889#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:32,370 INFO L273 TraceCheckUtils]: 44: Hoare triple {43889#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43889#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:32,371 INFO L273 TraceCheckUtils]: 45: Hoare triple {43889#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43889#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:32,371 INFO L273 TraceCheckUtils]: 46: Hoare triple {43889#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43890#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:32,372 INFO L273 TraceCheckUtils]: 47: Hoare triple {43890#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43890#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:32,372 INFO L273 TraceCheckUtils]: 48: Hoare triple {43890#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43890#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:32,373 INFO L273 TraceCheckUtils]: 49: Hoare triple {43890#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43891#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:32,374 INFO L273 TraceCheckUtils]: 50: Hoare triple {43891#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43891#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:32,374 INFO L273 TraceCheckUtils]: 51: Hoare triple {43891#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43891#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:32,375 INFO L273 TraceCheckUtils]: 52: Hoare triple {43891#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43892#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:32,375 INFO L273 TraceCheckUtils]: 53: Hoare triple {43892#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43892#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:32,376 INFO L273 TraceCheckUtils]: 54: Hoare triple {43892#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43892#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:32,377 INFO L273 TraceCheckUtils]: 55: Hoare triple {43892#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43893#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:32,377 INFO L273 TraceCheckUtils]: 56: Hoare triple {43893#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43893#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:32,378 INFO L273 TraceCheckUtils]: 57: Hoare triple {43893#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43893#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:32,378 INFO L273 TraceCheckUtils]: 58: Hoare triple {43893#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43894#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:32,379 INFO L273 TraceCheckUtils]: 59: Hoare triple {43894#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43894#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:32,379 INFO L273 TraceCheckUtils]: 60: Hoare triple {43894#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43894#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:32,380 INFO L273 TraceCheckUtils]: 61: Hoare triple {43894#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43895#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:32,380 INFO L273 TraceCheckUtils]: 62: Hoare triple {43895#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43895#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:32,381 INFO L273 TraceCheckUtils]: 63: Hoare triple {43895#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43895#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:32,382 INFO L273 TraceCheckUtils]: 64: Hoare triple {43895#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43896#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:32,382 INFO L273 TraceCheckUtils]: 65: Hoare triple {43896#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43896#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:32,383 INFO L273 TraceCheckUtils]: 66: Hoare triple {43896#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43896#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:32,383 INFO L273 TraceCheckUtils]: 67: Hoare triple {43896#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43897#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:32,384 INFO L273 TraceCheckUtils]: 68: Hoare triple {43897#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43897#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:32,384 INFO L273 TraceCheckUtils]: 69: Hoare triple {43897#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43897#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:32,385 INFO L273 TraceCheckUtils]: 70: Hoare triple {43897#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43898#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:32,386 INFO L273 TraceCheckUtils]: 71: Hoare triple {43898#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43898#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:32,386 INFO L273 TraceCheckUtils]: 72: Hoare triple {43898#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43898#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:32,387 INFO L273 TraceCheckUtils]: 73: Hoare triple {43898#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43899#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:32,387 INFO L273 TraceCheckUtils]: 74: Hoare triple {43899#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43899#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:32,388 INFO L273 TraceCheckUtils]: 75: Hoare triple {43899#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43899#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:32,389 INFO L273 TraceCheckUtils]: 76: Hoare triple {43899#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43900#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:32,389 INFO L273 TraceCheckUtils]: 77: Hoare triple {43900#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43900#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:32,390 INFO L273 TraceCheckUtils]: 78: Hoare triple {43900#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43900#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:32,390 INFO L273 TraceCheckUtils]: 79: Hoare triple {43900#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43901#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:32,391 INFO L273 TraceCheckUtils]: 80: Hoare triple {43901#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43901#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:32,391 INFO L273 TraceCheckUtils]: 81: Hoare triple {43901#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43901#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:32,392 INFO L273 TraceCheckUtils]: 82: Hoare triple {43901#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43902#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:32,393 INFO L273 TraceCheckUtils]: 83: Hoare triple {43902#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43902#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:32,393 INFO L273 TraceCheckUtils]: 84: Hoare triple {43902#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43902#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:32,394 INFO L273 TraceCheckUtils]: 85: Hoare triple {43902#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43903#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:32,394 INFO L273 TraceCheckUtils]: 86: Hoare triple {43903#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43903#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:32,395 INFO L273 TraceCheckUtils]: 87: Hoare triple {43903#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43903#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:32,395 INFO L273 TraceCheckUtils]: 88: Hoare triple {43903#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43904#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:32,396 INFO L273 TraceCheckUtils]: 89: Hoare triple {43904#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43904#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:32,396 INFO L273 TraceCheckUtils]: 90: Hoare triple {43904#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43904#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:32,397 INFO L273 TraceCheckUtils]: 91: Hoare triple {43904#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43905#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:32,398 INFO L273 TraceCheckUtils]: 92: Hoare triple {43905#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43905#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:32,398 INFO L273 TraceCheckUtils]: 93: Hoare triple {43905#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43905#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:32,399 INFO L273 TraceCheckUtils]: 94: Hoare triple {43905#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43906#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:32,399 INFO L273 TraceCheckUtils]: 95: Hoare triple {43906#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43906#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:32,400 INFO L273 TraceCheckUtils]: 96: Hoare triple {43906#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43906#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:32,401 INFO L273 TraceCheckUtils]: 97: Hoare triple {43906#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43907#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:32,401 INFO L273 TraceCheckUtils]: 98: Hoare triple {43907#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43907#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:32,402 INFO L273 TraceCheckUtils]: 99: Hoare triple {43907#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43907#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:32,402 INFO L273 TraceCheckUtils]: 100: Hoare triple {43907#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43908#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:32,403 INFO L273 TraceCheckUtils]: 101: Hoare triple {43908#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43908#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:32,403 INFO L273 TraceCheckUtils]: 102: Hoare triple {43908#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43908#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:32,404 INFO L273 TraceCheckUtils]: 103: Hoare triple {43908#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43909#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:32,405 INFO L273 TraceCheckUtils]: 104: Hoare triple {43909#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43909#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:32,405 INFO L273 TraceCheckUtils]: 105: Hoare triple {43909#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43909#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:32,406 INFO L273 TraceCheckUtils]: 106: Hoare triple {43909#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43910#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:32,406 INFO L273 TraceCheckUtils]: 107: Hoare triple {43910#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43910#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:32,407 INFO L273 TraceCheckUtils]: 108: Hoare triple {43910#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43910#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:32,407 INFO L273 TraceCheckUtils]: 109: Hoare triple {43910#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43911#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:32,408 INFO L273 TraceCheckUtils]: 110: Hoare triple {43911#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43911#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:32,408 INFO L273 TraceCheckUtils]: 111: Hoare triple {43911#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43911#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:32,409 INFO L273 TraceCheckUtils]: 112: Hoare triple {43911#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43912#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:32,410 INFO L273 TraceCheckUtils]: 113: Hoare triple {43912#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43912#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:32,410 INFO L273 TraceCheckUtils]: 114: Hoare triple {43912#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43912#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:32,411 INFO L273 TraceCheckUtils]: 115: Hoare triple {43912#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43913#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:32,411 INFO L273 TraceCheckUtils]: 116: Hoare triple {43913#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43913#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:32,412 INFO L273 TraceCheckUtils]: 117: Hoare triple {43913#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43913#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:32,413 INFO L273 TraceCheckUtils]: 118: Hoare triple {43913#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43914#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:32,413 INFO L273 TraceCheckUtils]: 119: Hoare triple {43914#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43914#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:32,414 INFO L273 TraceCheckUtils]: 120: Hoare triple {43914#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43914#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:32,414 INFO L273 TraceCheckUtils]: 121: Hoare triple {43914#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43915#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:32,415 INFO L273 TraceCheckUtils]: 122: Hoare triple {43915#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43915#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:32,415 INFO L273 TraceCheckUtils]: 123: Hoare triple {43915#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43915#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:32,416 INFO L273 TraceCheckUtils]: 124: Hoare triple {43915#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43916#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:32,417 INFO L273 TraceCheckUtils]: 125: Hoare triple {43916#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43916#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:32,417 INFO L273 TraceCheckUtils]: 126: Hoare triple {43916#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43916#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:32,418 INFO L273 TraceCheckUtils]: 127: Hoare triple {43916#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43917#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:32,418 INFO L273 TraceCheckUtils]: 128: Hoare triple {43917#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43917#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:32,419 INFO L273 TraceCheckUtils]: 129: Hoare triple {43917#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43917#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:32,419 INFO L273 TraceCheckUtils]: 130: Hoare triple {43917#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43918#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:32,420 INFO L273 TraceCheckUtils]: 131: Hoare triple {43918#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43918#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:32,420 INFO L273 TraceCheckUtils]: 132: Hoare triple {43918#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43918#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:32,421 INFO L273 TraceCheckUtils]: 133: Hoare triple {43918#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43919#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:32,422 INFO L273 TraceCheckUtils]: 134: Hoare triple {43919#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43919#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:32,422 INFO L273 TraceCheckUtils]: 135: Hoare triple {43919#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43919#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:32,423 INFO L273 TraceCheckUtils]: 136: Hoare triple {43919#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43920#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:32,423 INFO L273 TraceCheckUtils]: 137: Hoare triple {43920#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43920#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:32,424 INFO L273 TraceCheckUtils]: 138: Hoare triple {43920#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43920#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:32,425 INFO L273 TraceCheckUtils]: 139: Hoare triple {43920#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43921#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:32,425 INFO L273 TraceCheckUtils]: 140: Hoare triple {43921#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43921#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:32,426 INFO L273 TraceCheckUtils]: 141: Hoare triple {43921#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43921#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:32,426 INFO L273 TraceCheckUtils]: 142: Hoare triple {43921#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43922#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:32,427 INFO L273 TraceCheckUtils]: 143: Hoare triple {43922#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43922#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:32,427 INFO L273 TraceCheckUtils]: 144: Hoare triple {43922#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43922#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:32,428 INFO L273 TraceCheckUtils]: 145: Hoare triple {43922#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43923#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:32,429 INFO L273 TraceCheckUtils]: 146: Hoare triple {43923#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43923#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:32,429 INFO L273 TraceCheckUtils]: 147: Hoare triple {43923#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43923#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:32,430 INFO L273 TraceCheckUtils]: 148: Hoare triple {43923#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43924#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:32,430 INFO L273 TraceCheckUtils]: 149: Hoare triple {43924#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43924#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:32,431 INFO L273 TraceCheckUtils]: 150: Hoare triple {43924#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43924#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:32,431 INFO L273 TraceCheckUtils]: 151: Hoare triple {43924#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43925#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:32,432 INFO L273 TraceCheckUtils]: 152: Hoare triple {43925#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43925#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:32,432 INFO L273 TraceCheckUtils]: 153: Hoare triple {43925#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43925#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:32,433 INFO L273 TraceCheckUtils]: 154: Hoare triple {43925#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43926#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:32,434 INFO L273 TraceCheckUtils]: 155: Hoare triple {43926#(<= main_~i~0 51)} assume !(~i~0 < 100000); {43876#false} is VALID [2018-11-23 12:00:32,434 INFO L273 TraceCheckUtils]: 156: Hoare triple {43876#false} havoc ~x~0;~x~0 := 0; {43876#false} is VALID [2018-11-23 12:00:32,434 INFO L273 TraceCheckUtils]: 157: Hoare triple {43876#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {43876#false} is VALID [2018-11-23 12:00:32,434 INFO L256 TraceCheckUtils]: 158: Hoare triple {43876#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {43876#false} is VALID [2018-11-23 12:00:32,434 INFO L273 TraceCheckUtils]: 159: Hoare triple {43876#false} ~cond := #in~cond; {43876#false} is VALID [2018-11-23 12:00:32,434 INFO L273 TraceCheckUtils]: 160: Hoare triple {43876#false} assume 0 == ~cond; {43876#false} is VALID [2018-11-23 12:00:32,435 INFO L273 TraceCheckUtils]: 161: Hoare triple {43876#false} assume !false; {43876#false} is VALID [2018-11-23 12:00:32,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:32,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:32,452 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-23 12:00:32,461 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:32,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:32,588 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:32,921 INFO L256 TraceCheckUtils]: 0: Hoare triple {43875#true} call ULTIMATE.init(); {43875#true} is VALID [2018-11-23 12:00:32,921 INFO L273 TraceCheckUtils]: 1: Hoare triple {43875#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {43875#true} is VALID [2018-11-23 12:00:32,921 INFO L273 TraceCheckUtils]: 2: Hoare triple {43875#true} assume true; {43875#true} is VALID [2018-11-23 12:00:32,922 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {43875#true} {43875#true} #88#return; {43875#true} is VALID [2018-11-23 12:00:32,922 INFO L256 TraceCheckUtils]: 4: Hoare triple {43875#true} call #t~ret13 := main(); {43875#true} is VALID [2018-11-23 12:00:32,922 INFO L273 TraceCheckUtils]: 5: Hoare triple {43875#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {43875#true} is VALID [2018-11-23 12:00:32,922 INFO L273 TraceCheckUtils]: 6: Hoare triple {43875#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {43875#true} is VALID [2018-11-23 12:00:32,923 INFO L273 TraceCheckUtils]: 7: Hoare triple {43875#true} ~i~0 := 2; {43877#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:32,923 INFO L273 TraceCheckUtils]: 8: Hoare triple {43877#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43877#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:32,923 INFO L273 TraceCheckUtils]: 9: Hoare triple {43877#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43877#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:32,924 INFO L273 TraceCheckUtils]: 10: Hoare triple {43877#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43878#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:32,924 INFO L273 TraceCheckUtils]: 11: Hoare triple {43878#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43878#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:32,924 INFO L273 TraceCheckUtils]: 12: Hoare triple {43878#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43878#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:32,925 INFO L273 TraceCheckUtils]: 13: Hoare triple {43878#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43879#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:32,925 INFO L273 TraceCheckUtils]: 14: Hoare triple {43879#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43879#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:32,925 INFO L273 TraceCheckUtils]: 15: Hoare triple {43879#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43879#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:32,926 INFO L273 TraceCheckUtils]: 16: Hoare triple {43879#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43880#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:32,927 INFO L273 TraceCheckUtils]: 17: Hoare triple {43880#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43880#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:32,927 INFO L273 TraceCheckUtils]: 18: Hoare triple {43880#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43880#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:32,928 INFO L273 TraceCheckUtils]: 19: Hoare triple {43880#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43881#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:32,928 INFO L273 TraceCheckUtils]: 20: Hoare triple {43881#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43881#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:32,929 INFO L273 TraceCheckUtils]: 21: Hoare triple {43881#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43881#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:32,929 INFO L273 TraceCheckUtils]: 22: Hoare triple {43881#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43882#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:32,930 INFO L273 TraceCheckUtils]: 23: Hoare triple {43882#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43882#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:32,930 INFO L273 TraceCheckUtils]: 24: Hoare triple {43882#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43882#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:32,931 INFO L273 TraceCheckUtils]: 25: Hoare triple {43882#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43883#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:32,932 INFO L273 TraceCheckUtils]: 26: Hoare triple {43883#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43883#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:32,932 INFO L273 TraceCheckUtils]: 27: Hoare triple {43883#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43883#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:32,933 INFO L273 TraceCheckUtils]: 28: Hoare triple {43883#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43884#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:32,933 INFO L273 TraceCheckUtils]: 29: Hoare triple {43884#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43884#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:32,934 INFO L273 TraceCheckUtils]: 30: Hoare triple {43884#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43884#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:32,935 INFO L273 TraceCheckUtils]: 31: Hoare triple {43884#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43885#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:32,935 INFO L273 TraceCheckUtils]: 32: Hoare triple {43885#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43885#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:32,936 INFO L273 TraceCheckUtils]: 33: Hoare triple {43885#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43885#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:32,936 INFO L273 TraceCheckUtils]: 34: Hoare triple {43885#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43886#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:32,937 INFO L273 TraceCheckUtils]: 35: Hoare triple {43886#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43886#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:32,937 INFO L273 TraceCheckUtils]: 36: Hoare triple {43886#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43886#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:32,938 INFO L273 TraceCheckUtils]: 37: Hoare triple {43886#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43887#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:32,939 INFO L273 TraceCheckUtils]: 38: Hoare triple {43887#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43887#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:32,939 INFO L273 TraceCheckUtils]: 39: Hoare triple {43887#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43887#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:32,940 INFO L273 TraceCheckUtils]: 40: Hoare triple {43887#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43888#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:32,940 INFO L273 TraceCheckUtils]: 41: Hoare triple {43888#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43888#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:32,941 INFO L273 TraceCheckUtils]: 42: Hoare triple {43888#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43888#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:32,941 INFO L273 TraceCheckUtils]: 43: Hoare triple {43888#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43889#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:32,942 INFO L273 TraceCheckUtils]: 44: Hoare triple {43889#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43889#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:32,942 INFO L273 TraceCheckUtils]: 45: Hoare triple {43889#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43889#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:32,943 INFO L273 TraceCheckUtils]: 46: Hoare triple {43889#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43890#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:32,944 INFO L273 TraceCheckUtils]: 47: Hoare triple {43890#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43890#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:32,944 INFO L273 TraceCheckUtils]: 48: Hoare triple {43890#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43890#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:32,945 INFO L273 TraceCheckUtils]: 49: Hoare triple {43890#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43891#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:32,945 INFO L273 TraceCheckUtils]: 50: Hoare triple {43891#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43891#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:32,946 INFO L273 TraceCheckUtils]: 51: Hoare triple {43891#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43891#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:32,947 INFO L273 TraceCheckUtils]: 52: Hoare triple {43891#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43892#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:32,947 INFO L273 TraceCheckUtils]: 53: Hoare triple {43892#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43892#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:32,948 INFO L273 TraceCheckUtils]: 54: Hoare triple {43892#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43892#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:32,948 INFO L273 TraceCheckUtils]: 55: Hoare triple {43892#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43893#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:32,949 INFO L273 TraceCheckUtils]: 56: Hoare triple {43893#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43893#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:32,949 INFO L273 TraceCheckUtils]: 57: Hoare triple {43893#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43893#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:32,950 INFO L273 TraceCheckUtils]: 58: Hoare triple {43893#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43894#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:32,951 INFO L273 TraceCheckUtils]: 59: Hoare triple {43894#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43894#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:32,951 INFO L273 TraceCheckUtils]: 60: Hoare triple {43894#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43894#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:32,952 INFO L273 TraceCheckUtils]: 61: Hoare triple {43894#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43895#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:32,952 INFO L273 TraceCheckUtils]: 62: Hoare triple {43895#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43895#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:32,953 INFO L273 TraceCheckUtils]: 63: Hoare triple {43895#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43895#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:32,953 INFO L273 TraceCheckUtils]: 64: Hoare triple {43895#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43896#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:32,954 INFO L273 TraceCheckUtils]: 65: Hoare triple {43896#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43896#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:32,954 INFO L273 TraceCheckUtils]: 66: Hoare triple {43896#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43896#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:32,955 INFO L273 TraceCheckUtils]: 67: Hoare triple {43896#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43897#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:32,956 INFO L273 TraceCheckUtils]: 68: Hoare triple {43897#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43897#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:32,956 INFO L273 TraceCheckUtils]: 69: Hoare triple {43897#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43897#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:32,957 INFO L273 TraceCheckUtils]: 70: Hoare triple {43897#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43898#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:32,957 INFO L273 TraceCheckUtils]: 71: Hoare triple {43898#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43898#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:32,958 INFO L273 TraceCheckUtils]: 72: Hoare triple {43898#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43898#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:32,959 INFO L273 TraceCheckUtils]: 73: Hoare triple {43898#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43899#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:32,959 INFO L273 TraceCheckUtils]: 74: Hoare triple {43899#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43899#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:32,960 INFO L273 TraceCheckUtils]: 75: Hoare triple {43899#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43899#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:32,960 INFO L273 TraceCheckUtils]: 76: Hoare triple {43899#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43900#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:32,961 INFO L273 TraceCheckUtils]: 77: Hoare triple {43900#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43900#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:32,961 INFO L273 TraceCheckUtils]: 78: Hoare triple {43900#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43900#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:32,962 INFO L273 TraceCheckUtils]: 79: Hoare triple {43900#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43901#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:32,963 INFO L273 TraceCheckUtils]: 80: Hoare triple {43901#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43901#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:32,963 INFO L273 TraceCheckUtils]: 81: Hoare triple {43901#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43901#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:32,964 INFO L273 TraceCheckUtils]: 82: Hoare triple {43901#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43902#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:32,964 INFO L273 TraceCheckUtils]: 83: Hoare triple {43902#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43902#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:32,965 INFO L273 TraceCheckUtils]: 84: Hoare triple {43902#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43902#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:32,965 INFO L273 TraceCheckUtils]: 85: Hoare triple {43902#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43903#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:32,966 INFO L273 TraceCheckUtils]: 86: Hoare triple {43903#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43903#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:32,966 INFO L273 TraceCheckUtils]: 87: Hoare triple {43903#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43903#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:32,967 INFO L273 TraceCheckUtils]: 88: Hoare triple {43903#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43904#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:32,968 INFO L273 TraceCheckUtils]: 89: Hoare triple {43904#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43904#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:32,968 INFO L273 TraceCheckUtils]: 90: Hoare triple {43904#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43904#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:32,969 INFO L273 TraceCheckUtils]: 91: Hoare triple {43904#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43905#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:32,969 INFO L273 TraceCheckUtils]: 92: Hoare triple {43905#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43905#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:32,970 INFO L273 TraceCheckUtils]: 93: Hoare triple {43905#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43905#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:32,971 INFO L273 TraceCheckUtils]: 94: Hoare triple {43905#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43906#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:32,971 INFO L273 TraceCheckUtils]: 95: Hoare triple {43906#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43906#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:32,972 INFO L273 TraceCheckUtils]: 96: Hoare triple {43906#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43906#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:32,972 INFO L273 TraceCheckUtils]: 97: Hoare triple {43906#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43907#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:32,973 INFO L273 TraceCheckUtils]: 98: Hoare triple {43907#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43907#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:32,973 INFO L273 TraceCheckUtils]: 99: Hoare triple {43907#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43907#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:32,974 INFO L273 TraceCheckUtils]: 100: Hoare triple {43907#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43908#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:32,975 INFO L273 TraceCheckUtils]: 101: Hoare triple {43908#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43908#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:32,975 INFO L273 TraceCheckUtils]: 102: Hoare triple {43908#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43908#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:32,976 INFO L273 TraceCheckUtils]: 103: Hoare triple {43908#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43909#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:32,976 INFO L273 TraceCheckUtils]: 104: Hoare triple {43909#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43909#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:32,977 INFO L273 TraceCheckUtils]: 105: Hoare triple {43909#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43909#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:32,977 INFO L273 TraceCheckUtils]: 106: Hoare triple {43909#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43910#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:32,978 INFO L273 TraceCheckUtils]: 107: Hoare triple {43910#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43910#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:32,978 INFO L273 TraceCheckUtils]: 108: Hoare triple {43910#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43910#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:32,979 INFO L273 TraceCheckUtils]: 109: Hoare triple {43910#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43911#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:32,980 INFO L273 TraceCheckUtils]: 110: Hoare triple {43911#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43911#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:32,980 INFO L273 TraceCheckUtils]: 111: Hoare triple {43911#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43911#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:32,981 INFO L273 TraceCheckUtils]: 112: Hoare triple {43911#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43912#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:32,981 INFO L273 TraceCheckUtils]: 113: Hoare triple {43912#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43912#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:32,982 INFO L273 TraceCheckUtils]: 114: Hoare triple {43912#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43912#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:32,983 INFO L273 TraceCheckUtils]: 115: Hoare triple {43912#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43913#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:32,983 INFO L273 TraceCheckUtils]: 116: Hoare triple {43913#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43913#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:32,984 INFO L273 TraceCheckUtils]: 117: Hoare triple {43913#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43913#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:32,984 INFO L273 TraceCheckUtils]: 118: Hoare triple {43913#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43914#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:32,985 INFO L273 TraceCheckUtils]: 119: Hoare triple {43914#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43914#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:32,985 INFO L273 TraceCheckUtils]: 120: Hoare triple {43914#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43914#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:32,986 INFO L273 TraceCheckUtils]: 121: Hoare triple {43914#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43915#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:32,987 INFO L273 TraceCheckUtils]: 122: Hoare triple {43915#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43915#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:32,987 INFO L273 TraceCheckUtils]: 123: Hoare triple {43915#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43915#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:32,988 INFO L273 TraceCheckUtils]: 124: Hoare triple {43915#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43916#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:32,988 INFO L273 TraceCheckUtils]: 125: Hoare triple {43916#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43916#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:32,989 INFO L273 TraceCheckUtils]: 126: Hoare triple {43916#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43916#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:32,989 INFO L273 TraceCheckUtils]: 127: Hoare triple {43916#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43917#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:32,990 INFO L273 TraceCheckUtils]: 128: Hoare triple {43917#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43917#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:32,990 INFO L273 TraceCheckUtils]: 129: Hoare triple {43917#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43917#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:32,991 INFO L273 TraceCheckUtils]: 130: Hoare triple {43917#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43918#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:32,992 INFO L273 TraceCheckUtils]: 131: Hoare triple {43918#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43918#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:32,992 INFO L273 TraceCheckUtils]: 132: Hoare triple {43918#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43918#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:32,993 INFO L273 TraceCheckUtils]: 133: Hoare triple {43918#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43919#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:32,993 INFO L273 TraceCheckUtils]: 134: Hoare triple {43919#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43919#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:32,994 INFO L273 TraceCheckUtils]: 135: Hoare triple {43919#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43919#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:32,995 INFO L273 TraceCheckUtils]: 136: Hoare triple {43919#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43920#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:32,995 INFO L273 TraceCheckUtils]: 137: Hoare triple {43920#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43920#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:32,996 INFO L273 TraceCheckUtils]: 138: Hoare triple {43920#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43920#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:32,996 INFO L273 TraceCheckUtils]: 139: Hoare triple {43920#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43921#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:32,997 INFO L273 TraceCheckUtils]: 140: Hoare triple {43921#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43921#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:32,997 INFO L273 TraceCheckUtils]: 141: Hoare triple {43921#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43921#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:32,998 INFO L273 TraceCheckUtils]: 142: Hoare triple {43921#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43922#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:32,999 INFO L273 TraceCheckUtils]: 143: Hoare triple {43922#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43922#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:32,999 INFO L273 TraceCheckUtils]: 144: Hoare triple {43922#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43922#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:33,000 INFO L273 TraceCheckUtils]: 145: Hoare triple {43922#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43923#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:33,000 INFO L273 TraceCheckUtils]: 146: Hoare triple {43923#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43923#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:33,001 INFO L273 TraceCheckUtils]: 147: Hoare triple {43923#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43923#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:33,001 INFO L273 TraceCheckUtils]: 148: Hoare triple {43923#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43924#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:33,002 INFO L273 TraceCheckUtils]: 149: Hoare triple {43924#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43924#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:33,002 INFO L273 TraceCheckUtils]: 150: Hoare triple {43924#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43924#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:33,003 INFO L273 TraceCheckUtils]: 151: Hoare triple {43924#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43925#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:33,004 INFO L273 TraceCheckUtils]: 152: Hoare triple {43925#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {43925#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:33,004 INFO L273 TraceCheckUtils]: 153: Hoare triple {43925#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {43925#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:33,005 INFO L273 TraceCheckUtils]: 154: Hoare triple {43925#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {43926#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:33,006 INFO L273 TraceCheckUtils]: 155: Hoare triple {43926#(<= main_~i~0 51)} assume !(~i~0 < 100000); {43876#false} is VALID [2018-11-23 12:00:33,006 INFO L273 TraceCheckUtils]: 156: Hoare triple {43876#false} havoc ~x~0;~x~0 := 0; {43876#false} is VALID [2018-11-23 12:00:33,006 INFO L273 TraceCheckUtils]: 157: Hoare triple {43876#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {43876#false} is VALID [2018-11-23 12:00:33,006 INFO L256 TraceCheckUtils]: 158: Hoare triple {43876#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {43876#false} is VALID [2018-11-23 12:00:33,006 INFO L273 TraceCheckUtils]: 159: Hoare triple {43876#false} ~cond := #in~cond; {43876#false} is VALID [2018-11-23 12:00:33,006 INFO L273 TraceCheckUtils]: 160: Hoare triple {43876#false} assume 0 == ~cond; {43876#false} is VALID [2018-11-23 12:00:33,007 INFO L273 TraceCheckUtils]: 161: Hoare triple {43876#false} assume !false; {43876#false} is VALID [2018-11-23 12:00:33,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:33,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:33,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 52] total 52 [2018-11-23 12:00:33,043 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 162 [2018-11-23 12:00:33,043 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:33,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states. [2018-11-23 12:00:33,204 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-23 12:00:33,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-11-23 12:00:33,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-11-23 12:00:33,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:00:33,206 INFO L87 Difference]: Start difference. First operand 222 states and 325 transitions. Second operand 52 states. [2018-11-23 12:00:34,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:34,577 INFO L93 Difference]: Finished difference Result 246 states and 357 transitions. [2018-11-23 12:00:34,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-11-23 12:00:34,577 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 162 [2018-11-23 12:00:34,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:34,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:00:34,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 357 transitions. [2018-11-23 12:00:34,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-23 12:00:34,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 357 transitions. [2018-11-23 12:00:34,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 357 transitions. [2018-11-23 12:00:34,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 357 edges. 357 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:34,934 INFO L225 Difference]: With dead ends: 246 [2018-11-23 12:00:34,934 INFO L226 Difference]: Without dead ends: 229 [2018-11-23 12:00:34,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-11-23 12:00:34,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-11-23 12:00:35,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-11-23 12:00:35,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:35,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand 226 states. [2018-11-23 12:00:35,249 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand 226 states. [2018-11-23 12:00:35,249 INFO L87 Difference]: Start difference. First operand 229 states. Second operand 226 states. [2018-11-23 12:00:35,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:35,253 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2018-11-23 12:00:35,253 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 336 transitions. [2018-11-23 12:00:35,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:35,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:35,253 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand 229 states. [2018-11-23 12:00:35,253 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 229 states. [2018-11-23 12:00:35,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:35,257 INFO L93 Difference]: Finished difference Result 229 states and 336 transitions. [2018-11-23 12:00:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 336 transitions. [2018-11-23 12:00:35,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:35,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:35,258 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:35,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-11-23 12:00:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 331 transitions. [2018-11-23 12:00:35,262 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 331 transitions. Word has length 162 [2018-11-23 12:00:35,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:35,262 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 331 transitions. [2018-11-23 12:00:35,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-11-23 12:00:35,262 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 331 transitions. [2018-11-23 12:00:35,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-11-23 12:00:35,263 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:35,263 INFO L402 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:35,263 INFO L423 AbstractCegarLoop]: === Iteration 52 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:35,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:35,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1353051452, now seen corresponding path program 50 times [2018-11-23 12:00:35,263 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:35,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:35,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:35,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:00:35,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:36,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {45467#true} call ULTIMATE.init(); {45467#true} is VALID [2018-11-23 12:00:36,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {45467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45467#true} is VALID [2018-11-23 12:00:36,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {45467#true} assume true; {45467#true} is VALID [2018-11-23 12:00:36,777 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45467#true} {45467#true} #88#return; {45467#true} is VALID [2018-11-23 12:00:36,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {45467#true} call #t~ret13 := main(); {45467#true} is VALID [2018-11-23 12:00:36,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {45467#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {45467#true} is VALID [2018-11-23 12:00:36,777 INFO L273 TraceCheckUtils]: 6: Hoare triple {45467#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {45467#true} is VALID [2018-11-23 12:00:36,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {45467#true} ~i~0 := 2; {45469#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:36,778 INFO L273 TraceCheckUtils]: 8: Hoare triple {45469#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45469#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:36,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {45469#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45469#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:36,779 INFO L273 TraceCheckUtils]: 10: Hoare triple {45469#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45470#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:36,779 INFO L273 TraceCheckUtils]: 11: Hoare triple {45470#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45470#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:36,780 INFO L273 TraceCheckUtils]: 12: Hoare triple {45470#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45470#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:36,780 INFO L273 TraceCheckUtils]: 13: Hoare triple {45470#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45471#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:36,780 INFO L273 TraceCheckUtils]: 14: Hoare triple {45471#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45471#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:36,781 INFO L273 TraceCheckUtils]: 15: Hoare triple {45471#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45471#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:36,781 INFO L273 TraceCheckUtils]: 16: Hoare triple {45471#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45472#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:36,782 INFO L273 TraceCheckUtils]: 17: Hoare triple {45472#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45472#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:36,782 INFO L273 TraceCheckUtils]: 18: Hoare triple {45472#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45472#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:36,783 INFO L273 TraceCheckUtils]: 19: Hoare triple {45472#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45473#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:36,784 INFO L273 TraceCheckUtils]: 20: Hoare triple {45473#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45473#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:36,784 INFO L273 TraceCheckUtils]: 21: Hoare triple {45473#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45473#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:36,785 INFO L273 TraceCheckUtils]: 22: Hoare triple {45473#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45474#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:36,785 INFO L273 TraceCheckUtils]: 23: Hoare triple {45474#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45474#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:36,786 INFO L273 TraceCheckUtils]: 24: Hoare triple {45474#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45474#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:36,787 INFO L273 TraceCheckUtils]: 25: Hoare triple {45474#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45475#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:36,787 INFO L273 TraceCheckUtils]: 26: Hoare triple {45475#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45475#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:36,788 INFO L273 TraceCheckUtils]: 27: Hoare triple {45475#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45475#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:36,788 INFO L273 TraceCheckUtils]: 28: Hoare triple {45475#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45476#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:36,789 INFO L273 TraceCheckUtils]: 29: Hoare triple {45476#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45476#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:36,789 INFO L273 TraceCheckUtils]: 30: Hoare triple {45476#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45476#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:36,790 INFO L273 TraceCheckUtils]: 31: Hoare triple {45476#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45477#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:36,790 INFO L273 TraceCheckUtils]: 32: Hoare triple {45477#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45477#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:36,791 INFO L273 TraceCheckUtils]: 33: Hoare triple {45477#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45477#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:36,792 INFO L273 TraceCheckUtils]: 34: Hoare triple {45477#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45478#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:36,792 INFO L273 TraceCheckUtils]: 35: Hoare triple {45478#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45478#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:36,793 INFO L273 TraceCheckUtils]: 36: Hoare triple {45478#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45478#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:36,793 INFO L273 TraceCheckUtils]: 37: Hoare triple {45478#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45479#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:36,794 INFO L273 TraceCheckUtils]: 38: Hoare triple {45479#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45479#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:36,794 INFO L273 TraceCheckUtils]: 39: Hoare triple {45479#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45479#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:36,795 INFO L273 TraceCheckUtils]: 40: Hoare triple {45479#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45480#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:36,796 INFO L273 TraceCheckUtils]: 41: Hoare triple {45480#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45480#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:36,796 INFO L273 TraceCheckUtils]: 42: Hoare triple {45480#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45480#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:36,797 INFO L273 TraceCheckUtils]: 43: Hoare triple {45480#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45481#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:36,797 INFO L273 TraceCheckUtils]: 44: Hoare triple {45481#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45481#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:36,798 INFO L273 TraceCheckUtils]: 45: Hoare triple {45481#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45481#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:36,799 INFO L273 TraceCheckUtils]: 46: Hoare triple {45481#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45482#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:36,799 INFO L273 TraceCheckUtils]: 47: Hoare triple {45482#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45482#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:36,800 INFO L273 TraceCheckUtils]: 48: Hoare triple {45482#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45482#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:36,800 INFO L273 TraceCheckUtils]: 49: Hoare triple {45482#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45483#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:36,801 INFO L273 TraceCheckUtils]: 50: Hoare triple {45483#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45483#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:36,801 INFO L273 TraceCheckUtils]: 51: Hoare triple {45483#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45483#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:36,802 INFO L273 TraceCheckUtils]: 52: Hoare triple {45483#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45484#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:36,803 INFO L273 TraceCheckUtils]: 53: Hoare triple {45484#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45484#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:36,803 INFO L273 TraceCheckUtils]: 54: Hoare triple {45484#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45484#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:36,804 INFO L273 TraceCheckUtils]: 55: Hoare triple {45484#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45485#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:36,804 INFO L273 TraceCheckUtils]: 56: Hoare triple {45485#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45485#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:36,805 INFO L273 TraceCheckUtils]: 57: Hoare triple {45485#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45485#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:36,805 INFO L273 TraceCheckUtils]: 58: Hoare triple {45485#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45486#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:36,806 INFO L273 TraceCheckUtils]: 59: Hoare triple {45486#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45486#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:36,806 INFO L273 TraceCheckUtils]: 60: Hoare triple {45486#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45486#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:36,807 INFO L273 TraceCheckUtils]: 61: Hoare triple {45486#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45487#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:36,808 INFO L273 TraceCheckUtils]: 62: Hoare triple {45487#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45487#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:36,808 INFO L273 TraceCheckUtils]: 63: Hoare triple {45487#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45487#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:36,809 INFO L273 TraceCheckUtils]: 64: Hoare triple {45487#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45488#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:36,809 INFO L273 TraceCheckUtils]: 65: Hoare triple {45488#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45488#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:36,810 INFO L273 TraceCheckUtils]: 66: Hoare triple {45488#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45488#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:36,811 INFO L273 TraceCheckUtils]: 67: Hoare triple {45488#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45489#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:36,811 INFO L273 TraceCheckUtils]: 68: Hoare triple {45489#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45489#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:36,812 INFO L273 TraceCheckUtils]: 69: Hoare triple {45489#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45489#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:36,812 INFO L273 TraceCheckUtils]: 70: Hoare triple {45489#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45490#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:36,813 INFO L273 TraceCheckUtils]: 71: Hoare triple {45490#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45490#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:36,813 INFO L273 TraceCheckUtils]: 72: Hoare triple {45490#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45490#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:36,814 INFO L273 TraceCheckUtils]: 73: Hoare triple {45490#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45491#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:36,815 INFO L273 TraceCheckUtils]: 74: Hoare triple {45491#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45491#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:36,815 INFO L273 TraceCheckUtils]: 75: Hoare triple {45491#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45491#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:36,816 INFO L273 TraceCheckUtils]: 76: Hoare triple {45491#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45492#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:36,816 INFO L273 TraceCheckUtils]: 77: Hoare triple {45492#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45492#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:36,817 INFO L273 TraceCheckUtils]: 78: Hoare triple {45492#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45492#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:36,818 INFO L273 TraceCheckUtils]: 79: Hoare triple {45492#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45493#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:36,818 INFO L273 TraceCheckUtils]: 80: Hoare triple {45493#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45493#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:36,819 INFO L273 TraceCheckUtils]: 81: Hoare triple {45493#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45493#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:36,819 INFO L273 TraceCheckUtils]: 82: Hoare triple {45493#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45494#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:36,820 INFO L273 TraceCheckUtils]: 83: Hoare triple {45494#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45494#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:36,820 INFO L273 TraceCheckUtils]: 84: Hoare triple {45494#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45494#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:36,821 INFO L273 TraceCheckUtils]: 85: Hoare triple {45494#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45495#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:36,821 INFO L273 TraceCheckUtils]: 86: Hoare triple {45495#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45495#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:36,822 INFO L273 TraceCheckUtils]: 87: Hoare triple {45495#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45495#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:36,823 INFO L273 TraceCheckUtils]: 88: Hoare triple {45495#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45496#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:36,823 INFO L273 TraceCheckUtils]: 89: Hoare triple {45496#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45496#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:36,824 INFO L273 TraceCheckUtils]: 90: Hoare triple {45496#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45496#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:36,824 INFO L273 TraceCheckUtils]: 91: Hoare triple {45496#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45497#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:36,825 INFO L273 TraceCheckUtils]: 92: Hoare triple {45497#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45497#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:36,825 INFO L273 TraceCheckUtils]: 93: Hoare triple {45497#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45497#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:36,826 INFO L273 TraceCheckUtils]: 94: Hoare triple {45497#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45498#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:36,827 INFO L273 TraceCheckUtils]: 95: Hoare triple {45498#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45498#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:36,827 INFO L273 TraceCheckUtils]: 96: Hoare triple {45498#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45498#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:36,828 INFO L273 TraceCheckUtils]: 97: Hoare triple {45498#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45499#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:36,828 INFO L273 TraceCheckUtils]: 98: Hoare triple {45499#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45499#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:36,829 INFO L273 TraceCheckUtils]: 99: Hoare triple {45499#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45499#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:36,829 INFO L273 TraceCheckUtils]: 100: Hoare triple {45499#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45500#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:36,830 INFO L273 TraceCheckUtils]: 101: Hoare triple {45500#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45500#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:36,831 INFO L273 TraceCheckUtils]: 102: Hoare triple {45500#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45500#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:36,831 INFO L273 TraceCheckUtils]: 103: Hoare triple {45500#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45501#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:36,832 INFO L273 TraceCheckUtils]: 104: Hoare triple {45501#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45501#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:36,832 INFO L273 TraceCheckUtils]: 105: Hoare triple {45501#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45501#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:36,833 INFO L273 TraceCheckUtils]: 106: Hoare triple {45501#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45502#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:36,833 INFO L273 TraceCheckUtils]: 107: Hoare triple {45502#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45502#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:36,834 INFO L273 TraceCheckUtils]: 108: Hoare triple {45502#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45502#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:36,835 INFO L273 TraceCheckUtils]: 109: Hoare triple {45502#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45503#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:36,835 INFO L273 TraceCheckUtils]: 110: Hoare triple {45503#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45503#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:36,836 INFO L273 TraceCheckUtils]: 111: Hoare triple {45503#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45503#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:36,836 INFO L273 TraceCheckUtils]: 112: Hoare triple {45503#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45504#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:36,837 INFO L273 TraceCheckUtils]: 113: Hoare triple {45504#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45504#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:36,837 INFO L273 TraceCheckUtils]: 114: Hoare triple {45504#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45504#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:36,838 INFO L273 TraceCheckUtils]: 115: Hoare triple {45504#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45505#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:36,839 INFO L273 TraceCheckUtils]: 116: Hoare triple {45505#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45505#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:36,839 INFO L273 TraceCheckUtils]: 117: Hoare triple {45505#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45505#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:36,840 INFO L273 TraceCheckUtils]: 118: Hoare triple {45505#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45506#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:36,840 INFO L273 TraceCheckUtils]: 119: Hoare triple {45506#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45506#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:36,841 INFO L273 TraceCheckUtils]: 120: Hoare triple {45506#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45506#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:36,841 INFO L273 TraceCheckUtils]: 121: Hoare triple {45506#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45507#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:36,842 INFO L273 TraceCheckUtils]: 122: Hoare triple {45507#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45507#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:36,843 INFO L273 TraceCheckUtils]: 123: Hoare triple {45507#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45507#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:36,843 INFO L273 TraceCheckUtils]: 124: Hoare triple {45507#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45508#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:36,844 INFO L273 TraceCheckUtils]: 125: Hoare triple {45508#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45508#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:36,844 INFO L273 TraceCheckUtils]: 126: Hoare triple {45508#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45508#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:36,845 INFO L273 TraceCheckUtils]: 127: Hoare triple {45508#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45509#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:36,845 INFO L273 TraceCheckUtils]: 128: Hoare triple {45509#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45509#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:36,846 INFO L273 TraceCheckUtils]: 129: Hoare triple {45509#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45509#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:36,847 INFO L273 TraceCheckUtils]: 130: Hoare triple {45509#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45510#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:36,847 INFO L273 TraceCheckUtils]: 131: Hoare triple {45510#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45510#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:36,848 INFO L273 TraceCheckUtils]: 132: Hoare triple {45510#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45510#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:36,848 INFO L273 TraceCheckUtils]: 133: Hoare triple {45510#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45511#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:36,849 INFO L273 TraceCheckUtils]: 134: Hoare triple {45511#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45511#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:36,849 INFO L273 TraceCheckUtils]: 135: Hoare triple {45511#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45511#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:36,850 INFO L273 TraceCheckUtils]: 136: Hoare triple {45511#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45512#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:36,851 INFO L273 TraceCheckUtils]: 137: Hoare triple {45512#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45512#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:36,851 INFO L273 TraceCheckUtils]: 138: Hoare triple {45512#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45512#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:36,852 INFO L273 TraceCheckUtils]: 139: Hoare triple {45512#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45513#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:36,852 INFO L273 TraceCheckUtils]: 140: Hoare triple {45513#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45513#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:36,853 INFO L273 TraceCheckUtils]: 141: Hoare triple {45513#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45513#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:36,853 INFO L273 TraceCheckUtils]: 142: Hoare triple {45513#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45514#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:36,854 INFO L273 TraceCheckUtils]: 143: Hoare triple {45514#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45514#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:36,854 INFO L273 TraceCheckUtils]: 144: Hoare triple {45514#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45514#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:36,855 INFO L273 TraceCheckUtils]: 145: Hoare triple {45514#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45515#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:36,856 INFO L273 TraceCheckUtils]: 146: Hoare triple {45515#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45515#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:36,856 INFO L273 TraceCheckUtils]: 147: Hoare triple {45515#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45515#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:36,857 INFO L273 TraceCheckUtils]: 148: Hoare triple {45515#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45516#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:36,857 INFO L273 TraceCheckUtils]: 149: Hoare triple {45516#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45516#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:36,858 INFO L273 TraceCheckUtils]: 150: Hoare triple {45516#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45516#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:36,859 INFO L273 TraceCheckUtils]: 151: Hoare triple {45516#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45517#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:36,859 INFO L273 TraceCheckUtils]: 152: Hoare triple {45517#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45517#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:36,860 INFO L273 TraceCheckUtils]: 153: Hoare triple {45517#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45517#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:36,860 INFO L273 TraceCheckUtils]: 154: Hoare triple {45517#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45518#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:36,861 INFO L273 TraceCheckUtils]: 155: Hoare triple {45518#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45518#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:36,861 INFO L273 TraceCheckUtils]: 156: Hoare triple {45518#(<= main_~i~0 51)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45518#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:36,862 INFO L273 TraceCheckUtils]: 157: Hoare triple {45518#(<= main_~i~0 51)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45519#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:36,863 INFO L273 TraceCheckUtils]: 158: Hoare triple {45519#(<= main_~i~0 52)} assume !(~i~0 < 100000); {45468#false} is VALID [2018-11-23 12:00:36,863 INFO L273 TraceCheckUtils]: 159: Hoare triple {45468#false} havoc ~x~0;~x~0 := 0; {45468#false} is VALID [2018-11-23 12:00:36,863 INFO L273 TraceCheckUtils]: 160: Hoare triple {45468#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {45468#false} is VALID [2018-11-23 12:00:36,863 INFO L256 TraceCheckUtils]: 161: Hoare triple {45468#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {45468#false} is VALID [2018-11-23 12:00:36,863 INFO L273 TraceCheckUtils]: 162: Hoare triple {45468#false} ~cond := #in~cond; {45468#false} is VALID [2018-11-23 12:00:36,864 INFO L273 TraceCheckUtils]: 163: Hoare triple {45468#false} assume 0 == ~cond; {45468#false} is VALID [2018-11-23 12:00:36,864 INFO L273 TraceCheckUtils]: 164: Hoare triple {45468#false} assume !false; {45468#false} is VALID [2018-11-23 12:00:36,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:36,882 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:36,882 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-23 12:00:36,892 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 12:00:36,979 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 12:00:36,979 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:37,017 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:37,587 INFO L256 TraceCheckUtils]: 0: Hoare triple {45467#true} call ULTIMATE.init(); {45467#true} is VALID [2018-11-23 12:00:37,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {45467#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {45467#true} is VALID [2018-11-23 12:00:37,587 INFO L273 TraceCheckUtils]: 2: Hoare triple {45467#true} assume true; {45467#true} is VALID [2018-11-23 12:00:37,587 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45467#true} {45467#true} #88#return; {45467#true} is VALID [2018-11-23 12:00:37,588 INFO L256 TraceCheckUtils]: 4: Hoare triple {45467#true} call #t~ret13 := main(); {45467#true} is VALID [2018-11-23 12:00:37,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {45467#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {45467#true} is VALID [2018-11-23 12:00:37,588 INFO L273 TraceCheckUtils]: 6: Hoare triple {45467#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {45467#true} is VALID [2018-11-23 12:00:37,588 INFO L273 TraceCheckUtils]: 7: Hoare triple {45467#true} ~i~0 := 2; {45469#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:37,589 INFO L273 TraceCheckUtils]: 8: Hoare triple {45469#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45469#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:37,589 INFO L273 TraceCheckUtils]: 9: Hoare triple {45469#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45469#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:37,589 INFO L273 TraceCheckUtils]: 10: Hoare triple {45469#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45470#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:37,590 INFO L273 TraceCheckUtils]: 11: Hoare triple {45470#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45470#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:37,590 INFO L273 TraceCheckUtils]: 12: Hoare triple {45470#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45470#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:37,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {45470#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45471#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:37,591 INFO L273 TraceCheckUtils]: 14: Hoare triple {45471#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45471#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:37,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {45471#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45471#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:37,592 INFO L273 TraceCheckUtils]: 16: Hoare triple {45471#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45472#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:37,593 INFO L273 TraceCheckUtils]: 17: Hoare triple {45472#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45472#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:37,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {45472#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45472#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:37,594 INFO L273 TraceCheckUtils]: 19: Hoare triple {45472#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45473#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:37,595 INFO L273 TraceCheckUtils]: 20: Hoare triple {45473#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45473#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:37,595 INFO L273 TraceCheckUtils]: 21: Hoare triple {45473#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45473#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:37,596 INFO L273 TraceCheckUtils]: 22: Hoare triple {45473#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45474#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:37,596 INFO L273 TraceCheckUtils]: 23: Hoare triple {45474#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45474#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:37,597 INFO L273 TraceCheckUtils]: 24: Hoare triple {45474#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45474#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:37,598 INFO L273 TraceCheckUtils]: 25: Hoare triple {45474#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45475#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:37,598 INFO L273 TraceCheckUtils]: 26: Hoare triple {45475#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45475#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:37,599 INFO L273 TraceCheckUtils]: 27: Hoare triple {45475#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45475#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:37,599 INFO L273 TraceCheckUtils]: 28: Hoare triple {45475#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45476#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:37,600 INFO L273 TraceCheckUtils]: 29: Hoare triple {45476#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45476#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:37,600 INFO L273 TraceCheckUtils]: 30: Hoare triple {45476#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45476#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:37,601 INFO L273 TraceCheckUtils]: 31: Hoare triple {45476#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45477#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:37,602 INFO L273 TraceCheckUtils]: 32: Hoare triple {45477#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45477#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:37,602 INFO L273 TraceCheckUtils]: 33: Hoare triple {45477#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45477#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:37,603 INFO L273 TraceCheckUtils]: 34: Hoare triple {45477#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45478#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:37,603 INFO L273 TraceCheckUtils]: 35: Hoare triple {45478#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45478#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:37,604 INFO L273 TraceCheckUtils]: 36: Hoare triple {45478#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45478#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:37,604 INFO L273 TraceCheckUtils]: 37: Hoare triple {45478#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45479#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:37,605 INFO L273 TraceCheckUtils]: 38: Hoare triple {45479#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45479#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:37,605 INFO L273 TraceCheckUtils]: 39: Hoare triple {45479#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45479#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:37,606 INFO L273 TraceCheckUtils]: 40: Hoare triple {45479#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45480#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:37,607 INFO L273 TraceCheckUtils]: 41: Hoare triple {45480#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45480#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:37,607 INFO L273 TraceCheckUtils]: 42: Hoare triple {45480#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45480#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:37,608 INFO L273 TraceCheckUtils]: 43: Hoare triple {45480#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45481#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:37,608 INFO L273 TraceCheckUtils]: 44: Hoare triple {45481#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45481#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:37,609 INFO L273 TraceCheckUtils]: 45: Hoare triple {45481#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45481#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:37,610 INFO L273 TraceCheckUtils]: 46: Hoare triple {45481#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45482#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:37,610 INFO L273 TraceCheckUtils]: 47: Hoare triple {45482#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45482#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:37,611 INFO L273 TraceCheckUtils]: 48: Hoare triple {45482#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45482#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:37,611 INFO L273 TraceCheckUtils]: 49: Hoare triple {45482#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45483#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:37,612 INFO L273 TraceCheckUtils]: 50: Hoare triple {45483#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45483#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:37,612 INFO L273 TraceCheckUtils]: 51: Hoare triple {45483#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45483#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:37,613 INFO L273 TraceCheckUtils]: 52: Hoare triple {45483#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45484#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:37,614 INFO L273 TraceCheckUtils]: 53: Hoare triple {45484#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45484#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:37,614 INFO L273 TraceCheckUtils]: 54: Hoare triple {45484#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45484#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:37,615 INFO L273 TraceCheckUtils]: 55: Hoare triple {45484#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45485#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:37,615 INFO L273 TraceCheckUtils]: 56: Hoare triple {45485#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45485#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:37,616 INFO L273 TraceCheckUtils]: 57: Hoare triple {45485#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45485#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:37,616 INFO L273 TraceCheckUtils]: 58: Hoare triple {45485#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45486#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:37,617 INFO L273 TraceCheckUtils]: 59: Hoare triple {45486#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45486#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:37,617 INFO L273 TraceCheckUtils]: 60: Hoare triple {45486#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45486#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:37,618 INFO L273 TraceCheckUtils]: 61: Hoare triple {45486#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45487#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:37,619 INFO L273 TraceCheckUtils]: 62: Hoare triple {45487#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45487#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:37,619 INFO L273 TraceCheckUtils]: 63: Hoare triple {45487#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45487#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:37,620 INFO L273 TraceCheckUtils]: 64: Hoare triple {45487#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45488#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:37,620 INFO L273 TraceCheckUtils]: 65: Hoare triple {45488#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45488#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:37,621 INFO L273 TraceCheckUtils]: 66: Hoare triple {45488#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45488#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:37,622 INFO L273 TraceCheckUtils]: 67: Hoare triple {45488#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45489#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:37,622 INFO L273 TraceCheckUtils]: 68: Hoare triple {45489#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45489#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:37,623 INFO L273 TraceCheckUtils]: 69: Hoare triple {45489#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45489#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:37,623 INFO L273 TraceCheckUtils]: 70: Hoare triple {45489#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45490#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:37,624 INFO L273 TraceCheckUtils]: 71: Hoare triple {45490#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45490#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:37,624 INFO L273 TraceCheckUtils]: 72: Hoare triple {45490#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45490#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:37,625 INFO L273 TraceCheckUtils]: 73: Hoare triple {45490#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45491#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:37,626 INFO L273 TraceCheckUtils]: 74: Hoare triple {45491#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45491#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:37,626 INFO L273 TraceCheckUtils]: 75: Hoare triple {45491#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45491#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:37,627 INFO L273 TraceCheckUtils]: 76: Hoare triple {45491#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45492#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:37,627 INFO L273 TraceCheckUtils]: 77: Hoare triple {45492#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45492#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:37,628 INFO L273 TraceCheckUtils]: 78: Hoare triple {45492#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45492#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:37,629 INFO L273 TraceCheckUtils]: 79: Hoare triple {45492#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45493#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:37,629 INFO L273 TraceCheckUtils]: 80: Hoare triple {45493#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45493#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:37,630 INFO L273 TraceCheckUtils]: 81: Hoare triple {45493#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45493#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:37,630 INFO L273 TraceCheckUtils]: 82: Hoare triple {45493#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45494#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:37,631 INFO L273 TraceCheckUtils]: 83: Hoare triple {45494#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45494#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:37,631 INFO L273 TraceCheckUtils]: 84: Hoare triple {45494#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45494#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:37,632 INFO L273 TraceCheckUtils]: 85: Hoare triple {45494#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45495#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:37,632 INFO L273 TraceCheckUtils]: 86: Hoare triple {45495#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45495#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:37,633 INFO L273 TraceCheckUtils]: 87: Hoare triple {45495#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45495#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:37,634 INFO L273 TraceCheckUtils]: 88: Hoare triple {45495#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45496#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:37,634 INFO L273 TraceCheckUtils]: 89: Hoare triple {45496#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45496#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:37,635 INFO L273 TraceCheckUtils]: 90: Hoare triple {45496#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45496#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:37,635 INFO L273 TraceCheckUtils]: 91: Hoare triple {45496#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45497#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:37,636 INFO L273 TraceCheckUtils]: 92: Hoare triple {45497#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45497#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:37,636 INFO L273 TraceCheckUtils]: 93: Hoare triple {45497#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45497#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:37,637 INFO L273 TraceCheckUtils]: 94: Hoare triple {45497#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45498#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:37,638 INFO L273 TraceCheckUtils]: 95: Hoare triple {45498#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45498#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:37,638 INFO L273 TraceCheckUtils]: 96: Hoare triple {45498#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45498#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:37,639 INFO L273 TraceCheckUtils]: 97: Hoare triple {45498#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45499#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:37,639 INFO L273 TraceCheckUtils]: 98: Hoare triple {45499#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45499#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:37,640 INFO L273 TraceCheckUtils]: 99: Hoare triple {45499#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45499#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:37,641 INFO L273 TraceCheckUtils]: 100: Hoare triple {45499#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45500#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:37,641 INFO L273 TraceCheckUtils]: 101: Hoare triple {45500#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45500#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:37,642 INFO L273 TraceCheckUtils]: 102: Hoare triple {45500#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45500#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:37,642 INFO L273 TraceCheckUtils]: 103: Hoare triple {45500#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45501#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:37,643 INFO L273 TraceCheckUtils]: 104: Hoare triple {45501#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45501#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:37,643 INFO L273 TraceCheckUtils]: 105: Hoare triple {45501#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45501#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:37,644 INFO L273 TraceCheckUtils]: 106: Hoare triple {45501#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45502#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:37,645 INFO L273 TraceCheckUtils]: 107: Hoare triple {45502#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45502#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:37,645 INFO L273 TraceCheckUtils]: 108: Hoare triple {45502#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45502#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:37,646 INFO L273 TraceCheckUtils]: 109: Hoare triple {45502#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45503#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:37,646 INFO L273 TraceCheckUtils]: 110: Hoare triple {45503#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45503#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:37,647 INFO L273 TraceCheckUtils]: 111: Hoare triple {45503#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45503#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:37,647 INFO L273 TraceCheckUtils]: 112: Hoare triple {45503#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45504#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:37,648 INFO L273 TraceCheckUtils]: 113: Hoare triple {45504#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45504#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:37,648 INFO L273 TraceCheckUtils]: 114: Hoare triple {45504#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45504#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:37,649 INFO L273 TraceCheckUtils]: 115: Hoare triple {45504#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45505#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:37,650 INFO L273 TraceCheckUtils]: 116: Hoare triple {45505#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45505#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:37,650 INFO L273 TraceCheckUtils]: 117: Hoare triple {45505#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45505#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:37,651 INFO L273 TraceCheckUtils]: 118: Hoare triple {45505#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45506#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:37,651 INFO L273 TraceCheckUtils]: 119: Hoare triple {45506#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45506#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:37,652 INFO L273 TraceCheckUtils]: 120: Hoare triple {45506#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45506#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:37,653 INFO L273 TraceCheckUtils]: 121: Hoare triple {45506#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45507#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:37,653 INFO L273 TraceCheckUtils]: 122: Hoare triple {45507#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45507#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:37,654 INFO L273 TraceCheckUtils]: 123: Hoare triple {45507#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45507#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:37,654 INFO L273 TraceCheckUtils]: 124: Hoare triple {45507#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45508#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:37,655 INFO L273 TraceCheckUtils]: 125: Hoare triple {45508#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45508#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:37,655 INFO L273 TraceCheckUtils]: 126: Hoare triple {45508#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45508#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:37,656 INFO L273 TraceCheckUtils]: 127: Hoare triple {45508#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45509#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:37,657 INFO L273 TraceCheckUtils]: 128: Hoare triple {45509#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45509#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:37,657 INFO L273 TraceCheckUtils]: 129: Hoare triple {45509#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45509#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:37,658 INFO L273 TraceCheckUtils]: 130: Hoare triple {45509#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45510#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:37,658 INFO L273 TraceCheckUtils]: 131: Hoare triple {45510#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45510#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:37,659 INFO L273 TraceCheckUtils]: 132: Hoare triple {45510#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45510#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:37,660 INFO L273 TraceCheckUtils]: 133: Hoare triple {45510#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45511#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:37,660 INFO L273 TraceCheckUtils]: 134: Hoare triple {45511#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45511#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:37,661 INFO L273 TraceCheckUtils]: 135: Hoare triple {45511#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45511#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:37,661 INFO L273 TraceCheckUtils]: 136: Hoare triple {45511#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45512#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:37,662 INFO L273 TraceCheckUtils]: 137: Hoare triple {45512#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45512#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:37,662 INFO L273 TraceCheckUtils]: 138: Hoare triple {45512#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45512#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:37,663 INFO L273 TraceCheckUtils]: 139: Hoare triple {45512#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45513#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:37,663 INFO L273 TraceCheckUtils]: 140: Hoare triple {45513#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45513#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:37,664 INFO L273 TraceCheckUtils]: 141: Hoare triple {45513#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45513#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:37,665 INFO L273 TraceCheckUtils]: 142: Hoare triple {45513#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45514#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:37,665 INFO L273 TraceCheckUtils]: 143: Hoare triple {45514#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45514#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:37,666 INFO L273 TraceCheckUtils]: 144: Hoare triple {45514#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45514#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:37,666 INFO L273 TraceCheckUtils]: 145: Hoare triple {45514#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45515#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:37,667 INFO L273 TraceCheckUtils]: 146: Hoare triple {45515#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45515#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:37,667 INFO L273 TraceCheckUtils]: 147: Hoare triple {45515#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45515#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:37,668 INFO L273 TraceCheckUtils]: 148: Hoare triple {45515#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45516#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:37,669 INFO L273 TraceCheckUtils]: 149: Hoare triple {45516#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45516#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:37,669 INFO L273 TraceCheckUtils]: 150: Hoare triple {45516#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45516#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:37,670 INFO L273 TraceCheckUtils]: 151: Hoare triple {45516#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45517#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:37,670 INFO L273 TraceCheckUtils]: 152: Hoare triple {45517#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45517#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:37,671 INFO L273 TraceCheckUtils]: 153: Hoare triple {45517#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45517#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:37,672 INFO L273 TraceCheckUtils]: 154: Hoare triple {45517#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45518#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:37,672 INFO L273 TraceCheckUtils]: 155: Hoare triple {45518#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {45518#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:37,673 INFO L273 TraceCheckUtils]: 156: Hoare triple {45518#(<= main_~i~0 51)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {45518#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:37,673 INFO L273 TraceCheckUtils]: 157: Hoare triple {45518#(<= main_~i~0 51)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {45519#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:37,674 INFO L273 TraceCheckUtils]: 158: Hoare triple {45519#(<= main_~i~0 52)} assume !(~i~0 < 100000); {45468#false} is VALID [2018-11-23 12:00:37,674 INFO L273 TraceCheckUtils]: 159: Hoare triple {45468#false} havoc ~x~0;~x~0 := 0; {45468#false} is VALID [2018-11-23 12:00:37,674 INFO L273 TraceCheckUtils]: 160: Hoare triple {45468#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {45468#false} is VALID [2018-11-23 12:00:37,675 INFO L256 TraceCheckUtils]: 161: Hoare triple {45468#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {45468#false} is VALID [2018-11-23 12:00:37,675 INFO L273 TraceCheckUtils]: 162: Hoare triple {45468#false} ~cond := #in~cond; {45468#false} is VALID [2018-11-23 12:00:37,675 INFO L273 TraceCheckUtils]: 163: Hoare triple {45468#false} assume 0 == ~cond; {45468#false} is VALID [2018-11-23 12:00:37,675 INFO L273 TraceCheckUtils]: 164: Hoare triple {45468#false} assume !false; {45468#false} is VALID [2018-11-23 12:00:37,692 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:37,711 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:37,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 53] total 53 [2018-11-23 12:00:37,711 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 165 [2018-11-23 12:00:37,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:37,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states. [2018-11-23 12:00:37,873 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:37,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-11-23 12:00:37,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-11-23 12:00:37,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 12:00:37,874 INFO L87 Difference]: Start difference. First operand 226 states and 331 transitions. Second operand 53 states. [2018-11-23 12:00:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:39,801 INFO L93 Difference]: Finished difference Result 250 states and 363 transitions. [2018-11-23 12:00:39,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-11-23 12:00:39,801 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 165 [2018-11-23 12:00:39,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:39,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:00:39,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 363 transitions. [2018-11-23 12:00:39,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-23 12:00:39,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 363 transitions. [2018-11-23 12:00:39,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 53 states and 363 transitions. [2018-11-23 12:00:40,218 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:40,223 INFO L225 Difference]: With dead ends: 250 [2018-11-23 12:00:40,223 INFO L226 Difference]: Without dead ends: 233 [2018-11-23 12:00:40,223 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-11-23 12:00:40,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-11-23 12:00:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2018-11-23 12:00:40,351 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:40,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand 230 states. [2018-11-23 12:00:40,351 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand 230 states. [2018-11-23 12:00:40,351 INFO L87 Difference]: Start difference. First operand 233 states. Second operand 230 states. [2018-11-23 12:00:40,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:40,355 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2018-11-23 12:00:40,355 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 342 transitions. [2018-11-23 12:00:40,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:40,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:40,356 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand 233 states. [2018-11-23 12:00:40,356 INFO L87 Difference]: Start difference. First operand 230 states. Second operand 233 states. [2018-11-23 12:00:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:40,360 INFO L93 Difference]: Finished difference Result 233 states and 342 transitions. [2018-11-23 12:00:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 342 transitions. [2018-11-23 12:00:40,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:40,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:40,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:40,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:40,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-11-23 12:00:40,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 337 transitions. [2018-11-23 12:00:40,364 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 337 transitions. Word has length 165 [2018-11-23 12:00:40,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:40,364 INFO L480 AbstractCegarLoop]: Abstraction has 230 states and 337 transitions. [2018-11-23 12:00:40,364 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-11-23 12:00:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 337 transitions. [2018-11-23 12:00:40,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-11-23 12:00:40,365 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:40,365 INFO L402 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:40,365 INFO L423 AbstractCegarLoop]: === Iteration 53 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:40,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:40,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1137515489, now seen corresponding path program 51 times [2018-11-23 12:00:40,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:40,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:40,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:40,366 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:40,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:40,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:41,678 INFO L256 TraceCheckUtils]: 0: Hoare triple {47087#true} call ULTIMATE.init(); {47087#true} is VALID [2018-11-23 12:00:41,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {47087#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47087#true} is VALID [2018-11-23 12:00:41,678 INFO L273 TraceCheckUtils]: 2: Hoare triple {47087#true} assume true; {47087#true} is VALID [2018-11-23 12:00:41,679 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47087#true} {47087#true} #88#return; {47087#true} is VALID [2018-11-23 12:00:41,679 INFO L256 TraceCheckUtils]: 4: Hoare triple {47087#true} call #t~ret13 := main(); {47087#true} is VALID [2018-11-23 12:00:41,679 INFO L273 TraceCheckUtils]: 5: Hoare triple {47087#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {47087#true} is VALID [2018-11-23 12:00:41,679 INFO L273 TraceCheckUtils]: 6: Hoare triple {47087#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {47087#true} is VALID [2018-11-23 12:00:41,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {47087#true} ~i~0 := 2; {47089#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:41,680 INFO L273 TraceCheckUtils]: 8: Hoare triple {47089#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47089#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:41,680 INFO L273 TraceCheckUtils]: 9: Hoare triple {47089#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47089#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:41,681 INFO L273 TraceCheckUtils]: 10: Hoare triple {47089#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47090#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:41,681 INFO L273 TraceCheckUtils]: 11: Hoare triple {47090#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47090#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:41,681 INFO L273 TraceCheckUtils]: 12: Hoare triple {47090#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47090#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:41,682 INFO L273 TraceCheckUtils]: 13: Hoare triple {47090#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47091#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:41,682 INFO L273 TraceCheckUtils]: 14: Hoare triple {47091#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47091#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:41,682 INFO L273 TraceCheckUtils]: 15: Hoare triple {47091#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47091#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:41,683 INFO L273 TraceCheckUtils]: 16: Hoare triple {47091#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47092#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:41,683 INFO L273 TraceCheckUtils]: 17: Hoare triple {47092#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47092#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:41,684 INFO L273 TraceCheckUtils]: 18: Hoare triple {47092#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47092#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:41,685 INFO L273 TraceCheckUtils]: 19: Hoare triple {47092#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47093#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:41,685 INFO L273 TraceCheckUtils]: 20: Hoare triple {47093#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47093#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:41,686 INFO L273 TraceCheckUtils]: 21: Hoare triple {47093#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47093#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:41,686 INFO L273 TraceCheckUtils]: 22: Hoare triple {47093#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47094#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:41,687 INFO L273 TraceCheckUtils]: 23: Hoare triple {47094#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47094#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:41,687 INFO L273 TraceCheckUtils]: 24: Hoare triple {47094#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47094#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:41,688 INFO L273 TraceCheckUtils]: 25: Hoare triple {47094#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47095#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:41,689 INFO L273 TraceCheckUtils]: 26: Hoare triple {47095#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47095#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:41,689 INFO L273 TraceCheckUtils]: 27: Hoare triple {47095#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47095#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:41,690 INFO L273 TraceCheckUtils]: 28: Hoare triple {47095#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47096#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:41,690 INFO L273 TraceCheckUtils]: 29: Hoare triple {47096#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47096#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:41,691 INFO L273 TraceCheckUtils]: 30: Hoare triple {47096#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47096#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:41,691 INFO L273 TraceCheckUtils]: 31: Hoare triple {47096#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47097#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:41,692 INFO L273 TraceCheckUtils]: 32: Hoare triple {47097#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47097#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:41,692 INFO L273 TraceCheckUtils]: 33: Hoare triple {47097#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47097#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:41,693 INFO L273 TraceCheckUtils]: 34: Hoare triple {47097#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47098#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:41,695 INFO L273 TraceCheckUtils]: 35: Hoare triple {47098#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47098#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:41,696 INFO L273 TraceCheckUtils]: 36: Hoare triple {47098#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47098#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:41,697 INFO L273 TraceCheckUtils]: 37: Hoare triple {47098#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47099#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:41,697 INFO L273 TraceCheckUtils]: 38: Hoare triple {47099#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47099#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:41,698 INFO L273 TraceCheckUtils]: 39: Hoare triple {47099#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47099#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:41,698 INFO L273 TraceCheckUtils]: 40: Hoare triple {47099#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47100#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:41,698 INFO L273 TraceCheckUtils]: 41: Hoare triple {47100#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47100#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:41,699 INFO L273 TraceCheckUtils]: 42: Hoare triple {47100#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47100#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:41,699 INFO L273 TraceCheckUtils]: 43: Hoare triple {47100#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47101#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:41,700 INFO L273 TraceCheckUtils]: 44: Hoare triple {47101#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47101#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:41,700 INFO L273 TraceCheckUtils]: 45: Hoare triple {47101#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47101#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:41,700 INFO L273 TraceCheckUtils]: 46: Hoare triple {47101#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47102#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:41,701 INFO L273 TraceCheckUtils]: 47: Hoare triple {47102#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47102#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:41,701 INFO L273 TraceCheckUtils]: 48: Hoare triple {47102#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47102#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:41,702 INFO L273 TraceCheckUtils]: 49: Hoare triple {47102#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47103#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:41,703 INFO L273 TraceCheckUtils]: 50: Hoare triple {47103#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47103#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:41,703 INFO L273 TraceCheckUtils]: 51: Hoare triple {47103#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47103#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:41,704 INFO L273 TraceCheckUtils]: 52: Hoare triple {47103#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47104#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:41,704 INFO L273 TraceCheckUtils]: 53: Hoare triple {47104#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47104#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:41,705 INFO L273 TraceCheckUtils]: 54: Hoare triple {47104#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47104#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:41,706 INFO L273 TraceCheckUtils]: 55: Hoare triple {47104#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47105#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:41,706 INFO L273 TraceCheckUtils]: 56: Hoare triple {47105#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47105#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:41,707 INFO L273 TraceCheckUtils]: 57: Hoare triple {47105#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47105#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:41,707 INFO L273 TraceCheckUtils]: 58: Hoare triple {47105#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47106#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:41,708 INFO L273 TraceCheckUtils]: 59: Hoare triple {47106#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47106#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:41,708 INFO L273 TraceCheckUtils]: 60: Hoare triple {47106#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47106#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:41,709 INFO L273 TraceCheckUtils]: 61: Hoare triple {47106#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47107#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:41,710 INFO L273 TraceCheckUtils]: 62: Hoare triple {47107#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47107#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:41,710 INFO L273 TraceCheckUtils]: 63: Hoare triple {47107#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47107#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:41,711 INFO L273 TraceCheckUtils]: 64: Hoare triple {47107#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47108#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:41,711 INFO L273 TraceCheckUtils]: 65: Hoare triple {47108#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47108#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:41,712 INFO L273 TraceCheckUtils]: 66: Hoare triple {47108#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47108#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:41,713 INFO L273 TraceCheckUtils]: 67: Hoare triple {47108#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47109#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:41,713 INFO L273 TraceCheckUtils]: 68: Hoare triple {47109#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47109#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:41,714 INFO L273 TraceCheckUtils]: 69: Hoare triple {47109#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47109#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:41,714 INFO L273 TraceCheckUtils]: 70: Hoare triple {47109#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47110#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:41,715 INFO L273 TraceCheckUtils]: 71: Hoare triple {47110#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47110#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:41,715 INFO L273 TraceCheckUtils]: 72: Hoare triple {47110#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47110#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:41,716 INFO L273 TraceCheckUtils]: 73: Hoare triple {47110#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47111#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:41,717 INFO L273 TraceCheckUtils]: 74: Hoare triple {47111#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47111#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:41,717 INFO L273 TraceCheckUtils]: 75: Hoare triple {47111#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47111#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:41,718 INFO L273 TraceCheckUtils]: 76: Hoare triple {47111#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47112#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:41,718 INFO L273 TraceCheckUtils]: 77: Hoare triple {47112#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47112#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:41,719 INFO L273 TraceCheckUtils]: 78: Hoare triple {47112#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47112#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:41,719 INFO L273 TraceCheckUtils]: 79: Hoare triple {47112#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47113#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:41,720 INFO L273 TraceCheckUtils]: 80: Hoare triple {47113#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47113#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:41,720 INFO L273 TraceCheckUtils]: 81: Hoare triple {47113#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47113#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:41,721 INFO L273 TraceCheckUtils]: 82: Hoare triple {47113#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47114#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:41,722 INFO L273 TraceCheckUtils]: 83: Hoare triple {47114#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47114#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:41,722 INFO L273 TraceCheckUtils]: 84: Hoare triple {47114#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47114#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:41,723 INFO L273 TraceCheckUtils]: 85: Hoare triple {47114#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47115#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:41,723 INFO L273 TraceCheckUtils]: 86: Hoare triple {47115#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47115#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:41,724 INFO L273 TraceCheckUtils]: 87: Hoare triple {47115#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47115#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:41,725 INFO L273 TraceCheckUtils]: 88: Hoare triple {47115#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47116#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:41,725 INFO L273 TraceCheckUtils]: 89: Hoare triple {47116#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47116#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:41,726 INFO L273 TraceCheckUtils]: 90: Hoare triple {47116#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47116#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:41,726 INFO L273 TraceCheckUtils]: 91: Hoare triple {47116#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47117#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:41,727 INFO L273 TraceCheckUtils]: 92: Hoare triple {47117#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47117#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:41,727 INFO L273 TraceCheckUtils]: 93: Hoare triple {47117#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47117#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:41,728 INFO L273 TraceCheckUtils]: 94: Hoare triple {47117#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47118#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:41,729 INFO L273 TraceCheckUtils]: 95: Hoare triple {47118#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47118#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:41,729 INFO L273 TraceCheckUtils]: 96: Hoare triple {47118#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47118#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:41,730 INFO L273 TraceCheckUtils]: 97: Hoare triple {47118#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47119#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:41,730 INFO L273 TraceCheckUtils]: 98: Hoare triple {47119#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47119#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:41,731 INFO L273 TraceCheckUtils]: 99: Hoare triple {47119#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47119#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:41,732 INFO L273 TraceCheckUtils]: 100: Hoare triple {47119#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47120#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:41,732 INFO L273 TraceCheckUtils]: 101: Hoare triple {47120#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47120#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:41,733 INFO L273 TraceCheckUtils]: 102: Hoare triple {47120#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47120#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:41,733 INFO L273 TraceCheckUtils]: 103: Hoare triple {47120#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47121#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:41,734 INFO L273 TraceCheckUtils]: 104: Hoare triple {47121#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47121#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:41,734 INFO L273 TraceCheckUtils]: 105: Hoare triple {47121#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47121#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:41,735 INFO L273 TraceCheckUtils]: 106: Hoare triple {47121#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47122#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:41,735 INFO L273 TraceCheckUtils]: 107: Hoare triple {47122#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47122#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:41,736 INFO L273 TraceCheckUtils]: 108: Hoare triple {47122#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47122#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:41,737 INFO L273 TraceCheckUtils]: 109: Hoare triple {47122#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47123#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:41,737 INFO L273 TraceCheckUtils]: 110: Hoare triple {47123#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47123#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:41,738 INFO L273 TraceCheckUtils]: 111: Hoare triple {47123#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47123#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:41,738 INFO L273 TraceCheckUtils]: 112: Hoare triple {47123#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47124#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:41,739 INFO L273 TraceCheckUtils]: 113: Hoare triple {47124#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47124#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:41,739 INFO L273 TraceCheckUtils]: 114: Hoare triple {47124#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47124#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:41,740 INFO L273 TraceCheckUtils]: 115: Hoare triple {47124#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47125#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:41,741 INFO L273 TraceCheckUtils]: 116: Hoare triple {47125#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47125#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:41,741 INFO L273 TraceCheckUtils]: 117: Hoare triple {47125#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47125#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:41,742 INFO L273 TraceCheckUtils]: 118: Hoare triple {47125#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47126#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:41,742 INFO L273 TraceCheckUtils]: 119: Hoare triple {47126#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47126#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:41,743 INFO L273 TraceCheckUtils]: 120: Hoare triple {47126#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47126#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:41,744 INFO L273 TraceCheckUtils]: 121: Hoare triple {47126#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47127#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:41,744 INFO L273 TraceCheckUtils]: 122: Hoare triple {47127#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47127#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:41,745 INFO L273 TraceCheckUtils]: 123: Hoare triple {47127#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47127#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:41,745 INFO L273 TraceCheckUtils]: 124: Hoare triple {47127#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47128#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:41,746 INFO L273 TraceCheckUtils]: 125: Hoare triple {47128#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47128#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:41,746 INFO L273 TraceCheckUtils]: 126: Hoare triple {47128#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47128#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:41,747 INFO L273 TraceCheckUtils]: 127: Hoare triple {47128#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47129#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:41,747 INFO L273 TraceCheckUtils]: 128: Hoare triple {47129#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47129#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:41,748 INFO L273 TraceCheckUtils]: 129: Hoare triple {47129#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47129#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:41,749 INFO L273 TraceCheckUtils]: 130: Hoare triple {47129#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47130#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:41,749 INFO L273 TraceCheckUtils]: 131: Hoare triple {47130#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47130#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:41,750 INFO L273 TraceCheckUtils]: 132: Hoare triple {47130#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47130#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:41,750 INFO L273 TraceCheckUtils]: 133: Hoare triple {47130#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47131#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:41,751 INFO L273 TraceCheckUtils]: 134: Hoare triple {47131#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47131#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:41,751 INFO L273 TraceCheckUtils]: 135: Hoare triple {47131#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47131#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:41,752 INFO L273 TraceCheckUtils]: 136: Hoare triple {47131#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47132#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:41,753 INFO L273 TraceCheckUtils]: 137: Hoare triple {47132#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47132#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:41,753 INFO L273 TraceCheckUtils]: 138: Hoare triple {47132#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47132#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:41,754 INFO L273 TraceCheckUtils]: 139: Hoare triple {47132#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47133#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:41,754 INFO L273 TraceCheckUtils]: 140: Hoare triple {47133#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47133#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:41,755 INFO L273 TraceCheckUtils]: 141: Hoare triple {47133#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47133#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:41,756 INFO L273 TraceCheckUtils]: 142: Hoare triple {47133#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47134#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:41,756 INFO L273 TraceCheckUtils]: 143: Hoare triple {47134#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47134#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:41,757 INFO L273 TraceCheckUtils]: 144: Hoare triple {47134#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47134#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:41,757 INFO L273 TraceCheckUtils]: 145: Hoare triple {47134#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47135#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:41,758 INFO L273 TraceCheckUtils]: 146: Hoare triple {47135#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47135#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:41,758 INFO L273 TraceCheckUtils]: 147: Hoare triple {47135#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47135#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:41,759 INFO L273 TraceCheckUtils]: 148: Hoare triple {47135#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47136#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:41,759 INFO L273 TraceCheckUtils]: 149: Hoare triple {47136#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47136#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:41,760 INFO L273 TraceCheckUtils]: 150: Hoare triple {47136#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47136#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:41,761 INFO L273 TraceCheckUtils]: 151: Hoare triple {47136#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47137#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:41,761 INFO L273 TraceCheckUtils]: 152: Hoare triple {47137#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47137#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:41,762 INFO L273 TraceCheckUtils]: 153: Hoare triple {47137#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47137#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:41,762 INFO L273 TraceCheckUtils]: 154: Hoare triple {47137#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47138#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:41,763 INFO L273 TraceCheckUtils]: 155: Hoare triple {47138#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47138#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:41,763 INFO L273 TraceCheckUtils]: 156: Hoare triple {47138#(<= main_~i~0 51)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47138#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:41,764 INFO L273 TraceCheckUtils]: 157: Hoare triple {47138#(<= main_~i~0 51)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47139#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:41,765 INFO L273 TraceCheckUtils]: 158: Hoare triple {47139#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47139#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:41,765 INFO L273 TraceCheckUtils]: 159: Hoare triple {47139#(<= main_~i~0 52)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47139#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:41,766 INFO L273 TraceCheckUtils]: 160: Hoare triple {47139#(<= main_~i~0 52)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47140#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:41,766 INFO L273 TraceCheckUtils]: 161: Hoare triple {47140#(<= main_~i~0 53)} assume !(~i~0 < 100000); {47088#false} is VALID [2018-11-23 12:00:41,767 INFO L273 TraceCheckUtils]: 162: Hoare triple {47088#false} havoc ~x~0;~x~0 := 0; {47088#false} is VALID [2018-11-23 12:00:41,767 INFO L273 TraceCheckUtils]: 163: Hoare triple {47088#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {47088#false} is VALID [2018-11-23 12:00:41,767 INFO L256 TraceCheckUtils]: 164: Hoare triple {47088#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {47088#false} is VALID [2018-11-23 12:00:41,767 INFO L273 TraceCheckUtils]: 165: Hoare triple {47088#false} ~cond := #in~cond; {47088#false} is VALID [2018-11-23 12:00:41,767 INFO L273 TraceCheckUtils]: 166: Hoare triple {47088#false} assume 0 == ~cond; {47088#false} is VALID [2018-11-23 12:00:41,768 INFO L273 TraceCheckUtils]: 167: Hoare triple {47088#false} assume !false; {47088#false} is VALID [2018-11-23 12:00:41,785 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:41,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:41,786 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-23 12:00:41,795 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 12:00:41,953 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 52 check-sat command(s) [2018-11-23 12:00:41,953 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:41,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:41,994 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:42,635 INFO L256 TraceCheckUtils]: 0: Hoare triple {47087#true} call ULTIMATE.init(); {47087#true} is VALID [2018-11-23 12:00:42,635 INFO L273 TraceCheckUtils]: 1: Hoare triple {47087#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {47087#true} is VALID [2018-11-23 12:00:42,635 INFO L273 TraceCheckUtils]: 2: Hoare triple {47087#true} assume true; {47087#true} is VALID [2018-11-23 12:00:42,635 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {47087#true} {47087#true} #88#return; {47087#true} is VALID [2018-11-23 12:00:42,636 INFO L256 TraceCheckUtils]: 4: Hoare triple {47087#true} call #t~ret13 := main(); {47087#true} is VALID [2018-11-23 12:00:42,636 INFO L273 TraceCheckUtils]: 5: Hoare triple {47087#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {47087#true} is VALID [2018-11-23 12:00:42,636 INFO L273 TraceCheckUtils]: 6: Hoare triple {47087#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {47087#true} is VALID [2018-11-23 12:00:42,636 INFO L273 TraceCheckUtils]: 7: Hoare triple {47087#true} ~i~0 := 2; {47089#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:42,637 INFO L273 TraceCheckUtils]: 8: Hoare triple {47089#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47089#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:42,637 INFO L273 TraceCheckUtils]: 9: Hoare triple {47089#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47089#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:42,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {47089#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47090#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:42,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {47090#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47090#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:42,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {47090#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47090#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:42,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {47090#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47091#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:42,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {47091#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47091#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:42,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {47091#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47091#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:42,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {47091#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47092#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:42,642 INFO L273 TraceCheckUtils]: 17: Hoare triple {47092#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47092#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:42,642 INFO L273 TraceCheckUtils]: 18: Hoare triple {47092#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47092#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:42,643 INFO L273 TraceCheckUtils]: 19: Hoare triple {47092#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47093#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:42,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {47093#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47093#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:42,644 INFO L273 TraceCheckUtils]: 21: Hoare triple {47093#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47093#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:42,645 INFO L273 TraceCheckUtils]: 22: Hoare triple {47093#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47094#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:42,645 INFO L273 TraceCheckUtils]: 23: Hoare triple {47094#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47094#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:42,646 INFO L273 TraceCheckUtils]: 24: Hoare triple {47094#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47094#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:42,646 INFO L273 TraceCheckUtils]: 25: Hoare triple {47094#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47095#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:42,647 INFO L273 TraceCheckUtils]: 26: Hoare triple {47095#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47095#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:42,647 INFO L273 TraceCheckUtils]: 27: Hoare triple {47095#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47095#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:42,648 INFO L273 TraceCheckUtils]: 28: Hoare triple {47095#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47096#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:42,648 INFO L273 TraceCheckUtils]: 29: Hoare triple {47096#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47096#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:42,649 INFO L273 TraceCheckUtils]: 30: Hoare triple {47096#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47096#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:42,650 INFO L273 TraceCheckUtils]: 31: Hoare triple {47096#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47097#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:42,650 INFO L273 TraceCheckUtils]: 32: Hoare triple {47097#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47097#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:42,651 INFO L273 TraceCheckUtils]: 33: Hoare triple {47097#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47097#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:42,651 INFO L273 TraceCheckUtils]: 34: Hoare triple {47097#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47098#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:42,652 INFO L273 TraceCheckUtils]: 35: Hoare triple {47098#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47098#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:42,652 INFO L273 TraceCheckUtils]: 36: Hoare triple {47098#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47098#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:42,653 INFO L273 TraceCheckUtils]: 37: Hoare triple {47098#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47099#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:42,654 INFO L273 TraceCheckUtils]: 38: Hoare triple {47099#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47099#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:42,654 INFO L273 TraceCheckUtils]: 39: Hoare triple {47099#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47099#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:42,655 INFO L273 TraceCheckUtils]: 40: Hoare triple {47099#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47100#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:42,655 INFO L273 TraceCheckUtils]: 41: Hoare triple {47100#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47100#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:42,656 INFO L273 TraceCheckUtils]: 42: Hoare triple {47100#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47100#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:42,657 INFO L273 TraceCheckUtils]: 43: Hoare triple {47100#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47101#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:42,657 INFO L273 TraceCheckUtils]: 44: Hoare triple {47101#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47101#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:42,658 INFO L273 TraceCheckUtils]: 45: Hoare triple {47101#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47101#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:42,658 INFO L273 TraceCheckUtils]: 46: Hoare triple {47101#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47102#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:42,659 INFO L273 TraceCheckUtils]: 47: Hoare triple {47102#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47102#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:42,659 INFO L273 TraceCheckUtils]: 48: Hoare triple {47102#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47102#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:42,660 INFO L273 TraceCheckUtils]: 49: Hoare triple {47102#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47103#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:42,660 INFO L273 TraceCheckUtils]: 50: Hoare triple {47103#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47103#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:42,661 INFO L273 TraceCheckUtils]: 51: Hoare triple {47103#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47103#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:42,662 INFO L273 TraceCheckUtils]: 52: Hoare triple {47103#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47104#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:42,662 INFO L273 TraceCheckUtils]: 53: Hoare triple {47104#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47104#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:42,663 INFO L273 TraceCheckUtils]: 54: Hoare triple {47104#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47104#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:42,663 INFO L273 TraceCheckUtils]: 55: Hoare triple {47104#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47105#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:42,664 INFO L273 TraceCheckUtils]: 56: Hoare triple {47105#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47105#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:42,664 INFO L273 TraceCheckUtils]: 57: Hoare triple {47105#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47105#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:42,665 INFO L273 TraceCheckUtils]: 58: Hoare triple {47105#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47106#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:42,665 INFO L273 TraceCheckUtils]: 59: Hoare triple {47106#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47106#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:42,666 INFO L273 TraceCheckUtils]: 60: Hoare triple {47106#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47106#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:42,666 INFO L273 TraceCheckUtils]: 61: Hoare triple {47106#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47107#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:42,667 INFO L273 TraceCheckUtils]: 62: Hoare triple {47107#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47107#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:42,667 INFO L273 TraceCheckUtils]: 63: Hoare triple {47107#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47107#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:42,668 INFO L273 TraceCheckUtils]: 64: Hoare triple {47107#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47108#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:42,669 INFO L273 TraceCheckUtils]: 65: Hoare triple {47108#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47108#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:42,669 INFO L273 TraceCheckUtils]: 66: Hoare triple {47108#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47108#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:42,670 INFO L273 TraceCheckUtils]: 67: Hoare triple {47108#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47109#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:42,670 INFO L273 TraceCheckUtils]: 68: Hoare triple {47109#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47109#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:42,671 INFO L273 TraceCheckUtils]: 69: Hoare triple {47109#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47109#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:42,671 INFO L273 TraceCheckUtils]: 70: Hoare triple {47109#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47110#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:42,672 INFO L273 TraceCheckUtils]: 71: Hoare triple {47110#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47110#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:42,672 INFO L273 TraceCheckUtils]: 72: Hoare triple {47110#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47110#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:42,673 INFO L273 TraceCheckUtils]: 73: Hoare triple {47110#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47111#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:42,673 INFO L273 TraceCheckUtils]: 74: Hoare triple {47111#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47111#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:42,674 INFO L273 TraceCheckUtils]: 75: Hoare triple {47111#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47111#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:42,675 INFO L273 TraceCheckUtils]: 76: Hoare triple {47111#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47112#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:42,675 INFO L273 TraceCheckUtils]: 77: Hoare triple {47112#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47112#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:42,676 INFO L273 TraceCheckUtils]: 78: Hoare triple {47112#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47112#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:42,676 INFO L273 TraceCheckUtils]: 79: Hoare triple {47112#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47113#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:42,677 INFO L273 TraceCheckUtils]: 80: Hoare triple {47113#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47113#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:42,677 INFO L273 TraceCheckUtils]: 81: Hoare triple {47113#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47113#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:42,678 INFO L273 TraceCheckUtils]: 82: Hoare triple {47113#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47114#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:42,678 INFO L273 TraceCheckUtils]: 83: Hoare triple {47114#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47114#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:42,679 INFO L273 TraceCheckUtils]: 84: Hoare triple {47114#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47114#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:42,679 INFO L273 TraceCheckUtils]: 85: Hoare triple {47114#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47115#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:42,680 INFO L273 TraceCheckUtils]: 86: Hoare triple {47115#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47115#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:42,680 INFO L273 TraceCheckUtils]: 87: Hoare triple {47115#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47115#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:42,681 INFO L273 TraceCheckUtils]: 88: Hoare triple {47115#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47116#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:42,682 INFO L273 TraceCheckUtils]: 89: Hoare triple {47116#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47116#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:42,682 INFO L273 TraceCheckUtils]: 90: Hoare triple {47116#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47116#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:42,683 INFO L273 TraceCheckUtils]: 91: Hoare triple {47116#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47117#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:42,683 INFO L273 TraceCheckUtils]: 92: Hoare triple {47117#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47117#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:42,684 INFO L273 TraceCheckUtils]: 93: Hoare triple {47117#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47117#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:42,684 INFO L273 TraceCheckUtils]: 94: Hoare triple {47117#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47118#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:42,685 INFO L273 TraceCheckUtils]: 95: Hoare triple {47118#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47118#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:42,685 INFO L273 TraceCheckUtils]: 96: Hoare triple {47118#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47118#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:42,686 INFO L273 TraceCheckUtils]: 97: Hoare triple {47118#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47119#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:42,687 INFO L273 TraceCheckUtils]: 98: Hoare triple {47119#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47119#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:42,687 INFO L273 TraceCheckUtils]: 99: Hoare triple {47119#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47119#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:42,688 INFO L273 TraceCheckUtils]: 100: Hoare triple {47119#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47120#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:42,688 INFO L273 TraceCheckUtils]: 101: Hoare triple {47120#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47120#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:42,689 INFO L273 TraceCheckUtils]: 102: Hoare triple {47120#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47120#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:42,690 INFO L273 TraceCheckUtils]: 103: Hoare triple {47120#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47121#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:42,690 INFO L273 TraceCheckUtils]: 104: Hoare triple {47121#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47121#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:42,691 INFO L273 TraceCheckUtils]: 105: Hoare triple {47121#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47121#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:42,691 INFO L273 TraceCheckUtils]: 106: Hoare triple {47121#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47122#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:42,692 INFO L273 TraceCheckUtils]: 107: Hoare triple {47122#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47122#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:42,692 INFO L273 TraceCheckUtils]: 108: Hoare triple {47122#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47122#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:42,693 INFO L273 TraceCheckUtils]: 109: Hoare triple {47122#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47123#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:42,693 INFO L273 TraceCheckUtils]: 110: Hoare triple {47123#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47123#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:42,694 INFO L273 TraceCheckUtils]: 111: Hoare triple {47123#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47123#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:42,694 INFO L273 TraceCheckUtils]: 112: Hoare triple {47123#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47124#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:42,695 INFO L273 TraceCheckUtils]: 113: Hoare triple {47124#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47124#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:42,695 INFO L273 TraceCheckUtils]: 114: Hoare triple {47124#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47124#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:42,696 INFO L273 TraceCheckUtils]: 115: Hoare triple {47124#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47125#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:42,697 INFO L273 TraceCheckUtils]: 116: Hoare triple {47125#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47125#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:42,697 INFO L273 TraceCheckUtils]: 117: Hoare triple {47125#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47125#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:42,698 INFO L273 TraceCheckUtils]: 118: Hoare triple {47125#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47126#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:42,698 INFO L273 TraceCheckUtils]: 119: Hoare triple {47126#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47126#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:42,699 INFO L273 TraceCheckUtils]: 120: Hoare triple {47126#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47126#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:42,699 INFO L273 TraceCheckUtils]: 121: Hoare triple {47126#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47127#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:42,700 INFO L273 TraceCheckUtils]: 122: Hoare triple {47127#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47127#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:42,700 INFO L273 TraceCheckUtils]: 123: Hoare triple {47127#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47127#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:42,701 INFO L273 TraceCheckUtils]: 124: Hoare triple {47127#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47128#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:42,702 INFO L273 TraceCheckUtils]: 125: Hoare triple {47128#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47128#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:42,702 INFO L273 TraceCheckUtils]: 126: Hoare triple {47128#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47128#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:42,703 INFO L273 TraceCheckUtils]: 127: Hoare triple {47128#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47129#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:42,703 INFO L273 TraceCheckUtils]: 128: Hoare triple {47129#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47129#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:42,704 INFO L273 TraceCheckUtils]: 129: Hoare triple {47129#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47129#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:42,704 INFO L273 TraceCheckUtils]: 130: Hoare triple {47129#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47130#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:42,705 INFO L273 TraceCheckUtils]: 131: Hoare triple {47130#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47130#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:42,705 INFO L273 TraceCheckUtils]: 132: Hoare triple {47130#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47130#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:42,706 INFO L273 TraceCheckUtils]: 133: Hoare triple {47130#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47131#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:42,706 INFO L273 TraceCheckUtils]: 134: Hoare triple {47131#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47131#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:42,707 INFO L273 TraceCheckUtils]: 135: Hoare triple {47131#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47131#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:42,708 INFO L273 TraceCheckUtils]: 136: Hoare triple {47131#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47132#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:42,708 INFO L273 TraceCheckUtils]: 137: Hoare triple {47132#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47132#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:42,709 INFO L273 TraceCheckUtils]: 138: Hoare triple {47132#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47132#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:42,709 INFO L273 TraceCheckUtils]: 139: Hoare triple {47132#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47133#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:42,710 INFO L273 TraceCheckUtils]: 140: Hoare triple {47133#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47133#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:42,710 INFO L273 TraceCheckUtils]: 141: Hoare triple {47133#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47133#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:42,711 INFO L273 TraceCheckUtils]: 142: Hoare triple {47133#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47134#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:42,711 INFO L273 TraceCheckUtils]: 143: Hoare triple {47134#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47134#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:42,712 INFO L273 TraceCheckUtils]: 144: Hoare triple {47134#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47134#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:42,712 INFO L273 TraceCheckUtils]: 145: Hoare triple {47134#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47135#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:42,713 INFO L273 TraceCheckUtils]: 146: Hoare triple {47135#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47135#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:42,713 INFO L273 TraceCheckUtils]: 147: Hoare triple {47135#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47135#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:42,714 INFO L273 TraceCheckUtils]: 148: Hoare triple {47135#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47136#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:42,715 INFO L273 TraceCheckUtils]: 149: Hoare triple {47136#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47136#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:42,715 INFO L273 TraceCheckUtils]: 150: Hoare triple {47136#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47136#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:42,716 INFO L273 TraceCheckUtils]: 151: Hoare triple {47136#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47137#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:42,716 INFO L273 TraceCheckUtils]: 152: Hoare triple {47137#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47137#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:42,717 INFO L273 TraceCheckUtils]: 153: Hoare triple {47137#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47137#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:42,717 INFO L273 TraceCheckUtils]: 154: Hoare triple {47137#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47138#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:42,718 INFO L273 TraceCheckUtils]: 155: Hoare triple {47138#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47138#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:42,718 INFO L273 TraceCheckUtils]: 156: Hoare triple {47138#(<= main_~i~0 51)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47138#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:42,719 INFO L273 TraceCheckUtils]: 157: Hoare triple {47138#(<= main_~i~0 51)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47139#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:42,719 INFO L273 TraceCheckUtils]: 158: Hoare triple {47139#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {47139#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:42,720 INFO L273 TraceCheckUtils]: 159: Hoare triple {47139#(<= main_~i~0 52)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {47139#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:42,721 INFO L273 TraceCheckUtils]: 160: Hoare triple {47139#(<= main_~i~0 52)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {47140#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:42,721 INFO L273 TraceCheckUtils]: 161: Hoare triple {47140#(<= main_~i~0 53)} assume !(~i~0 < 100000); {47088#false} is VALID [2018-11-23 12:00:42,721 INFO L273 TraceCheckUtils]: 162: Hoare triple {47088#false} havoc ~x~0;~x~0 := 0; {47088#false} is VALID [2018-11-23 12:00:42,722 INFO L273 TraceCheckUtils]: 163: Hoare triple {47088#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {47088#false} is VALID [2018-11-23 12:00:42,722 INFO L256 TraceCheckUtils]: 164: Hoare triple {47088#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {47088#false} is VALID [2018-11-23 12:00:42,722 INFO L273 TraceCheckUtils]: 165: Hoare triple {47088#false} ~cond := #in~cond; {47088#false} is VALID [2018-11-23 12:00:42,722 INFO L273 TraceCheckUtils]: 166: Hoare triple {47088#false} assume 0 == ~cond; {47088#false} is VALID [2018-11-23 12:00:42,722 INFO L273 TraceCheckUtils]: 167: Hoare triple {47088#false} assume !false; {47088#false} is VALID [2018-11-23 12:00:42,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:42,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:42,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 54] total 54 [2018-11-23 12:00:42,761 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 168 [2018-11-23 12:00:42,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:42,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states. [2018-11-23 12:00:42,921 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-23 12:00:42,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-11-23 12:00:42,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-11-23 12:00:42,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:00:42,922 INFO L87 Difference]: Start difference. First operand 230 states and 337 transitions. Second operand 54 states. [2018-11-23 12:00:44,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:44,563 INFO L93 Difference]: Finished difference Result 254 states and 369 transitions. [2018-11-23 12:00:44,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-11-23 12:00:44,563 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 168 [2018-11-23 12:00:44,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:44,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:00:44,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 369 transitions. [2018-11-23 12:00:44,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 12:00:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 369 transitions. [2018-11-23 12:00:44,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 54 states and 369 transitions. [2018-11-23 12:00:44,918 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 369 edges. 369 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:44,923 INFO L225 Difference]: With dead ends: 254 [2018-11-23 12:00:44,923 INFO L226 Difference]: Without dead ends: 237 [2018-11-23 12:00:44,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-11-23 12:00:44,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-11-23 12:00:44,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 234. [2018-11-23 12:00:44,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:44,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand 234 states. [2018-11-23 12:00:44,979 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand 234 states. [2018-11-23 12:00:44,979 INFO L87 Difference]: Start difference. First operand 237 states. Second operand 234 states. [2018-11-23 12:00:44,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:44,982 INFO L93 Difference]: Finished difference Result 237 states and 348 transitions. [2018-11-23 12:00:44,983 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 348 transitions. [2018-11-23 12:00:44,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:44,983 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:44,983 INFO L74 IsIncluded]: Start isIncluded. First operand 234 states. Second operand 237 states. [2018-11-23 12:00:44,983 INFO L87 Difference]: Start difference. First operand 234 states. Second operand 237 states. [2018-11-23 12:00:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:44,987 INFO L93 Difference]: Finished difference Result 237 states and 348 transitions. [2018-11-23 12:00:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 348 transitions. [2018-11-23 12:00:44,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:44,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:44,987 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:44,987 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:44,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-11-23 12:00:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 343 transitions. [2018-11-23 12:00:44,991 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 343 transitions. Word has length 168 [2018-11-23 12:00:44,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:44,991 INFO L480 AbstractCegarLoop]: Abstraction has 234 states and 343 transitions. [2018-11-23 12:00:44,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-11-23 12:00:44,991 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 343 transitions. [2018-11-23 12:00:44,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-11-23 12:00:44,992 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:44,992 INFO L402 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:44,992 INFO L423 AbstractCegarLoop]: === Iteration 54 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:44,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:44,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1081749276, now seen corresponding path program 52 times [2018-11-23 12:00:44,993 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:44,993 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:44,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:44,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:44,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:45,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:46,542 INFO L256 TraceCheckUtils]: 0: Hoare triple {48735#true} call ULTIMATE.init(); {48735#true} is VALID [2018-11-23 12:00:46,542 INFO L273 TraceCheckUtils]: 1: Hoare triple {48735#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48735#true} is VALID [2018-11-23 12:00:46,543 INFO L273 TraceCheckUtils]: 2: Hoare triple {48735#true} assume true; {48735#true} is VALID [2018-11-23 12:00:46,543 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48735#true} {48735#true} #88#return; {48735#true} is VALID [2018-11-23 12:00:46,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {48735#true} call #t~ret13 := main(); {48735#true} is VALID [2018-11-23 12:00:46,543 INFO L273 TraceCheckUtils]: 5: Hoare triple {48735#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {48735#true} is VALID [2018-11-23 12:00:46,543 INFO L273 TraceCheckUtils]: 6: Hoare triple {48735#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {48735#true} is VALID [2018-11-23 12:00:46,544 INFO L273 TraceCheckUtils]: 7: Hoare triple {48735#true} ~i~0 := 2; {48737#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:46,544 INFO L273 TraceCheckUtils]: 8: Hoare triple {48737#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48737#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:46,545 INFO L273 TraceCheckUtils]: 9: Hoare triple {48737#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48737#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:46,546 INFO L273 TraceCheckUtils]: 10: Hoare triple {48737#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48738#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:46,546 INFO L273 TraceCheckUtils]: 11: Hoare triple {48738#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48738#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:46,546 INFO L273 TraceCheckUtils]: 12: Hoare triple {48738#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48738#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:46,547 INFO L273 TraceCheckUtils]: 13: Hoare triple {48738#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48739#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:46,547 INFO L273 TraceCheckUtils]: 14: Hoare triple {48739#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48739#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:46,547 INFO L273 TraceCheckUtils]: 15: Hoare triple {48739#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48739#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:46,548 INFO L273 TraceCheckUtils]: 16: Hoare triple {48739#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48740#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:46,548 INFO L273 TraceCheckUtils]: 17: Hoare triple {48740#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48740#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:46,549 INFO L273 TraceCheckUtils]: 18: Hoare triple {48740#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48740#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:46,549 INFO L273 TraceCheckUtils]: 19: Hoare triple {48740#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48741#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:46,550 INFO L273 TraceCheckUtils]: 20: Hoare triple {48741#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48741#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:46,550 INFO L273 TraceCheckUtils]: 21: Hoare triple {48741#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48741#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:46,551 INFO L273 TraceCheckUtils]: 22: Hoare triple {48741#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48742#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:46,552 INFO L273 TraceCheckUtils]: 23: Hoare triple {48742#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48742#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:46,552 INFO L273 TraceCheckUtils]: 24: Hoare triple {48742#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48742#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:46,553 INFO L273 TraceCheckUtils]: 25: Hoare triple {48742#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48743#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:46,553 INFO L273 TraceCheckUtils]: 26: Hoare triple {48743#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48743#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:46,554 INFO L273 TraceCheckUtils]: 27: Hoare triple {48743#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48743#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:46,554 INFO L273 TraceCheckUtils]: 28: Hoare triple {48743#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48744#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:46,555 INFO L273 TraceCheckUtils]: 29: Hoare triple {48744#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48744#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:46,555 INFO L273 TraceCheckUtils]: 30: Hoare triple {48744#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48744#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:46,556 INFO L273 TraceCheckUtils]: 31: Hoare triple {48744#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48745#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:46,557 INFO L273 TraceCheckUtils]: 32: Hoare triple {48745#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48745#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:46,557 INFO L273 TraceCheckUtils]: 33: Hoare triple {48745#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48745#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:46,558 INFO L273 TraceCheckUtils]: 34: Hoare triple {48745#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48746#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:46,558 INFO L273 TraceCheckUtils]: 35: Hoare triple {48746#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48746#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:46,559 INFO L273 TraceCheckUtils]: 36: Hoare triple {48746#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48746#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:46,560 INFO L273 TraceCheckUtils]: 37: Hoare triple {48746#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48747#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:46,560 INFO L273 TraceCheckUtils]: 38: Hoare triple {48747#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48747#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:46,561 INFO L273 TraceCheckUtils]: 39: Hoare triple {48747#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48747#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:46,561 INFO L273 TraceCheckUtils]: 40: Hoare triple {48747#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48748#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:46,562 INFO L273 TraceCheckUtils]: 41: Hoare triple {48748#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48748#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:46,562 INFO L273 TraceCheckUtils]: 42: Hoare triple {48748#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48748#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:46,563 INFO L273 TraceCheckUtils]: 43: Hoare triple {48748#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48749#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:46,564 INFO L273 TraceCheckUtils]: 44: Hoare triple {48749#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48749#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:46,564 INFO L273 TraceCheckUtils]: 45: Hoare triple {48749#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48749#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:46,565 INFO L273 TraceCheckUtils]: 46: Hoare triple {48749#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48750#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:46,565 INFO L273 TraceCheckUtils]: 47: Hoare triple {48750#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48750#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:46,566 INFO L273 TraceCheckUtils]: 48: Hoare triple {48750#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48750#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:46,567 INFO L273 TraceCheckUtils]: 49: Hoare triple {48750#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48751#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:46,567 INFO L273 TraceCheckUtils]: 50: Hoare triple {48751#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48751#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:46,568 INFO L273 TraceCheckUtils]: 51: Hoare triple {48751#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48751#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:46,568 INFO L273 TraceCheckUtils]: 52: Hoare triple {48751#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48752#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:46,569 INFO L273 TraceCheckUtils]: 53: Hoare triple {48752#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48752#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:46,569 INFO L273 TraceCheckUtils]: 54: Hoare triple {48752#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48752#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:46,570 INFO L273 TraceCheckUtils]: 55: Hoare triple {48752#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48753#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:46,570 INFO L273 TraceCheckUtils]: 56: Hoare triple {48753#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48753#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:46,571 INFO L273 TraceCheckUtils]: 57: Hoare triple {48753#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48753#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:46,572 INFO L273 TraceCheckUtils]: 58: Hoare triple {48753#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48754#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:46,572 INFO L273 TraceCheckUtils]: 59: Hoare triple {48754#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48754#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:46,573 INFO L273 TraceCheckUtils]: 60: Hoare triple {48754#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48754#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:46,573 INFO L273 TraceCheckUtils]: 61: Hoare triple {48754#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48755#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:46,574 INFO L273 TraceCheckUtils]: 62: Hoare triple {48755#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48755#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:46,574 INFO L273 TraceCheckUtils]: 63: Hoare triple {48755#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48755#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:46,575 INFO L273 TraceCheckUtils]: 64: Hoare triple {48755#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48756#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:46,576 INFO L273 TraceCheckUtils]: 65: Hoare triple {48756#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48756#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:46,576 INFO L273 TraceCheckUtils]: 66: Hoare triple {48756#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48756#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:46,577 INFO L273 TraceCheckUtils]: 67: Hoare triple {48756#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48757#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:46,577 INFO L273 TraceCheckUtils]: 68: Hoare triple {48757#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48757#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:46,578 INFO L273 TraceCheckUtils]: 69: Hoare triple {48757#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48757#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:46,579 INFO L273 TraceCheckUtils]: 70: Hoare triple {48757#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48758#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:46,579 INFO L273 TraceCheckUtils]: 71: Hoare triple {48758#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48758#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:46,580 INFO L273 TraceCheckUtils]: 72: Hoare triple {48758#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48758#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:46,580 INFO L273 TraceCheckUtils]: 73: Hoare triple {48758#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48759#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:46,581 INFO L273 TraceCheckUtils]: 74: Hoare triple {48759#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48759#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:46,581 INFO L273 TraceCheckUtils]: 75: Hoare triple {48759#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48759#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:46,582 INFO L273 TraceCheckUtils]: 76: Hoare triple {48759#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48760#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:46,582 INFO L273 TraceCheckUtils]: 77: Hoare triple {48760#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48760#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:46,583 INFO L273 TraceCheckUtils]: 78: Hoare triple {48760#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48760#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:46,584 INFO L273 TraceCheckUtils]: 79: Hoare triple {48760#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48761#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:46,584 INFO L273 TraceCheckUtils]: 80: Hoare triple {48761#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48761#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:46,585 INFO L273 TraceCheckUtils]: 81: Hoare triple {48761#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48761#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:46,585 INFO L273 TraceCheckUtils]: 82: Hoare triple {48761#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48762#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:46,586 INFO L273 TraceCheckUtils]: 83: Hoare triple {48762#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48762#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:46,586 INFO L273 TraceCheckUtils]: 84: Hoare triple {48762#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48762#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:46,587 INFO L273 TraceCheckUtils]: 85: Hoare triple {48762#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48763#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:46,588 INFO L273 TraceCheckUtils]: 86: Hoare triple {48763#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48763#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:46,588 INFO L273 TraceCheckUtils]: 87: Hoare triple {48763#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48763#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:46,589 INFO L273 TraceCheckUtils]: 88: Hoare triple {48763#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48764#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:46,589 INFO L273 TraceCheckUtils]: 89: Hoare triple {48764#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48764#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:46,590 INFO L273 TraceCheckUtils]: 90: Hoare triple {48764#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48764#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:46,591 INFO L273 TraceCheckUtils]: 91: Hoare triple {48764#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48765#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:46,591 INFO L273 TraceCheckUtils]: 92: Hoare triple {48765#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48765#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:46,592 INFO L273 TraceCheckUtils]: 93: Hoare triple {48765#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48765#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:46,592 INFO L273 TraceCheckUtils]: 94: Hoare triple {48765#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48766#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:46,593 INFO L273 TraceCheckUtils]: 95: Hoare triple {48766#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48766#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:46,593 INFO L273 TraceCheckUtils]: 96: Hoare triple {48766#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48766#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:46,594 INFO L273 TraceCheckUtils]: 97: Hoare triple {48766#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48767#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:46,594 INFO L273 TraceCheckUtils]: 98: Hoare triple {48767#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48767#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:46,595 INFO L273 TraceCheckUtils]: 99: Hoare triple {48767#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48767#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:46,596 INFO L273 TraceCheckUtils]: 100: Hoare triple {48767#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48768#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:46,596 INFO L273 TraceCheckUtils]: 101: Hoare triple {48768#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48768#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:46,597 INFO L273 TraceCheckUtils]: 102: Hoare triple {48768#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48768#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:46,597 INFO L273 TraceCheckUtils]: 103: Hoare triple {48768#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48769#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:46,598 INFO L273 TraceCheckUtils]: 104: Hoare triple {48769#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48769#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:46,598 INFO L273 TraceCheckUtils]: 105: Hoare triple {48769#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48769#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:46,599 INFO L273 TraceCheckUtils]: 106: Hoare triple {48769#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48770#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:46,600 INFO L273 TraceCheckUtils]: 107: Hoare triple {48770#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48770#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:46,600 INFO L273 TraceCheckUtils]: 108: Hoare triple {48770#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48770#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:46,601 INFO L273 TraceCheckUtils]: 109: Hoare triple {48770#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48771#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:46,601 INFO L273 TraceCheckUtils]: 110: Hoare triple {48771#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48771#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:46,602 INFO L273 TraceCheckUtils]: 111: Hoare triple {48771#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48771#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:46,603 INFO L273 TraceCheckUtils]: 112: Hoare triple {48771#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48772#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:46,603 INFO L273 TraceCheckUtils]: 113: Hoare triple {48772#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48772#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:46,604 INFO L273 TraceCheckUtils]: 114: Hoare triple {48772#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48772#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:46,604 INFO L273 TraceCheckUtils]: 115: Hoare triple {48772#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48773#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:46,605 INFO L273 TraceCheckUtils]: 116: Hoare triple {48773#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48773#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:46,605 INFO L273 TraceCheckUtils]: 117: Hoare triple {48773#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48773#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:46,606 INFO L273 TraceCheckUtils]: 118: Hoare triple {48773#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48774#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:46,606 INFO L273 TraceCheckUtils]: 119: Hoare triple {48774#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48774#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:46,607 INFO L273 TraceCheckUtils]: 120: Hoare triple {48774#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48774#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:46,608 INFO L273 TraceCheckUtils]: 121: Hoare triple {48774#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48775#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:46,608 INFO L273 TraceCheckUtils]: 122: Hoare triple {48775#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48775#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:46,609 INFO L273 TraceCheckUtils]: 123: Hoare triple {48775#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48775#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:46,609 INFO L273 TraceCheckUtils]: 124: Hoare triple {48775#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48776#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:46,610 INFO L273 TraceCheckUtils]: 125: Hoare triple {48776#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48776#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:46,610 INFO L273 TraceCheckUtils]: 126: Hoare triple {48776#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48776#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:46,611 INFO L273 TraceCheckUtils]: 127: Hoare triple {48776#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48777#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:46,612 INFO L273 TraceCheckUtils]: 128: Hoare triple {48777#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48777#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:46,612 INFO L273 TraceCheckUtils]: 129: Hoare triple {48777#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48777#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:46,613 INFO L273 TraceCheckUtils]: 130: Hoare triple {48777#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48778#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:46,613 INFO L273 TraceCheckUtils]: 131: Hoare triple {48778#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48778#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:46,614 INFO L273 TraceCheckUtils]: 132: Hoare triple {48778#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48778#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:46,615 INFO L273 TraceCheckUtils]: 133: Hoare triple {48778#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48779#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:46,615 INFO L273 TraceCheckUtils]: 134: Hoare triple {48779#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48779#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:46,616 INFO L273 TraceCheckUtils]: 135: Hoare triple {48779#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48779#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:46,616 INFO L273 TraceCheckUtils]: 136: Hoare triple {48779#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48780#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:46,617 INFO L273 TraceCheckUtils]: 137: Hoare triple {48780#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48780#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:46,617 INFO L273 TraceCheckUtils]: 138: Hoare triple {48780#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48780#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:46,618 INFO L273 TraceCheckUtils]: 139: Hoare triple {48780#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48781#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:46,618 INFO L273 TraceCheckUtils]: 140: Hoare triple {48781#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48781#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:46,619 INFO L273 TraceCheckUtils]: 141: Hoare triple {48781#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48781#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:46,620 INFO L273 TraceCheckUtils]: 142: Hoare triple {48781#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48782#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:46,620 INFO L273 TraceCheckUtils]: 143: Hoare triple {48782#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48782#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:46,621 INFO L273 TraceCheckUtils]: 144: Hoare triple {48782#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48782#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:46,621 INFO L273 TraceCheckUtils]: 145: Hoare triple {48782#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48783#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:46,622 INFO L273 TraceCheckUtils]: 146: Hoare triple {48783#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48783#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:46,622 INFO L273 TraceCheckUtils]: 147: Hoare triple {48783#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48783#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:46,623 INFO L273 TraceCheckUtils]: 148: Hoare triple {48783#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48784#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:46,624 INFO L273 TraceCheckUtils]: 149: Hoare triple {48784#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48784#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:46,624 INFO L273 TraceCheckUtils]: 150: Hoare triple {48784#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48784#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:46,625 INFO L273 TraceCheckUtils]: 151: Hoare triple {48784#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48785#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:46,625 INFO L273 TraceCheckUtils]: 152: Hoare triple {48785#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48785#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:46,626 INFO L273 TraceCheckUtils]: 153: Hoare triple {48785#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48785#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:46,627 INFO L273 TraceCheckUtils]: 154: Hoare triple {48785#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48786#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:46,627 INFO L273 TraceCheckUtils]: 155: Hoare triple {48786#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48786#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:46,628 INFO L273 TraceCheckUtils]: 156: Hoare triple {48786#(<= main_~i~0 51)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48786#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:46,628 INFO L273 TraceCheckUtils]: 157: Hoare triple {48786#(<= main_~i~0 51)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48787#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:46,629 INFO L273 TraceCheckUtils]: 158: Hoare triple {48787#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48787#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:46,629 INFO L273 TraceCheckUtils]: 159: Hoare triple {48787#(<= main_~i~0 52)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48787#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:46,630 INFO L273 TraceCheckUtils]: 160: Hoare triple {48787#(<= main_~i~0 52)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48788#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:46,631 INFO L273 TraceCheckUtils]: 161: Hoare triple {48788#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48788#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:46,631 INFO L273 TraceCheckUtils]: 162: Hoare triple {48788#(<= main_~i~0 53)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48788#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:46,632 INFO L273 TraceCheckUtils]: 163: Hoare triple {48788#(<= main_~i~0 53)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48789#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:46,632 INFO L273 TraceCheckUtils]: 164: Hoare triple {48789#(<= main_~i~0 54)} assume !(~i~0 < 100000); {48736#false} is VALID [2018-11-23 12:00:46,633 INFO L273 TraceCheckUtils]: 165: Hoare triple {48736#false} havoc ~x~0;~x~0 := 0; {48736#false} is VALID [2018-11-23 12:00:46,633 INFO L273 TraceCheckUtils]: 166: Hoare triple {48736#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {48736#false} is VALID [2018-11-23 12:00:46,633 INFO L256 TraceCheckUtils]: 167: Hoare triple {48736#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {48736#false} is VALID [2018-11-23 12:00:46,633 INFO L273 TraceCheckUtils]: 168: Hoare triple {48736#false} ~cond := #in~cond; {48736#false} is VALID [2018-11-23 12:00:46,633 INFO L273 TraceCheckUtils]: 169: Hoare triple {48736#false} assume 0 == ~cond; {48736#false} is VALID [2018-11-23 12:00:46,633 INFO L273 TraceCheckUtils]: 170: Hoare triple {48736#false} assume !false; {48736#false} is VALID [2018-11-23 12:00:46,652 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:46,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:46,652 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-23 12:00:46,660 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 12:00:46,755 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 12:00:46,756 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:46,796 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:47,148 INFO L256 TraceCheckUtils]: 0: Hoare triple {48735#true} call ULTIMATE.init(); {48735#true} is VALID [2018-11-23 12:00:47,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {48735#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {48735#true} is VALID [2018-11-23 12:00:47,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {48735#true} assume true; {48735#true} is VALID [2018-11-23 12:00:47,149 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48735#true} {48735#true} #88#return; {48735#true} is VALID [2018-11-23 12:00:47,149 INFO L256 TraceCheckUtils]: 4: Hoare triple {48735#true} call #t~ret13 := main(); {48735#true} is VALID [2018-11-23 12:00:47,149 INFO L273 TraceCheckUtils]: 5: Hoare triple {48735#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {48735#true} is VALID [2018-11-23 12:00:47,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {48735#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {48735#true} is VALID [2018-11-23 12:00:47,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {48735#true} ~i~0 := 2; {48737#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:47,150 INFO L273 TraceCheckUtils]: 8: Hoare triple {48737#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48737#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:47,150 INFO L273 TraceCheckUtils]: 9: Hoare triple {48737#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48737#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:47,151 INFO L273 TraceCheckUtils]: 10: Hoare triple {48737#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48738#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:47,151 INFO L273 TraceCheckUtils]: 11: Hoare triple {48738#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48738#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:47,151 INFO L273 TraceCheckUtils]: 12: Hoare triple {48738#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48738#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:47,152 INFO L273 TraceCheckUtils]: 13: Hoare triple {48738#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48739#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:47,152 INFO L273 TraceCheckUtils]: 14: Hoare triple {48739#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48739#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:47,152 INFO L273 TraceCheckUtils]: 15: Hoare triple {48739#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48739#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:47,153 INFO L273 TraceCheckUtils]: 16: Hoare triple {48739#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48740#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:47,153 INFO L273 TraceCheckUtils]: 17: Hoare triple {48740#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48740#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:47,154 INFO L273 TraceCheckUtils]: 18: Hoare triple {48740#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48740#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:47,155 INFO L273 TraceCheckUtils]: 19: Hoare triple {48740#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48741#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:47,155 INFO L273 TraceCheckUtils]: 20: Hoare triple {48741#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48741#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:47,156 INFO L273 TraceCheckUtils]: 21: Hoare triple {48741#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48741#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:47,156 INFO L273 TraceCheckUtils]: 22: Hoare triple {48741#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48742#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:47,157 INFO L273 TraceCheckUtils]: 23: Hoare triple {48742#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48742#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:47,157 INFO L273 TraceCheckUtils]: 24: Hoare triple {48742#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48742#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:47,158 INFO L273 TraceCheckUtils]: 25: Hoare triple {48742#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48743#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:47,159 INFO L273 TraceCheckUtils]: 26: Hoare triple {48743#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48743#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:47,159 INFO L273 TraceCheckUtils]: 27: Hoare triple {48743#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48743#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:47,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {48743#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48744#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:47,160 INFO L273 TraceCheckUtils]: 29: Hoare triple {48744#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48744#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:47,161 INFO L273 TraceCheckUtils]: 30: Hoare triple {48744#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48744#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:47,162 INFO L273 TraceCheckUtils]: 31: Hoare triple {48744#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48745#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:47,162 INFO L273 TraceCheckUtils]: 32: Hoare triple {48745#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48745#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:47,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {48745#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48745#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:47,163 INFO L273 TraceCheckUtils]: 34: Hoare triple {48745#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48746#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:47,164 INFO L273 TraceCheckUtils]: 35: Hoare triple {48746#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48746#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:47,164 INFO L273 TraceCheckUtils]: 36: Hoare triple {48746#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48746#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:47,165 INFO L273 TraceCheckUtils]: 37: Hoare triple {48746#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48747#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:47,165 INFO L273 TraceCheckUtils]: 38: Hoare triple {48747#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48747#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:47,166 INFO L273 TraceCheckUtils]: 39: Hoare triple {48747#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48747#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:47,167 INFO L273 TraceCheckUtils]: 40: Hoare triple {48747#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48748#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:47,167 INFO L273 TraceCheckUtils]: 41: Hoare triple {48748#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48748#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:47,168 INFO L273 TraceCheckUtils]: 42: Hoare triple {48748#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48748#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:47,168 INFO L273 TraceCheckUtils]: 43: Hoare triple {48748#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48749#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:47,169 INFO L273 TraceCheckUtils]: 44: Hoare triple {48749#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48749#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:47,169 INFO L273 TraceCheckUtils]: 45: Hoare triple {48749#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48749#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:47,170 INFO L273 TraceCheckUtils]: 46: Hoare triple {48749#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48750#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:47,171 INFO L273 TraceCheckUtils]: 47: Hoare triple {48750#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48750#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:47,171 INFO L273 TraceCheckUtils]: 48: Hoare triple {48750#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48750#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:47,172 INFO L273 TraceCheckUtils]: 49: Hoare triple {48750#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48751#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:47,172 INFO L273 TraceCheckUtils]: 50: Hoare triple {48751#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48751#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:47,173 INFO L273 TraceCheckUtils]: 51: Hoare triple {48751#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48751#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:47,174 INFO L273 TraceCheckUtils]: 52: Hoare triple {48751#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48752#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:47,174 INFO L273 TraceCheckUtils]: 53: Hoare triple {48752#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48752#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:47,175 INFO L273 TraceCheckUtils]: 54: Hoare triple {48752#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48752#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:47,175 INFO L273 TraceCheckUtils]: 55: Hoare triple {48752#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48753#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:47,176 INFO L273 TraceCheckUtils]: 56: Hoare triple {48753#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48753#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:47,176 INFO L273 TraceCheckUtils]: 57: Hoare triple {48753#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48753#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:47,177 INFO L273 TraceCheckUtils]: 58: Hoare triple {48753#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48754#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:47,177 INFO L273 TraceCheckUtils]: 59: Hoare triple {48754#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48754#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:47,178 INFO L273 TraceCheckUtils]: 60: Hoare triple {48754#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48754#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:47,179 INFO L273 TraceCheckUtils]: 61: Hoare triple {48754#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48755#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:47,179 INFO L273 TraceCheckUtils]: 62: Hoare triple {48755#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48755#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:47,180 INFO L273 TraceCheckUtils]: 63: Hoare triple {48755#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48755#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:47,180 INFO L273 TraceCheckUtils]: 64: Hoare triple {48755#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48756#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:47,181 INFO L273 TraceCheckUtils]: 65: Hoare triple {48756#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48756#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:47,181 INFO L273 TraceCheckUtils]: 66: Hoare triple {48756#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48756#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:47,182 INFO L273 TraceCheckUtils]: 67: Hoare triple {48756#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48757#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:47,183 INFO L273 TraceCheckUtils]: 68: Hoare triple {48757#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48757#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:47,183 INFO L273 TraceCheckUtils]: 69: Hoare triple {48757#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48757#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:47,184 INFO L273 TraceCheckUtils]: 70: Hoare triple {48757#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48758#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:47,184 INFO L273 TraceCheckUtils]: 71: Hoare triple {48758#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48758#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:47,185 INFO L273 TraceCheckUtils]: 72: Hoare triple {48758#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48758#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:47,186 INFO L273 TraceCheckUtils]: 73: Hoare triple {48758#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48759#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:47,186 INFO L273 TraceCheckUtils]: 74: Hoare triple {48759#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48759#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:47,187 INFO L273 TraceCheckUtils]: 75: Hoare triple {48759#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48759#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:47,187 INFO L273 TraceCheckUtils]: 76: Hoare triple {48759#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48760#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:47,188 INFO L273 TraceCheckUtils]: 77: Hoare triple {48760#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48760#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:47,188 INFO L273 TraceCheckUtils]: 78: Hoare triple {48760#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48760#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:47,189 INFO L273 TraceCheckUtils]: 79: Hoare triple {48760#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48761#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:47,190 INFO L273 TraceCheckUtils]: 80: Hoare triple {48761#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48761#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:47,190 INFO L273 TraceCheckUtils]: 81: Hoare triple {48761#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48761#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:47,191 INFO L273 TraceCheckUtils]: 82: Hoare triple {48761#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48762#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:47,191 INFO L273 TraceCheckUtils]: 83: Hoare triple {48762#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48762#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:47,192 INFO L273 TraceCheckUtils]: 84: Hoare triple {48762#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48762#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:47,193 INFO L273 TraceCheckUtils]: 85: Hoare triple {48762#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48763#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:47,193 INFO L273 TraceCheckUtils]: 86: Hoare triple {48763#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48763#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:47,194 INFO L273 TraceCheckUtils]: 87: Hoare triple {48763#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48763#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:47,194 INFO L273 TraceCheckUtils]: 88: Hoare triple {48763#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48764#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:47,195 INFO L273 TraceCheckUtils]: 89: Hoare triple {48764#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48764#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:47,195 INFO L273 TraceCheckUtils]: 90: Hoare triple {48764#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48764#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:47,196 INFO L273 TraceCheckUtils]: 91: Hoare triple {48764#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48765#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:47,196 INFO L273 TraceCheckUtils]: 92: Hoare triple {48765#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48765#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:47,197 INFO L273 TraceCheckUtils]: 93: Hoare triple {48765#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48765#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:47,198 INFO L273 TraceCheckUtils]: 94: Hoare triple {48765#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48766#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:47,198 INFO L273 TraceCheckUtils]: 95: Hoare triple {48766#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48766#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:47,199 INFO L273 TraceCheckUtils]: 96: Hoare triple {48766#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48766#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:47,199 INFO L273 TraceCheckUtils]: 97: Hoare triple {48766#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48767#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:47,200 INFO L273 TraceCheckUtils]: 98: Hoare triple {48767#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48767#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:47,200 INFO L273 TraceCheckUtils]: 99: Hoare triple {48767#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48767#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:47,201 INFO L273 TraceCheckUtils]: 100: Hoare triple {48767#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48768#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:47,202 INFO L273 TraceCheckUtils]: 101: Hoare triple {48768#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48768#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:47,202 INFO L273 TraceCheckUtils]: 102: Hoare triple {48768#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48768#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:47,203 INFO L273 TraceCheckUtils]: 103: Hoare triple {48768#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48769#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:47,203 INFO L273 TraceCheckUtils]: 104: Hoare triple {48769#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48769#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:47,204 INFO L273 TraceCheckUtils]: 105: Hoare triple {48769#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48769#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:47,205 INFO L273 TraceCheckUtils]: 106: Hoare triple {48769#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48770#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:47,205 INFO L273 TraceCheckUtils]: 107: Hoare triple {48770#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48770#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:47,206 INFO L273 TraceCheckUtils]: 108: Hoare triple {48770#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48770#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:47,206 INFO L273 TraceCheckUtils]: 109: Hoare triple {48770#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48771#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:47,207 INFO L273 TraceCheckUtils]: 110: Hoare triple {48771#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48771#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:47,207 INFO L273 TraceCheckUtils]: 111: Hoare triple {48771#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48771#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:47,208 INFO L273 TraceCheckUtils]: 112: Hoare triple {48771#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48772#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:47,209 INFO L273 TraceCheckUtils]: 113: Hoare triple {48772#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48772#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:47,209 INFO L273 TraceCheckUtils]: 114: Hoare triple {48772#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48772#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:47,210 INFO L273 TraceCheckUtils]: 115: Hoare triple {48772#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48773#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:47,210 INFO L273 TraceCheckUtils]: 116: Hoare triple {48773#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48773#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:47,211 INFO L273 TraceCheckUtils]: 117: Hoare triple {48773#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48773#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:47,211 INFO L273 TraceCheckUtils]: 118: Hoare triple {48773#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48774#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:47,212 INFO L273 TraceCheckUtils]: 119: Hoare triple {48774#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48774#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:47,212 INFO L273 TraceCheckUtils]: 120: Hoare triple {48774#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48774#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:47,213 INFO L273 TraceCheckUtils]: 121: Hoare triple {48774#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48775#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:47,214 INFO L273 TraceCheckUtils]: 122: Hoare triple {48775#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48775#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:47,214 INFO L273 TraceCheckUtils]: 123: Hoare triple {48775#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48775#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:47,215 INFO L273 TraceCheckUtils]: 124: Hoare triple {48775#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48776#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:47,215 INFO L273 TraceCheckUtils]: 125: Hoare triple {48776#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48776#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:47,216 INFO L273 TraceCheckUtils]: 126: Hoare triple {48776#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48776#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:47,217 INFO L273 TraceCheckUtils]: 127: Hoare triple {48776#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48777#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:47,217 INFO L273 TraceCheckUtils]: 128: Hoare triple {48777#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48777#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:47,218 INFO L273 TraceCheckUtils]: 129: Hoare triple {48777#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48777#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:47,218 INFO L273 TraceCheckUtils]: 130: Hoare triple {48777#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48778#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:47,219 INFO L273 TraceCheckUtils]: 131: Hoare triple {48778#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48778#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:47,219 INFO L273 TraceCheckUtils]: 132: Hoare triple {48778#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48778#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:47,220 INFO L273 TraceCheckUtils]: 133: Hoare triple {48778#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48779#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:47,221 INFO L273 TraceCheckUtils]: 134: Hoare triple {48779#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48779#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:47,221 INFO L273 TraceCheckUtils]: 135: Hoare triple {48779#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48779#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:47,222 INFO L273 TraceCheckUtils]: 136: Hoare triple {48779#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48780#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:47,222 INFO L273 TraceCheckUtils]: 137: Hoare triple {48780#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48780#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:47,223 INFO L273 TraceCheckUtils]: 138: Hoare triple {48780#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48780#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:47,224 INFO L273 TraceCheckUtils]: 139: Hoare triple {48780#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48781#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:47,224 INFO L273 TraceCheckUtils]: 140: Hoare triple {48781#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48781#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:47,225 INFO L273 TraceCheckUtils]: 141: Hoare triple {48781#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48781#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:47,225 INFO L273 TraceCheckUtils]: 142: Hoare triple {48781#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48782#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:47,226 INFO L273 TraceCheckUtils]: 143: Hoare triple {48782#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48782#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:47,226 INFO L273 TraceCheckUtils]: 144: Hoare triple {48782#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48782#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:47,227 INFO L273 TraceCheckUtils]: 145: Hoare triple {48782#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48783#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:47,228 INFO L273 TraceCheckUtils]: 146: Hoare triple {48783#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48783#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:47,228 INFO L273 TraceCheckUtils]: 147: Hoare triple {48783#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48783#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:47,229 INFO L273 TraceCheckUtils]: 148: Hoare triple {48783#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48784#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:47,229 INFO L273 TraceCheckUtils]: 149: Hoare triple {48784#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48784#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:47,230 INFO L273 TraceCheckUtils]: 150: Hoare triple {48784#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48784#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:47,230 INFO L273 TraceCheckUtils]: 151: Hoare triple {48784#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48785#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:47,231 INFO L273 TraceCheckUtils]: 152: Hoare triple {48785#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48785#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:47,231 INFO L273 TraceCheckUtils]: 153: Hoare triple {48785#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48785#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:47,232 INFO L273 TraceCheckUtils]: 154: Hoare triple {48785#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48786#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:47,233 INFO L273 TraceCheckUtils]: 155: Hoare triple {48786#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48786#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:47,233 INFO L273 TraceCheckUtils]: 156: Hoare triple {48786#(<= main_~i~0 51)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48786#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:47,234 INFO L273 TraceCheckUtils]: 157: Hoare triple {48786#(<= main_~i~0 51)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48787#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:47,234 INFO L273 TraceCheckUtils]: 158: Hoare triple {48787#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48787#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:47,235 INFO L273 TraceCheckUtils]: 159: Hoare triple {48787#(<= main_~i~0 52)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48787#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:47,236 INFO L273 TraceCheckUtils]: 160: Hoare triple {48787#(<= main_~i~0 52)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48788#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:47,236 INFO L273 TraceCheckUtils]: 161: Hoare triple {48788#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {48788#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:47,237 INFO L273 TraceCheckUtils]: 162: Hoare triple {48788#(<= main_~i~0 53)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {48788#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:47,237 INFO L273 TraceCheckUtils]: 163: Hoare triple {48788#(<= main_~i~0 53)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {48789#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:47,238 INFO L273 TraceCheckUtils]: 164: Hoare triple {48789#(<= main_~i~0 54)} assume !(~i~0 < 100000); {48736#false} is VALID [2018-11-23 12:00:47,238 INFO L273 TraceCheckUtils]: 165: Hoare triple {48736#false} havoc ~x~0;~x~0 := 0; {48736#false} is VALID [2018-11-23 12:00:47,238 INFO L273 TraceCheckUtils]: 166: Hoare triple {48736#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {48736#false} is VALID [2018-11-23 12:00:47,239 INFO L256 TraceCheckUtils]: 167: Hoare triple {48736#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {48736#false} is VALID [2018-11-23 12:00:47,239 INFO L273 TraceCheckUtils]: 168: Hoare triple {48736#false} ~cond := #in~cond; {48736#false} is VALID [2018-11-23 12:00:47,239 INFO L273 TraceCheckUtils]: 169: Hoare triple {48736#false} assume 0 == ~cond; {48736#false} is VALID [2018-11-23 12:00:47,239 INFO L273 TraceCheckUtils]: 170: Hoare triple {48736#false} assume !false; {48736#false} is VALID [2018-11-23 12:00:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:47,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:47,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 55] total 55 [2018-11-23 12:00:47,276 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 171 [2018-11-23 12:00:47,276 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:47,276 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states. [2018-11-23 12:00:47,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:47,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-11-23 12:00:47,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-11-23 12:00:47,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:00:47,449 INFO L87 Difference]: Start difference. First operand 234 states and 343 transitions. Second operand 55 states. [2018-11-23 12:00:48,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:48,870 INFO L93 Difference]: Finished difference Result 258 states and 375 transitions. [2018-11-23 12:00:48,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-11-23 12:00:48,870 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 171 [2018-11-23 12:00:48,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:48,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:00:48,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 375 transitions. [2018-11-23 12:00:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-11-23 12:00:48,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 375 transitions. [2018-11-23 12:00:48,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 55 states and 375 transitions. [2018-11-23 12:00:49,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 375 edges. 375 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:49,248 INFO L225 Difference]: With dead ends: 258 [2018-11-23 12:00:49,248 INFO L226 Difference]: Without dead ends: 241 [2018-11-23 12:00:49,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-11-23 12:00:49,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-11-23 12:00:49,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 238. [2018-11-23 12:00:49,297 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:49,297 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand 238 states. [2018-11-23 12:00:49,297 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand 238 states. [2018-11-23 12:00:49,297 INFO L87 Difference]: Start difference. First operand 241 states. Second operand 238 states. [2018-11-23 12:00:49,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:49,301 INFO L93 Difference]: Finished difference Result 241 states and 354 transitions. [2018-11-23 12:00:49,302 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 354 transitions. [2018-11-23 12:00:49,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:49,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:49,302 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand 241 states. [2018-11-23 12:00:49,302 INFO L87 Difference]: Start difference. First operand 238 states. Second operand 241 states. [2018-11-23 12:00:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:49,306 INFO L93 Difference]: Finished difference Result 241 states and 354 transitions. [2018-11-23 12:00:49,306 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 354 transitions. [2018-11-23 12:00:49,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:49,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:49,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:49,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:49,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 238 states. [2018-11-23 12:00:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 349 transitions. [2018-11-23 12:00:49,310 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 349 transitions. Word has length 171 [2018-11-23 12:00:49,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:49,310 INFO L480 AbstractCegarLoop]: Abstraction has 238 states and 349 transitions. [2018-11-23 12:00:49,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-11-23 12:00:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 349 transitions. [2018-11-23 12:00:49,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-11-23 12:00:49,311 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:49,311 INFO L402 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:49,311 INFO L423 AbstractCegarLoop]: === Iteration 55 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:49,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:49,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1902841345, now seen corresponding path program 53 times [2018-11-23 12:00:49,312 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:49,312 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:49,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:49,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:49,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:49,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:50,892 INFO L256 TraceCheckUtils]: 0: Hoare triple {50411#true} call ULTIMATE.init(); {50411#true} is VALID [2018-11-23 12:00:50,893 INFO L273 TraceCheckUtils]: 1: Hoare triple {50411#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50411#true} is VALID [2018-11-23 12:00:50,893 INFO L273 TraceCheckUtils]: 2: Hoare triple {50411#true} assume true; {50411#true} is VALID [2018-11-23 12:00:50,893 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50411#true} {50411#true} #88#return; {50411#true} is VALID [2018-11-23 12:00:50,893 INFO L256 TraceCheckUtils]: 4: Hoare triple {50411#true} call #t~ret13 := main(); {50411#true} is VALID [2018-11-23 12:00:50,893 INFO L273 TraceCheckUtils]: 5: Hoare triple {50411#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {50411#true} is VALID [2018-11-23 12:00:50,893 INFO L273 TraceCheckUtils]: 6: Hoare triple {50411#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {50411#true} is VALID [2018-11-23 12:00:50,894 INFO L273 TraceCheckUtils]: 7: Hoare triple {50411#true} ~i~0 := 2; {50413#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:50,894 INFO L273 TraceCheckUtils]: 8: Hoare triple {50413#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50413#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:50,894 INFO L273 TraceCheckUtils]: 9: Hoare triple {50413#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50413#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:50,895 INFO L273 TraceCheckUtils]: 10: Hoare triple {50413#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50414#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:50,895 INFO L273 TraceCheckUtils]: 11: Hoare triple {50414#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50414#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:50,896 INFO L273 TraceCheckUtils]: 12: Hoare triple {50414#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50414#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:50,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {50414#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50415#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:50,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {50415#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50415#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:50,898 INFO L273 TraceCheckUtils]: 15: Hoare triple {50415#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50415#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:50,898 INFO L273 TraceCheckUtils]: 16: Hoare triple {50415#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50416#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:50,899 INFO L273 TraceCheckUtils]: 17: Hoare triple {50416#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50416#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:50,899 INFO L273 TraceCheckUtils]: 18: Hoare triple {50416#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50416#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:50,900 INFO L273 TraceCheckUtils]: 19: Hoare triple {50416#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50417#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:50,901 INFO L273 TraceCheckUtils]: 20: Hoare triple {50417#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50417#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:50,901 INFO L273 TraceCheckUtils]: 21: Hoare triple {50417#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50417#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:50,902 INFO L273 TraceCheckUtils]: 22: Hoare triple {50417#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50418#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:50,902 INFO L273 TraceCheckUtils]: 23: Hoare triple {50418#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50418#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:50,903 INFO L273 TraceCheckUtils]: 24: Hoare triple {50418#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50418#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:50,904 INFO L273 TraceCheckUtils]: 25: Hoare triple {50418#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50419#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:50,904 INFO L273 TraceCheckUtils]: 26: Hoare triple {50419#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50419#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:50,905 INFO L273 TraceCheckUtils]: 27: Hoare triple {50419#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50419#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:50,905 INFO L273 TraceCheckUtils]: 28: Hoare triple {50419#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50420#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:50,906 INFO L273 TraceCheckUtils]: 29: Hoare triple {50420#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50420#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:50,906 INFO L273 TraceCheckUtils]: 30: Hoare triple {50420#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50420#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:50,907 INFO L273 TraceCheckUtils]: 31: Hoare triple {50420#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50421#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:50,907 INFO L273 TraceCheckUtils]: 32: Hoare triple {50421#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50421#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:50,908 INFO L273 TraceCheckUtils]: 33: Hoare triple {50421#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50421#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:50,909 INFO L273 TraceCheckUtils]: 34: Hoare triple {50421#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50422#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:50,909 INFO L273 TraceCheckUtils]: 35: Hoare triple {50422#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50422#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:50,910 INFO L273 TraceCheckUtils]: 36: Hoare triple {50422#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50422#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:50,910 INFO L273 TraceCheckUtils]: 37: Hoare triple {50422#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50423#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:50,911 INFO L273 TraceCheckUtils]: 38: Hoare triple {50423#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50423#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:50,911 INFO L273 TraceCheckUtils]: 39: Hoare triple {50423#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50423#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:50,912 INFO L273 TraceCheckUtils]: 40: Hoare triple {50423#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50424#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:50,913 INFO L273 TraceCheckUtils]: 41: Hoare triple {50424#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50424#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:50,913 INFO L273 TraceCheckUtils]: 42: Hoare triple {50424#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50424#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:50,914 INFO L273 TraceCheckUtils]: 43: Hoare triple {50424#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50425#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:50,914 INFO L273 TraceCheckUtils]: 44: Hoare triple {50425#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50425#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:50,915 INFO L273 TraceCheckUtils]: 45: Hoare triple {50425#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50425#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:50,916 INFO L273 TraceCheckUtils]: 46: Hoare triple {50425#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50426#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:50,916 INFO L273 TraceCheckUtils]: 47: Hoare triple {50426#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50426#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:50,917 INFO L273 TraceCheckUtils]: 48: Hoare triple {50426#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50426#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:50,917 INFO L273 TraceCheckUtils]: 49: Hoare triple {50426#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50427#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:50,918 INFO L273 TraceCheckUtils]: 50: Hoare triple {50427#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50427#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:50,918 INFO L273 TraceCheckUtils]: 51: Hoare triple {50427#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50427#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:50,919 INFO L273 TraceCheckUtils]: 52: Hoare triple {50427#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50428#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:50,919 INFO L273 TraceCheckUtils]: 53: Hoare triple {50428#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50428#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:50,920 INFO L273 TraceCheckUtils]: 54: Hoare triple {50428#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50428#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:50,921 INFO L273 TraceCheckUtils]: 55: Hoare triple {50428#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50429#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:50,921 INFO L273 TraceCheckUtils]: 56: Hoare triple {50429#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50429#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:50,922 INFO L273 TraceCheckUtils]: 57: Hoare triple {50429#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50429#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:50,922 INFO L273 TraceCheckUtils]: 58: Hoare triple {50429#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50430#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:50,923 INFO L273 TraceCheckUtils]: 59: Hoare triple {50430#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50430#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:50,923 INFO L273 TraceCheckUtils]: 60: Hoare triple {50430#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50430#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:50,924 INFO L273 TraceCheckUtils]: 61: Hoare triple {50430#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50431#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:50,925 INFO L273 TraceCheckUtils]: 62: Hoare triple {50431#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50431#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:50,925 INFO L273 TraceCheckUtils]: 63: Hoare triple {50431#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50431#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:50,926 INFO L273 TraceCheckUtils]: 64: Hoare triple {50431#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50432#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:50,926 INFO L273 TraceCheckUtils]: 65: Hoare triple {50432#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50432#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:50,927 INFO L273 TraceCheckUtils]: 66: Hoare triple {50432#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50432#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:50,928 INFO L273 TraceCheckUtils]: 67: Hoare triple {50432#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50433#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:50,928 INFO L273 TraceCheckUtils]: 68: Hoare triple {50433#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50433#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:50,929 INFO L273 TraceCheckUtils]: 69: Hoare triple {50433#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50433#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:50,929 INFO L273 TraceCheckUtils]: 70: Hoare triple {50433#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50434#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:50,930 INFO L273 TraceCheckUtils]: 71: Hoare triple {50434#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50434#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:50,930 INFO L273 TraceCheckUtils]: 72: Hoare triple {50434#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50434#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:50,931 INFO L273 TraceCheckUtils]: 73: Hoare triple {50434#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50435#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:50,931 INFO L273 TraceCheckUtils]: 74: Hoare triple {50435#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50435#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:50,932 INFO L273 TraceCheckUtils]: 75: Hoare triple {50435#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50435#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:50,933 INFO L273 TraceCheckUtils]: 76: Hoare triple {50435#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50436#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:50,933 INFO L273 TraceCheckUtils]: 77: Hoare triple {50436#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50436#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:50,934 INFO L273 TraceCheckUtils]: 78: Hoare triple {50436#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50436#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:50,934 INFO L273 TraceCheckUtils]: 79: Hoare triple {50436#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50437#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:50,935 INFO L273 TraceCheckUtils]: 80: Hoare triple {50437#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50437#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:50,935 INFO L273 TraceCheckUtils]: 81: Hoare triple {50437#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50437#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:50,936 INFO L273 TraceCheckUtils]: 82: Hoare triple {50437#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50438#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:50,937 INFO L273 TraceCheckUtils]: 83: Hoare triple {50438#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50438#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:50,937 INFO L273 TraceCheckUtils]: 84: Hoare triple {50438#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50438#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:50,938 INFO L273 TraceCheckUtils]: 85: Hoare triple {50438#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50439#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:50,938 INFO L273 TraceCheckUtils]: 86: Hoare triple {50439#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50439#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:50,939 INFO L273 TraceCheckUtils]: 87: Hoare triple {50439#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50439#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:50,940 INFO L273 TraceCheckUtils]: 88: Hoare triple {50439#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50440#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:50,940 INFO L273 TraceCheckUtils]: 89: Hoare triple {50440#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50440#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:50,941 INFO L273 TraceCheckUtils]: 90: Hoare triple {50440#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50440#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:50,941 INFO L273 TraceCheckUtils]: 91: Hoare triple {50440#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50441#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:50,942 INFO L273 TraceCheckUtils]: 92: Hoare triple {50441#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50441#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:50,942 INFO L273 TraceCheckUtils]: 93: Hoare triple {50441#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50441#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:50,943 INFO L273 TraceCheckUtils]: 94: Hoare triple {50441#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50442#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:50,943 INFO L273 TraceCheckUtils]: 95: Hoare triple {50442#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50442#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:50,944 INFO L273 TraceCheckUtils]: 96: Hoare triple {50442#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50442#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:50,945 INFO L273 TraceCheckUtils]: 97: Hoare triple {50442#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50443#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:50,945 INFO L273 TraceCheckUtils]: 98: Hoare triple {50443#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50443#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:50,946 INFO L273 TraceCheckUtils]: 99: Hoare triple {50443#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50443#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:50,946 INFO L273 TraceCheckUtils]: 100: Hoare triple {50443#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50444#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:50,947 INFO L273 TraceCheckUtils]: 101: Hoare triple {50444#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50444#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:50,947 INFO L273 TraceCheckUtils]: 102: Hoare triple {50444#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50444#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:50,948 INFO L273 TraceCheckUtils]: 103: Hoare triple {50444#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50445#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:50,949 INFO L273 TraceCheckUtils]: 104: Hoare triple {50445#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50445#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:50,949 INFO L273 TraceCheckUtils]: 105: Hoare triple {50445#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50445#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:50,950 INFO L273 TraceCheckUtils]: 106: Hoare triple {50445#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50446#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:50,950 INFO L273 TraceCheckUtils]: 107: Hoare triple {50446#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50446#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:50,951 INFO L273 TraceCheckUtils]: 108: Hoare triple {50446#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50446#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:50,952 INFO L273 TraceCheckUtils]: 109: Hoare triple {50446#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50447#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:50,952 INFO L273 TraceCheckUtils]: 110: Hoare triple {50447#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50447#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:50,953 INFO L273 TraceCheckUtils]: 111: Hoare triple {50447#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50447#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:50,953 INFO L273 TraceCheckUtils]: 112: Hoare triple {50447#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50448#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:50,954 INFO L273 TraceCheckUtils]: 113: Hoare triple {50448#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50448#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:50,954 INFO L273 TraceCheckUtils]: 114: Hoare triple {50448#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50448#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:50,955 INFO L273 TraceCheckUtils]: 115: Hoare triple {50448#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50449#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:50,955 INFO L273 TraceCheckUtils]: 116: Hoare triple {50449#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50449#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:50,956 INFO L273 TraceCheckUtils]: 117: Hoare triple {50449#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50449#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:50,957 INFO L273 TraceCheckUtils]: 118: Hoare triple {50449#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50450#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:50,957 INFO L273 TraceCheckUtils]: 119: Hoare triple {50450#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50450#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:50,958 INFO L273 TraceCheckUtils]: 120: Hoare triple {50450#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50450#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:50,958 INFO L273 TraceCheckUtils]: 121: Hoare triple {50450#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50451#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:50,959 INFO L273 TraceCheckUtils]: 122: Hoare triple {50451#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50451#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:50,959 INFO L273 TraceCheckUtils]: 123: Hoare triple {50451#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50451#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:50,960 INFO L273 TraceCheckUtils]: 124: Hoare triple {50451#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50452#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:50,961 INFO L273 TraceCheckUtils]: 125: Hoare triple {50452#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50452#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:50,961 INFO L273 TraceCheckUtils]: 126: Hoare triple {50452#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50452#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:50,962 INFO L273 TraceCheckUtils]: 127: Hoare triple {50452#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50453#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:50,962 INFO L273 TraceCheckUtils]: 128: Hoare triple {50453#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50453#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:50,963 INFO L273 TraceCheckUtils]: 129: Hoare triple {50453#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50453#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:50,964 INFO L273 TraceCheckUtils]: 130: Hoare triple {50453#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50454#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:50,964 INFO L273 TraceCheckUtils]: 131: Hoare triple {50454#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50454#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:50,965 INFO L273 TraceCheckUtils]: 132: Hoare triple {50454#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50454#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:50,965 INFO L273 TraceCheckUtils]: 133: Hoare triple {50454#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50455#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:50,966 INFO L273 TraceCheckUtils]: 134: Hoare triple {50455#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50455#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:50,966 INFO L273 TraceCheckUtils]: 135: Hoare triple {50455#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50455#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:50,967 INFO L273 TraceCheckUtils]: 136: Hoare triple {50455#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50456#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:50,968 INFO L273 TraceCheckUtils]: 137: Hoare triple {50456#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50456#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:50,968 INFO L273 TraceCheckUtils]: 138: Hoare triple {50456#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50456#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:50,969 INFO L273 TraceCheckUtils]: 139: Hoare triple {50456#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50457#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:50,969 INFO L273 TraceCheckUtils]: 140: Hoare triple {50457#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50457#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:50,970 INFO L273 TraceCheckUtils]: 141: Hoare triple {50457#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50457#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:50,971 INFO L273 TraceCheckUtils]: 142: Hoare triple {50457#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50458#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:50,971 INFO L273 TraceCheckUtils]: 143: Hoare triple {50458#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50458#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:50,972 INFO L273 TraceCheckUtils]: 144: Hoare triple {50458#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50458#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:50,972 INFO L273 TraceCheckUtils]: 145: Hoare triple {50458#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50459#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:50,973 INFO L273 TraceCheckUtils]: 146: Hoare triple {50459#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50459#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:50,973 INFO L273 TraceCheckUtils]: 147: Hoare triple {50459#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50459#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:50,974 INFO L273 TraceCheckUtils]: 148: Hoare triple {50459#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50460#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:50,974 INFO L273 TraceCheckUtils]: 149: Hoare triple {50460#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50460#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:50,975 INFO L273 TraceCheckUtils]: 150: Hoare triple {50460#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50460#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:50,976 INFO L273 TraceCheckUtils]: 151: Hoare triple {50460#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50461#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:50,976 INFO L273 TraceCheckUtils]: 152: Hoare triple {50461#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50461#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:50,977 INFO L273 TraceCheckUtils]: 153: Hoare triple {50461#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50461#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:50,977 INFO L273 TraceCheckUtils]: 154: Hoare triple {50461#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50462#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:50,978 INFO L273 TraceCheckUtils]: 155: Hoare triple {50462#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50462#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:50,978 INFO L273 TraceCheckUtils]: 156: Hoare triple {50462#(<= main_~i~0 51)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50462#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:50,979 INFO L273 TraceCheckUtils]: 157: Hoare triple {50462#(<= main_~i~0 51)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50463#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:50,980 INFO L273 TraceCheckUtils]: 158: Hoare triple {50463#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50463#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:50,980 INFO L273 TraceCheckUtils]: 159: Hoare triple {50463#(<= main_~i~0 52)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50463#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:50,981 INFO L273 TraceCheckUtils]: 160: Hoare triple {50463#(<= main_~i~0 52)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50464#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:50,981 INFO L273 TraceCheckUtils]: 161: Hoare triple {50464#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50464#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:50,982 INFO L273 TraceCheckUtils]: 162: Hoare triple {50464#(<= main_~i~0 53)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50464#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:50,982 INFO L273 TraceCheckUtils]: 163: Hoare triple {50464#(<= main_~i~0 53)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50465#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:50,983 INFO L273 TraceCheckUtils]: 164: Hoare triple {50465#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50465#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:50,984 INFO L273 TraceCheckUtils]: 165: Hoare triple {50465#(<= main_~i~0 54)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50465#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:50,984 INFO L273 TraceCheckUtils]: 166: Hoare triple {50465#(<= main_~i~0 54)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50466#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:50,985 INFO L273 TraceCheckUtils]: 167: Hoare triple {50466#(<= main_~i~0 55)} assume !(~i~0 < 100000); {50412#false} is VALID [2018-11-23 12:00:50,985 INFO L273 TraceCheckUtils]: 168: Hoare triple {50412#false} havoc ~x~0;~x~0 := 0; {50412#false} is VALID [2018-11-23 12:00:50,985 INFO L273 TraceCheckUtils]: 169: Hoare triple {50412#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {50412#false} is VALID [2018-11-23 12:00:50,985 INFO L256 TraceCheckUtils]: 170: Hoare triple {50412#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {50412#false} is VALID [2018-11-23 12:00:50,986 INFO L273 TraceCheckUtils]: 171: Hoare triple {50412#false} ~cond := #in~cond; {50412#false} is VALID [2018-11-23 12:00:50,986 INFO L273 TraceCheckUtils]: 172: Hoare triple {50412#false} assume 0 == ~cond; {50412#false} is VALID [2018-11-23 12:00:50,986 INFO L273 TraceCheckUtils]: 173: Hoare triple {50412#false} assume !false; {50412#false} is VALID [2018-11-23 12:00:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:51,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:51,005 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-23 12:00:51,014 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-11-23 12:00:51,162 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 54 check-sat command(s) [2018-11-23 12:00:51,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:51,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:51,201 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:51,647 INFO L256 TraceCheckUtils]: 0: Hoare triple {50411#true} call ULTIMATE.init(); {50411#true} is VALID [2018-11-23 12:00:51,648 INFO L273 TraceCheckUtils]: 1: Hoare triple {50411#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {50411#true} is VALID [2018-11-23 12:00:51,648 INFO L273 TraceCheckUtils]: 2: Hoare triple {50411#true} assume true; {50411#true} is VALID [2018-11-23 12:00:51,648 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {50411#true} {50411#true} #88#return; {50411#true} is VALID [2018-11-23 12:00:51,648 INFO L256 TraceCheckUtils]: 4: Hoare triple {50411#true} call #t~ret13 := main(); {50411#true} is VALID [2018-11-23 12:00:51,648 INFO L273 TraceCheckUtils]: 5: Hoare triple {50411#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {50411#true} is VALID [2018-11-23 12:00:51,649 INFO L273 TraceCheckUtils]: 6: Hoare triple {50411#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {50411#true} is VALID [2018-11-23 12:00:51,649 INFO L273 TraceCheckUtils]: 7: Hoare triple {50411#true} ~i~0 := 2; {50413#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:51,650 INFO L273 TraceCheckUtils]: 8: Hoare triple {50413#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50413#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:51,650 INFO L273 TraceCheckUtils]: 9: Hoare triple {50413#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50413#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:51,650 INFO L273 TraceCheckUtils]: 10: Hoare triple {50413#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50414#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:51,651 INFO L273 TraceCheckUtils]: 11: Hoare triple {50414#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50414#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:51,651 INFO L273 TraceCheckUtils]: 12: Hoare triple {50414#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50414#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:51,651 INFO L273 TraceCheckUtils]: 13: Hoare triple {50414#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50415#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:51,652 INFO L273 TraceCheckUtils]: 14: Hoare triple {50415#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50415#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:51,652 INFO L273 TraceCheckUtils]: 15: Hoare triple {50415#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50415#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:51,652 INFO L273 TraceCheckUtils]: 16: Hoare triple {50415#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50416#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:51,653 INFO L273 TraceCheckUtils]: 17: Hoare triple {50416#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50416#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:51,653 INFO L273 TraceCheckUtils]: 18: Hoare triple {50416#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50416#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:51,654 INFO L273 TraceCheckUtils]: 19: Hoare triple {50416#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50417#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:51,655 INFO L273 TraceCheckUtils]: 20: Hoare triple {50417#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50417#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:51,655 INFO L273 TraceCheckUtils]: 21: Hoare triple {50417#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50417#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:51,656 INFO L273 TraceCheckUtils]: 22: Hoare triple {50417#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50418#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:51,656 INFO L273 TraceCheckUtils]: 23: Hoare triple {50418#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50418#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:51,657 INFO L273 TraceCheckUtils]: 24: Hoare triple {50418#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50418#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:51,657 INFO L273 TraceCheckUtils]: 25: Hoare triple {50418#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50419#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:51,658 INFO L273 TraceCheckUtils]: 26: Hoare triple {50419#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50419#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:51,658 INFO L273 TraceCheckUtils]: 27: Hoare triple {50419#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50419#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:51,659 INFO L273 TraceCheckUtils]: 28: Hoare triple {50419#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50420#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:51,660 INFO L273 TraceCheckUtils]: 29: Hoare triple {50420#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50420#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:51,660 INFO L273 TraceCheckUtils]: 30: Hoare triple {50420#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50420#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:51,661 INFO L273 TraceCheckUtils]: 31: Hoare triple {50420#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50421#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:51,661 INFO L273 TraceCheckUtils]: 32: Hoare triple {50421#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50421#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:51,662 INFO L273 TraceCheckUtils]: 33: Hoare triple {50421#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50421#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:51,663 INFO L273 TraceCheckUtils]: 34: Hoare triple {50421#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50422#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:51,663 INFO L273 TraceCheckUtils]: 35: Hoare triple {50422#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50422#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:51,664 INFO L273 TraceCheckUtils]: 36: Hoare triple {50422#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50422#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:51,664 INFO L273 TraceCheckUtils]: 37: Hoare triple {50422#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50423#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:51,665 INFO L273 TraceCheckUtils]: 38: Hoare triple {50423#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50423#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:51,665 INFO L273 TraceCheckUtils]: 39: Hoare triple {50423#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50423#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:51,666 INFO L273 TraceCheckUtils]: 40: Hoare triple {50423#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50424#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:51,667 INFO L273 TraceCheckUtils]: 41: Hoare triple {50424#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50424#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:51,667 INFO L273 TraceCheckUtils]: 42: Hoare triple {50424#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50424#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:51,668 INFO L273 TraceCheckUtils]: 43: Hoare triple {50424#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50425#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:51,668 INFO L273 TraceCheckUtils]: 44: Hoare triple {50425#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50425#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:51,669 INFO L273 TraceCheckUtils]: 45: Hoare triple {50425#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50425#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:51,669 INFO L273 TraceCheckUtils]: 46: Hoare triple {50425#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50426#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:51,670 INFO L273 TraceCheckUtils]: 47: Hoare triple {50426#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50426#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:51,670 INFO L273 TraceCheckUtils]: 48: Hoare triple {50426#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50426#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:51,671 INFO L273 TraceCheckUtils]: 49: Hoare triple {50426#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50427#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:51,672 INFO L273 TraceCheckUtils]: 50: Hoare triple {50427#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50427#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:51,672 INFO L273 TraceCheckUtils]: 51: Hoare triple {50427#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50427#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:51,673 INFO L273 TraceCheckUtils]: 52: Hoare triple {50427#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50428#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:51,673 INFO L273 TraceCheckUtils]: 53: Hoare triple {50428#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50428#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:51,674 INFO L273 TraceCheckUtils]: 54: Hoare triple {50428#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50428#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:51,675 INFO L273 TraceCheckUtils]: 55: Hoare triple {50428#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50429#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:51,675 INFO L273 TraceCheckUtils]: 56: Hoare triple {50429#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50429#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:51,676 INFO L273 TraceCheckUtils]: 57: Hoare triple {50429#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50429#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:51,676 INFO L273 TraceCheckUtils]: 58: Hoare triple {50429#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50430#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:51,677 INFO L273 TraceCheckUtils]: 59: Hoare triple {50430#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50430#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:51,677 INFO L273 TraceCheckUtils]: 60: Hoare triple {50430#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50430#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:51,678 INFO L273 TraceCheckUtils]: 61: Hoare triple {50430#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50431#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:51,679 INFO L273 TraceCheckUtils]: 62: Hoare triple {50431#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50431#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:51,679 INFO L273 TraceCheckUtils]: 63: Hoare triple {50431#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50431#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:51,680 INFO L273 TraceCheckUtils]: 64: Hoare triple {50431#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50432#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:51,680 INFO L273 TraceCheckUtils]: 65: Hoare triple {50432#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50432#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:51,681 INFO L273 TraceCheckUtils]: 66: Hoare triple {50432#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50432#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:51,682 INFO L273 TraceCheckUtils]: 67: Hoare triple {50432#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50433#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:51,682 INFO L273 TraceCheckUtils]: 68: Hoare triple {50433#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50433#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:51,683 INFO L273 TraceCheckUtils]: 69: Hoare triple {50433#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50433#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:51,683 INFO L273 TraceCheckUtils]: 70: Hoare triple {50433#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50434#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:51,684 INFO L273 TraceCheckUtils]: 71: Hoare triple {50434#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50434#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:51,684 INFO L273 TraceCheckUtils]: 72: Hoare triple {50434#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50434#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:51,685 INFO L273 TraceCheckUtils]: 73: Hoare triple {50434#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50435#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:51,685 INFO L273 TraceCheckUtils]: 74: Hoare triple {50435#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50435#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:51,686 INFO L273 TraceCheckUtils]: 75: Hoare triple {50435#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50435#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:51,687 INFO L273 TraceCheckUtils]: 76: Hoare triple {50435#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50436#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:51,687 INFO L273 TraceCheckUtils]: 77: Hoare triple {50436#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50436#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:51,688 INFO L273 TraceCheckUtils]: 78: Hoare triple {50436#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50436#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:51,688 INFO L273 TraceCheckUtils]: 79: Hoare triple {50436#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50437#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:51,689 INFO L273 TraceCheckUtils]: 80: Hoare triple {50437#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50437#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:51,689 INFO L273 TraceCheckUtils]: 81: Hoare triple {50437#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50437#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:51,690 INFO L273 TraceCheckUtils]: 82: Hoare triple {50437#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50438#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:51,691 INFO L273 TraceCheckUtils]: 83: Hoare triple {50438#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50438#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:51,691 INFO L273 TraceCheckUtils]: 84: Hoare triple {50438#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50438#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:51,692 INFO L273 TraceCheckUtils]: 85: Hoare triple {50438#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50439#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:51,692 INFO L273 TraceCheckUtils]: 86: Hoare triple {50439#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50439#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:51,693 INFO L273 TraceCheckUtils]: 87: Hoare triple {50439#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50439#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:51,694 INFO L273 TraceCheckUtils]: 88: Hoare triple {50439#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50440#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:51,694 INFO L273 TraceCheckUtils]: 89: Hoare triple {50440#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50440#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:51,695 INFO L273 TraceCheckUtils]: 90: Hoare triple {50440#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50440#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:51,695 INFO L273 TraceCheckUtils]: 91: Hoare triple {50440#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50441#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:51,696 INFO L273 TraceCheckUtils]: 92: Hoare triple {50441#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50441#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:51,696 INFO L273 TraceCheckUtils]: 93: Hoare triple {50441#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50441#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:51,697 INFO L273 TraceCheckUtils]: 94: Hoare triple {50441#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50442#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:51,698 INFO L273 TraceCheckUtils]: 95: Hoare triple {50442#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50442#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:51,698 INFO L273 TraceCheckUtils]: 96: Hoare triple {50442#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50442#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:51,699 INFO L273 TraceCheckUtils]: 97: Hoare triple {50442#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50443#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:51,699 INFO L273 TraceCheckUtils]: 98: Hoare triple {50443#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50443#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:51,700 INFO L273 TraceCheckUtils]: 99: Hoare triple {50443#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50443#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:51,700 INFO L273 TraceCheckUtils]: 100: Hoare triple {50443#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50444#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:51,701 INFO L273 TraceCheckUtils]: 101: Hoare triple {50444#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50444#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:51,701 INFO L273 TraceCheckUtils]: 102: Hoare triple {50444#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50444#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:51,702 INFO L273 TraceCheckUtils]: 103: Hoare triple {50444#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50445#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:51,703 INFO L273 TraceCheckUtils]: 104: Hoare triple {50445#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50445#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:51,703 INFO L273 TraceCheckUtils]: 105: Hoare triple {50445#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50445#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:51,704 INFO L273 TraceCheckUtils]: 106: Hoare triple {50445#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50446#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:51,704 INFO L273 TraceCheckUtils]: 107: Hoare triple {50446#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50446#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:51,705 INFO L273 TraceCheckUtils]: 108: Hoare triple {50446#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50446#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:51,706 INFO L273 TraceCheckUtils]: 109: Hoare triple {50446#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50447#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:51,706 INFO L273 TraceCheckUtils]: 110: Hoare triple {50447#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50447#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:51,707 INFO L273 TraceCheckUtils]: 111: Hoare triple {50447#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50447#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:51,707 INFO L273 TraceCheckUtils]: 112: Hoare triple {50447#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50448#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:51,708 INFO L273 TraceCheckUtils]: 113: Hoare triple {50448#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50448#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:51,708 INFO L273 TraceCheckUtils]: 114: Hoare triple {50448#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50448#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:51,709 INFO L273 TraceCheckUtils]: 115: Hoare triple {50448#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50449#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:51,710 INFO L273 TraceCheckUtils]: 116: Hoare triple {50449#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50449#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:51,710 INFO L273 TraceCheckUtils]: 117: Hoare triple {50449#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50449#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:51,711 INFO L273 TraceCheckUtils]: 118: Hoare triple {50449#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50450#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:51,711 INFO L273 TraceCheckUtils]: 119: Hoare triple {50450#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50450#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:51,712 INFO L273 TraceCheckUtils]: 120: Hoare triple {50450#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50450#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:51,713 INFO L273 TraceCheckUtils]: 121: Hoare triple {50450#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50451#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:51,713 INFO L273 TraceCheckUtils]: 122: Hoare triple {50451#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50451#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:51,714 INFO L273 TraceCheckUtils]: 123: Hoare triple {50451#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50451#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:51,714 INFO L273 TraceCheckUtils]: 124: Hoare triple {50451#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50452#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:51,715 INFO L273 TraceCheckUtils]: 125: Hoare triple {50452#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50452#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:51,715 INFO L273 TraceCheckUtils]: 126: Hoare triple {50452#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50452#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:51,716 INFO L273 TraceCheckUtils]: 127: Hoare triple {50452#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50453#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:51,716 INFO L273 TraceCheckUtils]: 128: Hoare triple {50453#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50453#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:51,717 INFO L273 TraceCheckUtils]: 129: Hoare triple {50453#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50453#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:51,718 INFO L273 TraceCheckUtils]: 130: Hoare triple {50453#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50454#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:51,718 INFO L273 TraceCheckUtils]: 131: Hoare triple {50454#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50454#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:51,719 INFO L273 TraceCheckUtils]: 132: Hoare triple {50454#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50454#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:51,719 INFO L273 TraceCheckUtils]: 133: Hoare triple {50454#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50455#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:51,720 INFO L273 TraceCheckUtils]: 134: Hoare triple {50455#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50455#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:51,720 INFO L273 TraceCheckUtils]: 135: Hoare triple {50455#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50455#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:51,721 INFO L273 TraceCheckUtils]: 136: Hoare triple {50455#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50456#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:51,722 INFO L273 TraceCheckUtils]: 137: Hoare triple {50456#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50456#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:51,722 INFO L273 TraceCheckUtils]: 138: Hoare triple {50456#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50456#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:51,723 INFO L273 TraceCheckUtils]: 139: Hoare triple {50456#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50457#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:51,723 INFO L273 TraceCheckUtils]: 140: Hoare triple {50457#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50457#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:51,724 INFO L273 TraceCheckUtils]: 141: Hoare triple {50457#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50457#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:51,725 INFO L273 TraceCheckUtils]: 142: Hoare triple {50457#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50458#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:51,725 INFO L273 TraceCheckUtils]: 143: Hoare triple {50458#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50458#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:51,726 INFO L273 TraceCheckUtils]: 144: Hoare triple {50458#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50458#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:51,726 INFO L273 TraceCheckUtils]: 145: Hoare triple {50458#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50459#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:51,727 INFO L273 TraceCheckUtils]: 146: Hoare triple {50459#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50459#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:51,727 INFO L273 TraceCheckUtils]: 147: Hoare triple {50459#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50459#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:51,728 INFO L273 TraceCheckUtils]: 148: Hoare triple {50459#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50460#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:51,729 INFO L273 TraceCheckUtils]: 149: Hoare triple {50460#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50460#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:51,729 INFO L273 TraceCheckUtils]: 150: Hoare triple {50460#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50460#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:51,730 INFO L273 TraceCheckUtils]: 151: Hoare triple {50460#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50461#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:51,730 INFO L273 TraceCheckUtils]: 152: Hoare triple {50461#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50461#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:51,731 INFO L273 TraceCheckUtils]: 153: Hoare triple {50461#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50461#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:51,731 INFO L273 TraceCheckUtils]: 154: Hoare triple {50461#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50462#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:51,732 INFO L273 TraceCheckUtils]: 155: Hoare triple {50462#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50462#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:51,732 INFO L273 TraceCheckUtils]: 156: Hoare triple {50462#(<= main_~i~0 51)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50462#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:51,733 INFO L273 TraceCheckUtils]: 157: Hoare triple {50462#(<= main_~i~0 51)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50463#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:51,734 INFO L273 TraceCheckUtils]: 158: Hoare triple {50463#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50463#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:51,734 INFO L273 TraceCheckUtils]: 159: Hoare triple {50463#(<= main_~i~0 52)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50463#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:51,735 INFO L273 TraceCheckUtils]: 160: Hoare triple {50463#(<= main_~i~0 52)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50464#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:51,735 INFO L273 TraceCheckUtils]: 161: Hoare triple {50464#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50464#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:51,736 INFO L273 TraceCheckUtils]: 162: Hoare triple {50464#(<= main_~i~0 53)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50464#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:51,737 INFO L273 TraceCheckUtils]: 163: Hoare triple {50464#(<= main_~i~0 53)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50465#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:51,737 INFO L273 TraceCheckUtils]: 164: Hoare triple {50465#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {50465#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:51,738 INFO L273 TraceCheckUtils]: 165: Hoare triple {50465#(<= main_~i~0 54)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {50465#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:51,738 INFO L273 TraceCheckUtils]: 166: Hoare triple {50465#(<= main_~i~0 54)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {50466#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:51,739 INFO L273 TraceCheckUtils]: 167: Hoare triple {50466#(<= main_~i~0 55)} assume !(~i~0 < 100000); {50412#false} is VALID [2018-11-23 12:00:51,739 INFO L273 TraceCheckUtils]: 168: Hoare triple {50412#false} havoc ~x~0;~x~0 := 0; {50412#false} is VALID [2018-11-23 12:00:51,739 INFO L273 TraceCheckUtils]: 169: Hoare triple {50412#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {50412#false} is VALID [2018-11-23 12:00:51,740 INFO L256 TraceCheckUtils]: 170: Hoare triple {50412#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {50412#false} is VALID [2018-11-23 12:00:51,740 INFO L273 TraceCheckUtils]: 171: Hoare triple {50412#false} ~cond := #in~cond; {50412#false} is VALID [2018-11-23 12:00:51,740 INFO L273 TraceCheckUtils]: 172: Hoare triple {50412#false} assume 0 == ~cond; {50412#false} is VALID [2018-11-23 12:00:51,740 INFO L273 TraceCheckUtils]: 173: Hoare triple {50412#false} assume !false; {50412#false} is VALID [2018-11-23 12:00:51,759 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:51,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:51,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 56] total 56 [2018-11-23 12:00:51,778 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 174 [2018-11-23 12:00:51,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:51,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states. [2018-11-23 12:00:51,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 174 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:51,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-11-23 12:00:51,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-11-23 12:00:51,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 12:00:51,949 INFO L87 Difference]: Start difference. First operand 238 states and 349 transitions. Second operand 56 states. [2018-11-23 12:00:53,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:53,612 INFO L93 Difference]: Finished difference Result 262 states and 381 transitions. [2018-11-23 12:00:53,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-11-23 12:00:53,612 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 174 [2018-11-23 12:00:53,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:53,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:00:53,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 381 transitions. [2018-11-23 12:00:53,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 12:00:53,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 381 transitions. [2018-11-23 12:00:53,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 56 states and 381 transitions. [2018-11-23 12:00:53,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 381 edges. 381 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:53,985 INFO L225 Difference]: With dead ends: 262 [2018-11-23 12:00:53,985 INFO L226 Difference]: Without dead ends: 245 [2018-11-23 12:00:53,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-11-23 12:00:53,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-11-23 12:00:54,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2018-11-23 12:00:54,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:00:54,078 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand 242 states. [2018-11-23 12:00:54,078 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand 242 states. [2018-11-23 12:00:54,079 INFO L87 Difference]: Start difference. First operand 245 states. Second operand 242 states. [2018-11-23 12:00:54,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:54,083 INFO L93 Difference]: Finished difference Result 245 states and 360 transitions. [2018-11-23 12:00:54,083 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 360 transitions. [2018-11-23 12:00:54,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:54,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:54,083 INFO L74 IsIncluded]: Start isIncluded. First operand 242 states. Second operand 245 states. [2018-11-23 12:00:54,083 INFO L87 Difference]: Start difference. First operand 242 states. Second operand 245 states. [2018-11-23 12:00:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:54,087 INFO L93 Difference]: Finished difference Result 245 states and 360 transitions. [2018-11-23 12:00:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 360 transitions. [2018-11-23 12:00:54,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:00:54,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:00:54,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:00:54,088 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:00:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-11-23 12:00:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 355 transitions. [2018-11-23 12:00:54,092 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 355 transitions. Word has length 174 [2018-11-23 12:00:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:00:54,092 INFO L480 AbstractCegarLoop]: Abstraction has 242 states and 355 transitions. [2018-11-23 12:00:54,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-11-23 12:00:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 355 transitions. [2018-11-23 12:00:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-11-23 12:00:54,093 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:00:54,093 INFO L402 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:00:54,093 INFO L423 AbstractCegarLoop]: === Iteration 56 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:00:54,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:00:54,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1077049092, now seen corresponding path program 54 times [2018-11-23 12:00:54,093 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:00:54,093 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:00:54,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:54,094 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:00:54,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:00:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:55,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {52115#true} call ULTIMATE.init(); {52115#true} is VALID [2018-11-23 12:00:55,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {52115#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52115#true} is VALID [2018-11-23 12:00:55,558 INFO L273 TraceCheckUtils]: 2: Hoare triple {52115#true} assume true; {52115#true} is VALID [2018-11-23 12:00:55,558 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52115#true} {52115#true} #88#return; {52115#true} is VALID [2018-11-23 12:00:55,558 INFO L256 TraceCheckUtils]: 4: Hoare triple {52115#true} call #t~ret13 := main(); {52115#true} is VALID [2018-11-23 12:00:55,558 INFO L273 TraceCheckUtils]: 5: Hoare triple {52115#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {52115#true} is VALID [2018-11-23 12:00:55,558 INFO L273 TraceCheckUtils]: 6: Hoare triple {52115#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {52115#true} is VALID [2018-11-23 12:00:55,559 INFO L273 TraceCheckUtils]: 7: Hoare triple {52115#true} ~i~0 := 2; {52117#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:55,559 INFO L273 TraceCheckUtils]: 8: Hoare triple {52117#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52117#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:55,559 INFO L273 TraceCheckUtils]: 9: Hoare triple {52117#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52117#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:55,560 INFO L273 TraceCheckUtils]: 10: Hoare triple {52117#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52118#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:55,560 INFO L273 TraceCheckUtils]: 11: Hoare triple {52118#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52118#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:55,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {52118#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52118#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:55,561 INFO L273 TraceCheckUtils]: 13: Hoare triple {52118#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52119#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:55,562 INFO L273 TraceCheckUtils]: 14: Hoare triple {52119#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52119#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:55,562 INFO L273 TraceCheckUtils]: 15: Hoare triple {52119#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52119#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:55,563 INFO L273 TraceCheckUtils]: 16: Hoare triple {52119#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52120#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:55,563 INFO L273 TraceCheckUtils]: 17: Hoare triple {52120#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52120#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:55,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {52120#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52120#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:55,565 INFO L273 TraceCheckUtils]: 19: Hoare triple {52120#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52121#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:55,565 INFO L273 TraceCheckUtils]: 20: Hoare triple {52121#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52121#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:55,566 INFO L273 TraceCheckUtils]: 21: Hoare triple {52121#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52121#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:55,566 INFO L273 TraceCheckUtils]: 22: Hoare triple {52121#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52122#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:55,567 INFO L273 TraceCheckUtils]: 23: Hoare triple {52122#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52122#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:55,567 INFO L273 TraceCheckUtils]: 24: Hoare triple {52122#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52122#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:55,569 INFO L273 TraceCheckUtils]: 25: Hoare triple {52122#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52123#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:55,569 INFO L273 TraceCheckUtils]: 26: Hoare triple {52123#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52123#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:55,571 INFO L273 TraceCheckUtils]: 27: Hoare triple {52123#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52123#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:55,571 INFO L273 TraceCheckUtils]: 28: Hoare triple {52123#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52124#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:55,572 INFO L273 TraceCheckUtils]: 29: Hoare triple {52124#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52124#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:55,572 INFO L273 TraceCheckUtils]: 30: Hoare triple {52124#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52124#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:55,573 INFO L273 TraceCheckUtils]: 31: Hoare triple {52124#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52125#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:55,573 INFO L273 TraceCheckUtils]: 32: Hoare triple {52125#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52125#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:55,573 INFO L273 TraceCheckUtils]: 33: Hoare triple {52125#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52125#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:55,574 INFO L273 TraceCheckUtils]: 34: Hoare triple {52125#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52126#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:55,575 INFO L273 TraceCheckUtils]: 35: Hoare triple {52126#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52126#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:55,575 INFO L273 TraceCheckUtils]: 36: Hoare triple {52126#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52126#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:55,577 INFO L273 TraceCheckUtils]: 37: Hoare triple {52126#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52127#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:55,577 INFO L273 TraceCheckUtils]: 38: Hoare triple {52127#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52127#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:55,579 INFO L273 TraceCheckUtils]: 39: Hoare triple {52127#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52127#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:55,579 INFO L273 TraceCheckUtils]: 40: Hoare triple {52127#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52128#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:55,579 INFO L273 TraceCheckUtils]: 41: Hoare triple {52128#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52128#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:55,580 INFO L273 TraceCheckUtils]: 42: Hoare triple {52128#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52128#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:55,580 INFO L273 TraceCheckUtils]: 43: Hoare triple {52128#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52129#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:55,580 INFO L273 TraceCheckUtils]: 44: Hoare triple {52129#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52129#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:55,581 INFO L273 TraceCheckUtils]: 45: Hoare triple {52129#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52129#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:55,581 INFO L273 TraceCheckUtils]: 46: Hoare triple {52129#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52130#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:55,581 INFO L273 TraceCheckUtils]: 47: Hoare triple {52130#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52130#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:55,582 INFO L273 TraceCheckUtils]: 48: Hoare triple {52130#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52130#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:55,582 INFO L273 TraceCheckUtils]: 49: Hoare triple {52130#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52131#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:55,583 INFO L273 TraceCheckUtils]: 50: Hoare triple {52131#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52131#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:55,583 INFO L273 TraceCheckUtils]: 51: Hoare triple {52131#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52131#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:55,584 INFO L273 TraceCheckUtils]: 52: Hoare triple {52131#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52132#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:55,584 INFO L273 TraceCheckUtils]: 53: Hoare triple {52132#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52132#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:55,585 INFO L273 TraceCheckUtils]: 54: Hoare triple {52132#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52132#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:55,585 INFO L273 TraceCheckUtils]: 55: Hoare triple {52132#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52133#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:55,586 INFO L273 TraceCheckUtils]: 56: Hoare triple {52133#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52133#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:55,586 INFO L273 TraceCheckUtils]: 57: Hoare triple {52133#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52133#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:55,587 INFO L273 TraceCheckUtils]: 58: Hoare triple {52133#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52134#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:55,588 INFO L273 TraceCheckUtils]: 59: Hoare triple {52134#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52134#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:55,588 INFO L273 TraceCheckUtils]: 60: Hoare triple {52134#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52134#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:55,589 INFO L273 TraceCheckUtils]: 61: Hoare triple {52134#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52135#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:55,589 INFO L273 TraceCheckUtils]: 62: Hoare triple {52135#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52135#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:55,590 INFO L273 TraceCheckUtils]: 63: Hoare triple {52135#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52135#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:55,591 INFO L273 TraceCheckUtils]: 64: Hoare triple {52135#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52136#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:55,591 INFO L273 TraceCheckUtils]: 65: Hoare triple {52136#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52136#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:55,592 INFO L273 TraceCheckUtils]: 66: Hoare triple {52136#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52136#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:55,592 INFO L273 TraceCheckUtils]: 67: Hoare triple {52136#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52137#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:55,593 INFO L273 TraceCheckUtils]: 68: Hoare triple {52137#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52137#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:55,596 INFO L273 TraceCheckUtils]: 69: Hoare triple {52137#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52137#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:55,596 INFO L273 TraceCheckUtils]: 70: Hoare triple {52137#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52138#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:55,597 INFO L273 TraceCheckUtils]: 71: Hoare triple {52138#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52138#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:55,597 INFO L273 TraceCheckUtils]: 72: Hoare triple {52138#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52138#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:55,598 INFO L273 TraceCheckUtils]: 73: Hoare triple {52138#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52139#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:55,598 INFO L273 TraceCheckUtils]: 74: Hoare triple {52139#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52139#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:55,600 INFO L273 TraceCheckUtils]: 75: Hoare triple {52139#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52139#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:55,600 INFO L273 TraceCheckUtils]: 76: Hoare triple {52139#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52140#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:55,602 INFO L273 TraceCheckUtils]: 77: Hoare triple {52140#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52140#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:55,602 INFO L273 TraceCheckUtils]: 78: Hoare triple {52140#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52140#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:55,605 INFO L273 TraceCheckUtils]: 79: Hoare triple {52140#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52141#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:55,605 INFO L273 TraceCheckUtils]: 80: Hoare triple {52141#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52141#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:55,607 INFO L273 TraceCheckUtils]: 81: Hoare triple {52141#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52141#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:55,607 INFO L273 TraceCheckUtils]: 82: Hoare triple {52141#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52142#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:55,609 INFO L273 TraceCheckUtils]: 83: Hoare triple {52142#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52142#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:55,609 INFO L273 TraceCheckUtils]: 84: Hoare triple {52142#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52142#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:55,611 INFO L273 TraceCheckUtils]: 85: Hoare triple {52142#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52143#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:55,611 INFO L273 TraceCheckUtils]: 86: Hoare triple {52143#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52143#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:55,613 INFO L273 TraceCheckUtils]: 87: Hoare triple {52143#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52143#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:55,613 INFO L273 TraceCheckUtils]: 88: Hoare triple {52143#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52144#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:55,615 INFO L273 TraceCheckUtils]: 89: Hoare triple {52144#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52144#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:55,615 INFO L273 TraceCheckUtils]: 90: Hoare triple {52144#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52144#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:55,617 INFO L273 TraceCheckUtils]: 91: Hoare triple {52144#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52145#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:55,617 INFO L273 TraceCheckUtils]: 92: Hoare triple {52145#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52145#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:55,619 INFO L273 TraceCheckUtils]: 93: Hoare triple {52145#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52145#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:55,619 INFO L273 TraceCheckUtils]: 94: Hoare triple {52145#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52146#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:55,621 INFO L273 TraceCheckUtils]: 95: Hoare triple {52146#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52146#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:55,621 INFO L273 TraceCheckUtils]: 96: Hoare triple {52146#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52146#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:55,623 INFO L273 TraceCheckUtils]: 97: Hoare triple {52146#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52147#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:55,623 INFO L273 TraceCheckUtils]: 98: Hoare triple {52147#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52147#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:55,625 INFO L273 TraceCheckUtils]: 99: Hoare triple {52147#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52147#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:55,625 INFO L273 TraceCheckUtils]: 100: Hoare triple {52147#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52148#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:55,627 INFO L273 TraceCheckUtils]: 101: Hoare triple {52148#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52148#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:55,627 INFO L273 TraceCheckUtils]: 102: Hoare triple {52148#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52148#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:55,629 INFO L273 TraceCheckUtils]: 103: Hoare triple {52148#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52149#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:55,629 INFO L273 TraceCheckUtils]: 104: Hoare triple {52149#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52149#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:55,631 INFO L273 TraceCheckUtils]: 105: Hoare triple {52149#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52149#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:55,631 INFO L273 TraceCheckUtils]: 106: Hoare triple {52149#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52150#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:55,633 INFO L273 TraceCheckUtils]: 107: Hoare triple {52150#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52150#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:55,633 INFO L273 TraceCheckUtils]: 108: Hoare triple {52150#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52150#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:55,635 INFO L273 TraceCheckUtils]: 109: Hoare triple {52150#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52151#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:55,635 INFO L273 TraceCheckUtils]: 110: Hoare triple {52151#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52151#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:55,637 INFO L273 TraceCheckUtils]: 111: Hoare triple {52151#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52151#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:55,637 INFO L273 TraceCheckUtils]: 112: Hoare triple {52151#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52152#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:55,640 INFO L273 TraceCheckUtils]: 113: Hoare triple {52152#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52152#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:55,640 INFO L273 TraceCheckUtils]: 114: Hoare triple {52152#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52152#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:55,642 INFO L273 TraceCheckUtils]: 115: Hoare triple {52152#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52153#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:55,642 INFO L273 TraceCheckUtils]: 116: Hoare triple {52153#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52153#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:55,642 INFO L273 TraceCheckUtils]: 117: Hoare triple {52153#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52153#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:55,643 INFO L273 TraceCheckUtils]: 118: Hoare triple {52153#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52154#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:55,644 INFO L273 TraceCheckUtils]: 119: Hoare triple {52154#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52154#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:55,646 INFO L273 TraceCheckUtils]: 120: Hoare triple {52154#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52154#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:55,646 INFO L273 TraceCheckUtils]: 121: Hoare triple {52154#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52155#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:55,648 INFO L273 TraceCheckUtils]: 122: Hoare triple {52155#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52155#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:55,648 INFO L273 TraceCheckUtils]: 123: Hoare triple {52155#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52155#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:55,650 INFO L273 TraceCheckUtils]: 124: Hoare triple {52155#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52156#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:55,650 INFO L273 TraceCheckUtils]: 125: Hoare triple {52156#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52156#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:55,652 INFO L273 TraceCheckUtils]: 126: Hoare triple {52156#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52156#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:55,652 INFO L273 TraceCheckUtils]: 127: Hoare triple {52156#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52157#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:55,655 INFO L273 TraceCheckUtils]: 128: Hoare triple {52157#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52157#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:55,655 INFO L273 TraceCheckUtils]: 129: Hoare triple {52157#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52157#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:55,657 INFO L273 TraceCheckUtils]: 130: Hoare triple {52157#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52158#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:55,657 INFO L273 TraceCheckUtils]: 131: Hoare triple {52158#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52158#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:55,659 INFO L273 TraceCheckUtils]: 132: Hoare triple {52158#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52158#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:55,659 INFO L273 TraceCheckUtils]: 133: Hoare triple {52158#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52159#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:55,661 INFO L273 TraceCheckUtils]: 134: Hoare triple {52159#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52159#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:55,661 INFO L273 TraceCheckUtils]: 135: Hoare triple {52159#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52159#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:55,663 INFO L273 TraceCheckUtils]: 136: Hoare triple {52159#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52160#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:55,663 INFO L273 TraceCheckUtils]: 137: Hoare triple {52160#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52160#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:55,665 INFO L273 TraceCheckUtils]: 138: Hoare triple {52160#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52160#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:55,665 INFO L273 TraceCheckUtils]: 139: Hoare triple {52160#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52161#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:55,665 INFO L273 TraceCheckUtils]: 140: Hoare triple {52161#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52161#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:55,666 INFO L273 TraceCheckUtils]: 141: Hoare triple {52161#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52161#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:55,667 INFO L273 TraceCheckUtils]: 142: Hoare triple {52161#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52162#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:55,667 INFO L273 TraceCheckUtils]: 143: Hoare triple {52162#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52162#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:55,667 INFO L273 TraceCheckUtils]: 144: Hoare triple {52162#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52162#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:55,668 INFO L273 TraceCheckUtils]: 145: Hoare triple {52162#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52163#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:55,669 INFO L273 TraceCheckUtils]: 146: Hoare triple {52163#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52163#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:55,669 INFO L273 TraceCheckUtils]: 147: Hoare triple {52163#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52163#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:55,670 INFO L273 TraceCheckUtils]: 148: Hoare triple {52163#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52164#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:55,670 INFO L273 TraceCheckUtils]: 149: Hoare triple {52164#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52164#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:55,672 INFO L273 TraceCheckUtils]: 150: Hoare triple {52164#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52164#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:55,672 INFO L273 TraceCheckUtils]: 151: Hoare triple {52164#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52165#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:55,673 INFO L273 TraceCheckUtils]: 152: Hoare triple {52165#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52165#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:55,673 INFO L273 TraceCheckUtils]: 153: Hoare triple {52165#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52165#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:55,675 INFO L273 TraceCheckUtils]: 154: Hoare triple {52165#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52166#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:55,675 INFO L273 TraceCheckUtils]: 155: Hoare triple {52166#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52166#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:55,677 INFO L273 TraceCheckUtils]: 156: Hoare triple {52166#(<= main_~i~0 51)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52166#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:55,677 INFO L273 TraceCheckUtils]: 157: Hoare triple {52166#(<= main_~i~0 51)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52167#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:55,678 INFO L273 TraceCheckUtils]: 158: Hoare triple {52167#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52167#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:55,678 INFO L273 TraceCheckUtils]: 159: Hoare triple {52167#(<= main_~i~0 52)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52167#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:55,683 INFO L273 TraceCheckUtils]: 160: Hoare triple {52167#(<= main_~i~0 52)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52168#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:55,683 INFO L273 TraceCheckUtils]: 161: Hoare triple {52168#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52168#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:55,683 INFO L273 TraceCheckUtils]: 162: Hoare triple {52168#(<= main_~i~0 53)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52168#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:55,684 INFO L273 TraceCheckUtils]: 163: Hoare triple {52168#(<= main_~i~0 53)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52169#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:55,684 INFO L273 TraceCheckUtils]: 164: Hoare triple {52169#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52169#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:55,685 INFO L273 TraceCheckUtils]: 165: Hoare triple {52169#(<= main_~i~0 54)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52169#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:55,685 INFO L273 TraceCheckUtils]: 166: Hoare triple {52169#(<= main_~i~0 54)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52170#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:55,685 INFO L273 TraceCheckUtils]: 167: Hoare triple {52170#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52170#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:55,686 INFO L273 TraceCheckUtils]: 168: Hoare triple {52170#(<= main_~i~0 55)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52170#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:55,687 INFO L273 TraceCheckUtils]: 169: Hoare triple {52170#(<= main_~i~0 55)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52171#(<= main_~i~0 56)} is VALID [2018-11-23 12:00:55,687 INFO L273 TraceCheckUtils]: 170: Hoare triple {52171#(<= main_~i~0 56)} assume !(~i~0 < 100000); {52116#false} is VALID [2018-11-23 12:00:55,687 INFO L273 TraceCheckUtils]: 171: Hoare triple {52116#false} havoc ~x~0;~x~0 := 0; {52116#false} is VALID [2018-11-23 12:00:55,687 INFO L273 TraceCheckUtils]: 172: Hoare triple {52116#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {52116#false} is VALID [2018-11-23 12:00:55,687 INFO L256 TraceCheckUtils]: 173: Hoare triple {52116#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {52116#false} is VALID [2018-11-23 12:00:55,688 INFO L273 TraceCheckUtils]: 174: Hoare triple {52116#false} ~cond := #in~cond; {52116#false} is VALID [2018-11-23 12:00:55,688 INFO L273 TraceCheckUtils]: 175: Hoare triple {52116#false} assume 0 == ~cond; {52116#false} is VALID [2018-11-23 12:00:55,688 INFO L273 TraceCheckUtils]: 176: Hoare triple {52116#false} assume !false; {52116#false} is VALID [2018-11-23 12:00:55,707 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:55,707 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:00:55,707 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-23 12:00:55,718 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-11-23 12:00:55,894 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 55 check-sat command(s) [2018-11-23 12:00:55,894 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 12:00:55,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:00:55,976 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:00:56,883 INFO L256 TraceCheckUtils]: 0: Hoare triple {52115#true} call ULTIMATE.init(); {52115#true} is VALID [2018-11-23 12:00:56,883 INFO L273 TraceCheckUtils]: 1: Hoare triple {52115#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {52115#true} is VALID [2018-11-23 12:00:56,883 INFO L273 TraceCheckUtils]: 2: Hoare triple {52115#true} assume true; {52115#true} is VALID [2018-11-23 12:00:56,883 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52115#true} {52115#true} #88#return; {52115#true} is VALID [2018-11-23 12:00:56,883 INFO L256 TraceCheckUtils]: 4: Hoare triple {52115#true} call #t~ret13 := main(); {52115#true} is VALID [2018-11-23 12:00:56,884 INFO L273 TraceCheckUtils]: 5: Hoare triple {52115#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {52115#true} is VALID [2018-11-23 12:00:56,884 INFO L273 TraceCheckUtils]: 6: Hoare triple {52115#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {52115#true} is VALID [2018-11-23 12:00:56,884 INFO L273 TraceCheckUtils]: 7: Hoare triple {52115#true} ~i~0 := 2; {52117#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:56,885 INFO L273 TraceCheckUtils]: 8: Hoare triple {52117#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52117#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:56,885 INFO L273 TraceCheckUtils]: 9: Hoare triple {52117#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52117#(<= main_~i~0 2)} is VALID [2018-11-23 12:00:56,886 INFO L273 TraceCheckUtils]: 10: Hoare triple {52117#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52118#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:56,886 INFO L273 TraceCheckUtils]: 11: Hoare triple {52118#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52118#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:56,886 INFO L273 TraceCheckUtils]: 12: Hoare triple {52118#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52118#(<= main_~i~0 3)} is VALID [2018-11-23 12:00:56,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {52118#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52119#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:56,887 INFO L273 TraceCheckUtils]: 14: Hoare triple {52119#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52119#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:56,888 INFO L273 TraceCheckUtils]: 15: Hoare triple {52119#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52119#(<= main_~i~0 4)} is VALID [2018-11-23 12:00:56,888 INFO L273 TraceCheckUtils]: 16: Hoare triple {52119#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52120#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:56,889 INFO L273 TraceCheckUtils]: 17: Hoare triple {52120#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52120#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:56,889 INFO L273 TraceCheckUtils]: 18: Hoare triple {52120#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52120#(<= main_~i~0 5)} is VALID [2018-11-23 12:00:56,890 INFO L273 TraceCheckUtils]: 19: Hoare triple {52120#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52121#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:56,890 INFO L273 TraceCheckUtils]: 20: Hoare triple {52121#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52121#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:56,891 INFO L273 TraceCheckUtils]: 21: Hoare triple {52121#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52121#(<= main_~i~0 6)} is VALID [2018-11-23 12:00:56,892 INFO L273 TraceCheckUtils]: 22: Hoare triple {52121#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52122#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:56,892 INFO L273 TraceCheckUtils]: 23: Hoare triple {52122#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52122#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:56,893 INFO L273 TraceCheckUtils]: 24: Hoare triple {52122#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52122#(<= main_~i~0 7)} is VALID [2018-11-23 12:00:56,893 INFO L273 TraceCheckUtils]: 25: Hoare triple {52122#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52123#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:56,894 INFO L273 TraceCheckUtils]: 26: Hoare triple {52123#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52123#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:56,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {52123#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52123#(<= main_~i~0 8)} is VALID [2018-11-23 12:00:56,895 INFO L273 TraceCheckUtils]: 28: Hoare triple {52123#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52124#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:56,896 INFO L273 TraceCheckUtils]: 29: Hoare triple {52124#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52124#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:56,896 INFO L273 TraceCheckUtils]: 30: Hoare triple {52124#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52124#(<= main_~i~0 9)} is VALID [2018-11-23 12:00:56,897 INFO L273 TraceCheckUtils]: 31: Hoare triple {52124#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52125#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:56,897 INFO L273 TraceCheckUtils]: 32: Hoare triple {52125#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52125#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:56,898 INFO L273 TraceCheckUtils]: 33: Hoare triple {52125#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52125#(<= main_~i~0 10)} is VALID [2018-11-23 12:00:56,899 INFO L273 TraceCheckUtils]: 34: Hoare triple {52125#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52126#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:56,899 INFO L273 TraceCheckUtils]: 35: Hoare triple {52126#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52126#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:56,900 INFO L273 TraceCheckUtils]: 36: Hoare triple {52126#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52126#(<= main_~i~0 11)} is VALID [2018-11-23 12:00:56,900 INFO L273 TraceCheckUtils]: 37: Hoare triple {52126#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52127#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:56,901 INFO L273 TraceCheckUtils]: 38: Hoare triple {52127#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52127#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:56,901 INFO L273 TraceCheckUtils]: 39: Hoare triple {52127#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52127#(<= main_~i~0 12)} is VALID [2018-11-23 12:00:56,902 INFO L273 TraceCheckUtils]: 40: Hoare triple {52127#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52128#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:56,902 INFO L273 TraceCheckUtils]: 41: Hoare triple {52128#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52128#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:56,903 INFO L273 TraceCheckUtils]: 42: Hoare triple {52128#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52128#(<= main_~i~0 13)} is VALID [2018-11-23 12:00:56,904 INFO L273 TraceCheckUtils]: 43: Hoare triple {52128#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52129#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:56,904 INFO L273 TraceCheckUtils]: 44: Hoare triple {52129#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52129#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:56,905 INFO L273 TraceCheckUtils]: 45: Hoare triple {52129#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52129#(<= main_~i~0 14)} is VALID [2018-11-23 12:00:56,905 INFO L273 TraceCheckUtils]: 46: Hoare triple {52129#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52130#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:56,906 INFO L273 TraceCheckUtils]: 47: Hoare triple {52130#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52130#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:56,906 INFO L273 TraceCheckUtils]: 48: Hoare triple {52130#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52130#(<= main_~i~0 15)} is VALID [2018-11-23 12:00:56,907 INFO L273 TraceCheckUtils]: 49: Hoare triple {52130#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52131#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:56,908 INFO L273 TraceCheckUtils]: 50: Hoare triple {52131#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52131#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:56,908 INFO L273 TraceCheckUtils]: 51: Hoare triple {52131#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52131#(<= main_~i~0 16)} is VALID [2018-11-23 12:00:56,909 INFO L273 TraceCheckUtils]: 52: Hoare triple {52131#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52132#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:56,909 INFO L273 TraceCheckUtils]: 53: Hoare triple {52132#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52132#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:56,910 INFO L273 TraceCheckUtils]: 54: Hoare triple {52132#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52132#(<= main_~i~0 17)} is VALID [2018-11-23 12:00:56,910 INFO L273 TraceCheckUtils]: 55: Hoare triple {52132#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52133#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:56,911 INFO L273 TraceCheckUtils]: 56: Hoare triple {52133#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52133#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:56,911 INFO L273 TraceCheckUtils]: 57: Hoare triple {52133#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52133#(<= main_~i~0 18)} is VALID [2018-11-23 12:00:56,912 INFO L273 TraceCheckUtils]: 58: Hoare triple {52133#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52134#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:56,913 INFO L273 TraceCheckUtils]: 59: Hoare triple {52134#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52134#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:56,913 INFO L273 TraceCheckUtils]: 60: Hoare triple {52134#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52134#(<= main_~i~0 19)} is VALID [2018-11-23 12:00:56,914 INFO L273 TraceCheckUtils]: 61: Hoare triple {52134#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52135#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:56,914 INFO L273 TraceCheckUtils]: 62: Hoare triple {52135#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52135#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:56,915 INFO L273 TraceCheckUtils]: 63: Hoare triple {52135#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52135#(<= main_~i~0 20)} is VALID [2018-11-23 12:00:56,916 INFO L273 TraceCheckUtils]: 64: Hoare triple {52135#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52136#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:56,916 INFO L273 TraceCheckUtils]: 65: Hoare triple {52136#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52136#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:56,917 INFO L273 TraceCheckUtils]: 66: Hoare triple {52136#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52136#(<= main_~i~0 21)} is VALID [2018-11-23 12:00:56,917 INFO L273 TraceCheckUtils]: 67: Hoare triple {52136#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52137#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:56,918 INFO L273 TraceCheckUtils]: 68: Hoare triple {52137#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52137#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:56,918 INFO L273 TraceCheckUtils]: 69: Hoare triple {52137#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52137#(<= main_~i~0 22)} is VALID [2018-11-23 12:00:56,919 INFO L273 TraceCheckUtils]: 70: Hoare triple {52137#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52138#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:56,920 INFO L273 TraceCheckUtils]: 71: Hoare triple {52138#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52138#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:56,920 INFO L273 TraceCheckUtils]: 72: Hoare triple {52138#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52138#(<= main_~i~0 23)} is VALID [2018-11-23 12:00:56,921 INFO L273 TraceCheckUtils]: 73: Hoare triple {52138#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52139#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:56,921 INFO L273 TraceCheckUtils]: 74: Hoare triple {52139#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52139#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:56,922 INFO L273 TraceCheckUtils]: 75: Hoare triple {52139#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52139#(<= main_~i~0 24)} is VALID [2018-11-23 12:00:56,923 INFO L273 TraceCheckUtils]: 76: Hoare triple {52139#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52140#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:56,923 INFO L273 TraceCheckUtils]: 77: Hoare triple {52140#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52140#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:56,924 INFO L273 TraceCheckUtils]: 78: Hoare triple {52140#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52140#(<= main_~i~0 25)} is VALID [2018-11-23 12:00:56,924 INFO L273 TraceCheckUtils]: 79: Hoare triple {52140#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52141#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:56,925 INFO L273 TraceCheckUtils]: 80: Hoare triple {52141#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52141#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:56,925 INFO L273 TraceCheckUtils]: 81: Hoare triple {52141#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52141#(<= main_~i~0 26)} is VALID [2018-11-23 12:00:56,926 INFO L273 TraceCheckUtils]: 82: Hoare triple {52141#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52142#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:56,926 INFO L273 TraceCheckUtils]: 83: Hoare triple {52142#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52142#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:56,927 INFO L273 TraceCheckUtils]: 84: Hoare triple {52142#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52142#(<= main_~i~0 27)} is VALID [2018-11-23 12:00:56,928 INFO L273 TraceCheckUtils]: 85: Hoare triple {52142#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52143#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:56,928 INFO L273 TraceCheckUtils]: 86: Hoare triple {52143#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52143#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:56,929 INFO L273 TraceCheckUtils]: 87: Hoare triple {52143#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52143#(<= main_~i~0 28)} is VALID [2018-11-23 12:00:56,929 INFO L273 TraceCheckUtils]: 88: Hoare triple {52143#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52144#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:56,930 INFO L273 TraceCheckUtils]: 89: Hoare triple {52144#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52144#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:56,930 INFO L273 TraceCheckUtils]: 90: Hoare triple {52144#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52144#(<= main_~i~0 29)} is VALID [2018-11-23 12:00:56,931 INFO L273 TraceCheckUtils]: 91: Hoare triple {52144#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52145#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:56,932 INFO L273 TraceCheckUtils]: 92: Hoare triple {52145#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52145#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:56,932 INFO L273 TraceCheckUtils]: 93: Hoare triple {52145#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52145#(<= main_~i~0 30)} is VALID [2018-11-23 12:00:56,933 INFO L273 TraceCheckUtils]: 94: Hoare triple {52145#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52146#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:56,933 INFO L273 TraceCheckUtils]: 95: Hoare triple {52146#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52146#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:56,934 INFO L273 TraceCheckUtils]: 96: Hoare triple {52146#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52146#(<= main_~i~0 31)} is VALID [2018-11-23 12:00:56,935 INFO L273 TraceCheckUtils]: 97: Hoare triple {52146#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52147#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:56,935 INFO L273 TraceCheckUtils]: 98: Hoare triple {52147#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52147#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:56,936 INFO L273 TraceCheckUtils]: 99: Hoare triple {52147#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52147#(<= main_~i~0 32)} is VALID [2018-11-23 12:00:56,936 INFO L273 TraceCheckUtils]: 100: Hoare triple {52147#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52148#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:56,937 INFO L273 TraceCheckUtils]: 101: Hoare triple {52148#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52148#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:56,937 INFO L273 TraceCheckUtils]: 102: Hoare triple {52148#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52148#(<= main_~i~0 33)} is VALID [2018-11-23 12:00:56,938 INFO L273 TraceCheckUtils]: 103: Hoare triple {52148#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52149#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:56,938 INFO L273 TraceCheckUtils]: 104: Hoare triple {52149#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52149#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:56,939 INFO L273 TraceCheckUtils]: 105: Hoare triple {52149#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52149#(<= main_~i~0 34)} is VALID [2018-11-23 12:00:56,940 INFO L273 TraceCheckUtils]: 106: Hoare triple {52149#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52150#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:56,940 INFO L273 TraceCheckUtils]: 107: Hoare triple {52150#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52150#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:56,941 INFO L273 TraceCheckUtils]: 108: Hoare triple {52150#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52150#(<= main_~i~0 35)} is VALID [2018-11-23 12:00:56,941 INFO L273 TraceCheckUtils]: 109: Hoare triple {52150#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52151#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:56,942 INFO L273 TraceCheckUtils]: 110: Hoare triple {52151#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52151#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:56,942 INFO L273 TraceCheckUtils]: 111: Hoare triple {52151#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52151#(<= main_~i~0 36)} is VALID [2018-11-23 12:00:56,943 INFO L273 TraceCheckUtils]: 112: Hoare triple {52151#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52152#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:56,944 INFO L273 TraceCheckUtils]: 113: Hoare triple {52152#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52152#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:56,944 INFO L273 TraceCheckUtils]: 114: Hoare triple {52152#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52152#(<= main_~i~0 37)} is VALID [2018-11-23 12:00:56,945 INFO L273 TraceCheckUtils]: 115: Hoare triple {52152#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52153#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:56,945 INFO L273 TraceCheckUtils]: 116: Hoare triple {52153#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52153#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:56,946 INFO L273 TraceCheckUtils]: 117: Hoare triple {52153#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52153#(<= main_~i~0 38)} is VALID [2018-11-23 12:00:56,947 INFO L273 TraceCheckUtils]: 118: Hoare triple {52153#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52154#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:56,947 INFO L273 TraceCheckUtils]: 119: Hoare triple {52154#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52154#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:56,948 INFO L273 TraceCheckUtils]: 120: Hoare triple {52154#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52154#(<= main_~i~0 39)} is VALID [2018-11-23 12:00:56,948 INFO L273 TraceCheckUtils]: 121: Hoare triple {52154#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52155#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:56,949 INFO L273 TraceCheckUtils]: 122: Hoare triple {52155#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52155#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:56,949 INFO L273 TraceCheckUtils]: 123: Hoare triple {52155#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52155#(<= main_~i~0 40)} is VALID [2018-11-23 12:00:56,950 INFO L273 TraceCheckUtils]: 124: Hoare triple {52155#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52156#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:56,950 INFO L273 TraceCheckUtils]: 125: Hoare triple {52156#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52156#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:56,951 INFO L273 TraceCheckUtils]: 126: Hoare triple {52156#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52156#(<= main_~i~0 41)} is VALID [2018-11-23 12:00:56,952 INFO L273 TraceCheckUtils]: 127: Hoare triple {52156#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52157#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:56,952 INFO L273 TraceCheckUtils]: 128: Hoare triple {52157#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52157#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:56,953 INFO L273 TraceCheckUtils]: 129: Hoare triple {52157#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52157#(<= main_~i~0 42)} is VALID [2018-11-23 12:00:56,953 INFO L273 TraceCheckUtils]: 130: Hoare triple {52157#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52158#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:56,954 INFO L273 TraceCheckUtils]: 131: Hoare triple {52158#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52158#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:56,954 INFO L273 TraceCheckUtils]: 132: Hoare triple {52158#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52158#(<= main_~i~0 43)} is VALID [2018-11-23 12:00:56,955 INFO L273 TraceCheckUtils]: 133: Hoare triple {52158#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52159#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:56,956 INFO L273 TraceCheckUtils]: 134: Hoare triple {52159#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52159#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:56,956 INFO L273 TraceCheckUtils]: 135: Hoare triple {52159#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52159#(<= main_~i~0 44)} is VALID [2018-11-23 12:00:56,957 INFO L273 TraceCheckUtils]: 136: Hoare triple {52159#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52160#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:56,957 INFO L273 TraceCheckUtils]: 137: Hoare triple {52160#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52160#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:56,958 INFO L273 TraceCheckUtils]: 138: Hoare triple {52160#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52160#(<= main_~i~0 45)} is VALID [2018-11-23 12:00:56,959 INFO L273 TraceCheckUtils]: 139: Hoare triple {52160#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52161#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:56,959 INFO L273 TraceCheckUtils]: 140: Hoare triple {52161#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52161#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:56,960 INFO L273 TraceCheckUtils]: 141: Hoare triple {52161#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52161#(<= main_~i~0 46)} is VALID [2018-11-23 12:00:56,960 INFO L273 TraceCheckUtils]: 142: Hoare triple {52161#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52162#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:56,961 INFO L273 TraceCheckUtils]: 143: Hoare triple {52162#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52162#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:56,961 INFO L273 TraceCheckUtils]: 144: Hoare triple {52162#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52162#(<= main_~i~0 47)} is VALID [2018-11-23 12:00:56,962 INFO L273 TraceCheckUtils]: 145: Hoare triple {52162#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52163#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:56,962 INFO L273 TraceCheckUtils]: 146: Hoare triple {52163#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52163#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:56,963 INFO L273 TraceCheckUtils]: 147: Hoare triple {52163#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52163#(<= main_~i~0 48)} is VALID [2018-11-23 12:00:56,964 INFO L273 TraceCheckUtils]: 148: Hoare triple {52163#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52164#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:56,964 INFO L273 TraceCheckUtils]: 149: Hoare triple {52164#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52164#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:56,965 INFO L273 TraceCheckUtils]: 150: Hoare triple {52164#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52164#(<= main_~i~0 49)} is VALID [2018-11-23 12:00:56,965 INFO L273 TraceCheckUtils]: 151: Hoare triple {52164#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52165#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:56,966 INFO L273 TraceCheckUtils]: 152: Hoare triple {52165#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52165#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:56,966 INFO L273 TraceCheckUtils]: 153: Hoare triple {52165#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52165#(<= main_~i~0 50)} is VALID [2018-11-23 12:00:56,967 INFO L273 TraceCheckUtils]: 154: Hoare triple {52165#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52166#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:56,968 INFO L273 TraceCheckUtils]: 155: Hoare triple {52166#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52166#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:56,968 INFO L273 TraceCheckUtils]: 156: Hoare triple {52166#(<= main_~i~0 51)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52166#(<= main_~i~0 51)} is VALID [2018-11-23 12:00:56,969 INFO L273 TraceCheckUtils]: 157: Hoare triple {52166#(<= main_~i~0 51)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52167#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:56,969 INFO L273 TraceCheckUtils]: 158: Hoare triple {52167#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52167#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:56,970 INFO L273 TraceCheckUtils]: 159: Hoare triple {52167#(<= main_~i~0 52)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52167#(<= main_~i~0 52)} is VALID [2018-11-23 12:00:56,971 INFO L273 TraceCheckUtils]: 160: Hoare triple {52167#(<= main_~i~0 52)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52168#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:56,971 INFO L273 TraceCheckUtils]: 161: Hoare triple {52168#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52168#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:56,972 INFO L273 TraceCheckUtils]: 162: Hoare triple {52168#(<= main_~i~0 53)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52168#(<= main_~i~0 53)} is VALID [2018-11-23 12:00:56,972 INFO L273 TraceCheckUtils]: 163: Hoare triple {52168#(<= main_~i~0 53)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52169#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:56,973 INFO L273 TraceCheckUtils]: 164: Hoare triple {52169#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52169#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:56,973 INFO L273 TraceCheckUtils]: 165: Hoare triple {52169#(<= main_~i~0 54)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52169#(<= main_~i~0 54)} is VALID [2018-11-23 12:00:56,974 INFO L273 TraceCheckUtils]: 166: Hoare triple {52169#(<= main_~i~0 54)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52170#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:56,974 INFO L273 TraceCheckUtils]: 167: Hoare triple {52170#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {52170#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:56,975 INFO L273 TraceCheckUtils]: 168: Hoare triple {52170#(<= main_~i~0 55)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {52170#(<= main_~i~0 55)} is VALID [2018-11-23 12:00:56,976 INFO L273 TraceCheckUtils]: 169: Hoare triple {52170#(<= main_~i~0 55)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {52171#(<= main_~i~0 56)} is VALID [2018-11-23 12:00:56,976 INFO L273 TraceCheckUtils]: 170: Hoare triple {52171#(<= main_~i~0 56)} assume !(~i~0 < 100000); {52116#false} is VALID [2018-11-23 12:00:56,977 INFO L273 TraceCheckUtils]: 171: Hoare triple {52116#false} havoc ~x~0;~x~0 := 0; {52116#false} is VALID [2018-11-23 12:00:56,977 INFO L273 TraceCheckUtils]: 172: Hoare triple {52116#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {52116#false} is VALID [2018-11-23 12:00:56,977 INFO L256 TraceCheckUtils]: 173: Hoare triple {52116#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {52116#false} is VALID [2018-11-23 12:00:56,977 INFO L273 TraceCheckUtils]: 174: Hoare triple {52116#false} ~cond := #in~cond; {52116#false} is VALID [2018-11-23 12:00:56,977 INFO L273 TraceCheckUtils]: 175: Hoare triple {52116#false} assume 0 == ~cond; {52116#false} is VALID [2018-11-23 12:00:56,977 INFO L273 TraceCheckUtils]: 176: Hoare triple {52116#false} assume !false; {52116#false} is VALID [2018-11-23 12:00:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:00:57,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:00:57,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 57] total 57 [2018-11-23 12:00:57,017 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 177 [2018-11-23 12:00:57,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:00:57,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states. [2018-11-23 12:00:57,190 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-23 12:00:57,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-11-23 12:00:57,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-11-23 12:00:57,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:00:57,192 INFO L87 Difference]: Start difference. First operand 242 states and 355 transitions. Second operand 57 states. [2018-11-23 12:00:59,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:00:59,355 INFO L93 Difference]: Finished difference Result 266 states and 387 transitions. [2018-11-23 12:00:59,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-11-23 12:00:59,355 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 177 [2018-11-23 12:00:59,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:00:59,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:00:59,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 387 transitions. [2018-11-23 12:00:59,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-11-23 12:00:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 387 transitions. [2018-11-23 12:00:59,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 387 transitions. [2018-11-23 12:00:59,737 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 387 edges. 387 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:00:59,742 INFO L225 Difference]: With dead ends: 266 [2018-11-23 12:00:59,742 INFO L226 Difference]: Without dead ends: 249 [2018-11-23 12:00:59,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-11-23 12:00:59,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-11-23 12:01:00,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-11-23 12:01:00,363 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:00,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 249 states. Second operand 246 states. [2018-11-23 12:01:00,363 INFO L74 IsIncluded]: Start isIncluded. First operand 249 states. Second operand 246 states. [2018-11-23 12:01:00,363 INFO L87 Difference]: Start difference. First operand 249 states. Second operand 246 states. [2018-11-23 12:01:00,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:00,368 INFO L93 Difference]: Finished difference Result 249 states and 366 transitions. [2018-11-23 12:01:00,368 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 366 transitions. [2018-11-23 12:01:00,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:00,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:00,368 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand 249 states. [2018-11-23 12:01:00,368 INFO L87 Difference]: Start difference. First operand 246 states. Second operand 249 states. [2018-11-23 12:01:00,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:00,372 INFO L93 Difference]: Finished difference Result 249 states and 366 transitions. [2018-11-23 12:01:00,372 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 366 transitions. [2018-11-23 12:01:00,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:00,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:00,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:00,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:00,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-11-23 12:01:00,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 361 transitions. [2018-11-23 12:01:00,377 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 361 transitions. Word has length 177 [2018-11-23 12:01:00,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:00,377 INFO L480 AbstractCegarLoop]: Abstraction has 246 states and 361 transitions. [2018-11-23 12:01:00,377 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-11-23 12:01:00,377 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 361 transitions. [2018-11-23 12:01:00,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-23 12:01:00,378 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:00,378 INFO L402 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:00,378 INFO L423 AbstractCegarLoop]: === Iteration 57 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:00,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:00,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1980950561, now seen corresponding path program 55 times [2018-11-23 12:01:00,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:00,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:00,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:00,380 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 12:01:00,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:00,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:02,114 INFO L256 TraceCheckUtils]: 0: Hoare triple {53847#true} call ULTIMATE.init(); {53847#true} is VALID [2018-11-23 12:01:02,114 INFO L273 TraceCheckUtils]: 1: Hoare triple {53847#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {53847#true} is VALID [2018-11-23 12:01:02,115 INFO L273 TraceCheckUtils]: 2: Hoare triple {53847#true} assume true; {53847#true} is VALID [2018-11-23 12:01:02,115 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53847#true} {53847#true} #88#return; {53847#true} is VALID [2018-11-23 12:01:02,115 INFO L256 TraceCheckUtils]: 4: Hoare triple {53847#true} call #t~ret13 := main(); {53847#true} is VALID [2018-11-23 12:01:02,115 INFO L273 TraceCheckUtils]: 5: Hoare triple {53847#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {53847#true} is VALID [2018-11-23 12:01:02,115 INFO L273 TraceCheckUtils]: 6: Hoare triple {53847#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {53847#true} is VALID [2018-11-23 12:01:02,116 INFO L273 TraceCheckUtils]: 7: Hoare triple {53847#true} ~i~0 := 2; {53849#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:02,116 INFO L273 TraceCheckUtils]: 8: Hoare triple {53849#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53849#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:02,117 INFO L273 TraceCheckUtils]: 9: Hoare triple {53849#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53849#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:02,118 INFO L273 TraceCheckUtils]: 10: Hoare triple {53849#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53850#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:02,118 INFO L273 TraceCheckUtils]: 11: Hoare triple {53850#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53850#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:02,118 INFO L273 TraceCheckUtils]: 12: Hoare triple {53850#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53850#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:02,119 INFO L273 TraceCheckUtils]: 13: Hoare triple {53850#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53851#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:02,119 INFO L273 TraceCheckUtils]: 14: Hoare triple {53851#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53851#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:02,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {53851#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53851#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:02,120 INFO L273 TraceCheckUtils]: 16: Hoare triple {53851#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53852#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:02,120 INFO L273 TraceCheckUtils]: 17: Hoare triple {53852#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53852#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:02,120 INFO L273 TraceCheckUtils]: 18: Hoare triple {53852#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53852#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:02,121 INFO L273 TraceCheckUtils]: 19: Hoare triple {53852#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53853#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:02,121 INFO L273 TraceCheckUtils]: 20: Hoare triple {53853#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53853#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:02,122 INFO L273 TraceCheckUtils]: 21: Hoare triple {53853#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53853#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:02,122 INFO L273 TraceCheckUtils]: 22: Hoare triple {53853#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53854#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:02,123 INFO L273 TraceCheckUtils]: 23: Hoare triple {53854#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53854#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:02,123 INFO L273 TraceCheckUtils]: 24: Hoare triple {53854#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53854#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:02,124 INFO L273 TraceCheckUtils]: 25: Hoare triple {53854#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53855#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:02,125 INFO L273 TraceCheckUtils]: 26: Hoare triple {53855#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53855#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:02,125 INFO L273 TraceCheckUtils]: 27: Hoare triple {53855#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53855#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:02,126 INFO L273 TraceCheckUtils]: 28: Hoare triple {53855#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53856#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:02,126 INFO L273 TraceCheckUtils]: 29: Hoare triple {53856#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53856#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:02,127 INFO L273 TraceCheckUtils]: 30: Hoare triple {53856#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53856#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:02,128 INFO L273 TraceCheckUtils]: 31: Hoare triple {53856#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53857#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:02,128 INFO L273 TraceCheckUtils]: 32: Hoare triple {53857#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53857#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:02,129 INFO L273 TraceCheckUtils]: 33: Hoare triple {53857#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53857#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:02,129 INFO L273 TraceCheckUtils]: 34: Hoare triple {53857#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53858#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:02,130 INFO L273 TraceCheckUtils]: 35: Hoare triple {53858#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53858#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:02,130 INFO L273 TraceCheckUtils]: 36: Hoare triple {53858#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53858#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:02,131 INFO L273 TraceCheckUtils]: 37: Hoare triple {53858#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53859#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:02,132 INFO L273 TraceCheckUtils]: 38: Hoare triple {53859#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53859#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:02,132 INFO L273 TraceCheckUtils]: 39: Hoare triple {53859#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53859#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:02,133 INFO L273 TraceCheckUtils]: 40: Hoare triple {53859#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53860#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:02,133 INFO L273 TraceCheckUtils]: 41: Hoare triple {53860#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53860#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:02,134 INFO L273 TraceCheckUtils]: 42: Hoare triple {53860#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53860#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:02,134 INFO L273 TraceCheckUtils]: 43: Hoare triple {53860#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53861#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:02,135 INFO L273 TraceCheckUtils]: 44: Hoare triple {53861#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53861#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:02,135 INFO L273 TraceCheckUtils]: 45: Hoare triple {53861#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53861#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:02,136 INFO L273 TraceCheckUtils]: 46: Hoare triple {53861#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53862#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:02,137 INFO L273 TraceCheckUtils]: 47: Hoare triple {53862#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53862#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:02,137 INFO L273 TraceCheckUtils]: 48: Hoare triple {53862#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53862#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:02,138 INFO L273 TraceCheckUtils]: 49: Hoare triple {53862#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53863#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:02,138 INFO L273 TraceCheckUtils]: 50: Hoare triple {53863#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53863#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:02,139 INFO L273 TraceCheckUtils]: 51: Hoare triple {53863#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53863#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:02,140 INFO L273 TraceCheckUtils]: 52: Hoare triple {53863#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53864#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:02,140 INFO L273 TraceCheckUtils]: 53: Hoare triple {53864#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53864#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:02,141 INFO L273 TraceCheckUtils]: 54: Hoare triple {53864#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53864#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:02,141 INFO L273 TraceCheckUtils]: 55: Hoare triple {53864#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53865#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:02,142 INFO L273 TraceCheckUtils]: 56: Hoare triple {53865#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53865#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:02,142 INFO L273 TraceCheckUtils]: 57: Hoare triple {53865#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53865#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:02,143 INFO L273 TraceCheckUtils]: 58: Hoare triple {53865#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53866#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:02,144 INFO L273 TraceCheckUtils]: 59: Hoare triple {53866#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53866#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:02,144 INFO L273 TraceCheckUtils]: 60: Hoare triple {53866#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53866#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:02,145 INFO L273 TraceCheckUtils]: 61: Hoare triple {53866#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53867#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:02,145 INFO L273 TraceCheckUtils]: 62: Hoare triple {53867#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53867#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:02,146 INFO L273 TraceCheckUtils]: 63: Hoare triple {53867#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53867#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:02,147 INFO L273 TraceCheckUtils]: 64: Hoare triple {53867#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53868#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:02,147 INFO L273 TraceCheckUtils]: 65: Hoare triple {53868#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53868#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:02,148 INFO L273 TraceCheckUtils]: 66: Hoare triple {53868#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53868#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:02,148 INFO L273 TraceCheckUtils]: 67: Hoare triple {53868#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53869#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:02,149 INFO L273 TraceCheckUtils]: 68: Hoare triple {53869#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53869#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:02,149 INFO L273 TraceCheckUtils]: 69: Hoare triple {53869#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53869#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:02,150 INFO L273 TraceCheckUtils]: 70: Hoare triple {53869#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53870#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:02,150 INFO L273 TraceCheckUtils]: 71: Hoare triple {53870#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53870#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:02,151 INFO L273 TraceCheckUtils]: 72: Hoare triple {53870#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53870#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:02,152 INFO L273 TraceCheckUtils]: 73: Hoare triple {53870#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53871#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:02,152 INFO L273 TraceCheckUtils]: 74: Hoare triple {53871#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53871#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:02,153 INFO L273 TraceCheckUtils]: 75: Hoare triple {53871#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53871#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:02,153 INFO L273 TraceCheckUtils]: 76: Hoare triple {53871#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53872#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:02,154 INFO L273 TraceCheckUtils]: 77: Hoare triple {53872#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53872#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:02,154 INFO L273 TraceCheckUtils]: 78: Hoare triple {53872#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53872#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:02,155 INFO L273 TraceCheckUtils]: 79: Hoare triple {53872#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53873#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:02,156 INFO L273 TraceCheckUtils]: 80: Hoare triple {53873#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53873#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:02,156 INFO L273 TraceCheckUtils]: 81: Hoare triple {53873#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53873#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:02,157 INFO L273 TraceCheckUtils]: 82: Hoare triple {53873#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53874#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:02,157 INFO L273 TraceCheckUtils]: 83: Hoare triple {53874#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53874#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:02,158 INFO L273 TraceCheckUtils]: 84: Hoare triple {53874#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53874#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:02,159 INFO L273 TraceCheckUtils]: 85: Hoare triple {53874#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53875#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:02,159 INFO L273 TraceCheckUtils]: 86: Hoare triple {53875#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53875#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:02,160 INFO L273 TraceCheckUtils]: 87: Hoare triple {53875#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53875#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:02,160 INFO L273 TraceCheckUtils]: 88: Hoare triple {53875#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53876#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:02,161 INFO L273 TraceCheckUtils]: 89: Hoare triple {53876#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53876#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:02,161 INFO L273 TraceCheckUtils]: 90: Hoare triple {53876#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53876#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:02,162 INFO L273 TraceCheckUtils]: 91: Hoare triple {53876#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53877#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:02,162 INFO L273 TraceCheckUtils]: 92: Hoare triple {53877#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53877#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:02,163 INFO L273 TraceCheckUtils]: 93: Hoare triple {53877#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53877#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:02,164 INFO L273 TraceCheckUtils]: 94: Hoare triple {53877#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53878#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:02,164 INFO L273 TraceCheckUtils]: 95: Hoare triple {53878#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53878#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:02,165 INFO L273 TraceCheckUtils]: 96: Hoare triple {53878#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53878#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:02,165 INFO L273 TraceCheckUtils]: 97: Hoare triple {53878#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53879#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:02,166 INFO L273 TraceCheckUtils]: 98: Hoare triple {53879#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53879#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:02,166 INFO L273 TraceCheckUtils]: 99: Hoare triple {53879#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53879#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:02,167 INFO L273 TraceCheckUtils]: 100: Hoare triple {53879#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53880#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:02,168 INFO L273 TraceCheckUtils]: 101: Hoare triple {53880#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53880#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:02,168 INFO L273 TraceCheckUtils]: 102: Hoare triple {53880#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53880#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:02,169 INFO L273 TraceCheckUtils]: 103: Hoare triple {53880#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53881#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:02,169 INFO L273 TraceCheckUtils]: 104: Hoare triple {53881#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53881#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:02,170 INFO L273 TraceCheckUtils]: 105: Hoare triple {53881#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53881#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:02,171 INFO L273 TraceCheckUtils]: 106: Hoare triple {53881#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53882#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:02,171 INFO L273 TraceCheckUtils]: 107: Hoare triple {53882#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53882#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:02,172 INFO L273 TraceCheckUtils]: 108: Hoare triple {53882#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53882#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:02,172 INFO L273 TraceCheckUtils]: 109: Hoare triple {53882#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53883#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:02,173 INFO L273 TraceCheckUtils]: 110: Hoare triple {53883#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53883#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:02,173 INFO L273 TraceCheckUtils]: 111: Hoare triple {53883#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53883#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:02,174 INFO L273 TraceCheckUtils]: 112: Hoare triple {53883#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53884#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:02,174 INFO L273 TraceCheckUtils]: 113: Hoare triple {53884#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53884#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:02,175 INFO L273 TraceCheckUtils]: 114: Hoare triple {53884#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53884#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:02,176 INFO L273 TraceCheckUtils]: 115: Hoare triple {53884#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53885#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:02,176 INFO L273 TraceCheckUtils]: 116: Hoare triple {53885#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53885#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:02,177 INFO L273 TraceCheckUtils]: 117: Hoare triple {53885#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53885#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:02,177 INFO L273 TraceCheckUtils]: 118: Hoare triple {53885#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53886#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:02,178 INFO L273 TraceCheckUtils]: 119: Hoare triple {53886#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53886#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:02,178 INFO L273 TraceCheckUtils]: 120: Hoare triple {53886#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53886#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:02,179 INFO L273 TraceCheckUtils]: 121: Hoare triple {53886#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53887#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:02,180 INFO L273 TraceCheckUtils]: 122: Hoare triple {53887#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53887#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:02,180 INFO L273 TraceCheckUtils]: 123: Hoare triple {53887#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53887#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:02,181 INFO L273 TraceCheckUtils]: 124: Hoare triple {53887#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53888#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:02,181 INFO L273 TraceCheckUtils]: 125: Hoare triple {53888#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53888#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:02,182 INFO L273 TraceCheckUtils]: 126: Hoare triple {53888#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53888#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:02,183 INFO L273 TraceCheckUtils]: 127: Hoare triple {53888#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53889#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:02,183 INFO L273 TraceCheckUtils]: 128: Hoare triple {53889#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53889#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:02,184 INFO L273 TraceCheckUtils]: 129: Hoare triple {53889#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53889#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:02,184 INFO L273 TraceCheckUtils]: 130: Hoare triple {53889#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53890#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:02,185 INFO L273 TraceCheckUtils]: 131: Hoare triple {53890#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53890#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:02,185 INFO L273 TraceCheckUtils]: 132: Hoare triple {53890#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53890#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:02,186 INFO L273 TraceCheckUtils]: 133: Hoare triple {53890#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53891#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:02,187 INFO L273 TraceCheckUtils]: 134: Hoare triple {53891#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53891#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:02,187 INFO L273 TraceCheckUtils]: 135: Hoare triple {53891#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53891#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:02,188 INFO L273 TraceCheckUtils]: 136: Hoare triple {53891#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53892#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:02,188 INFO L273 TraceCheckUtils]: 137: Hoare triple {53892#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53892#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:02,189 INFO L273 TraceCheckUtils]: 138: Hoare triple {53892#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53892#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:02,189 INFO L273 TraceCheckUtils]: 139: Hoare triple {53892#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53893#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:02,190 INFO L273 TraceCheckUtils]: 140: Hoare triple {53893#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53893#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:02,190 INFO L273 TraceCheckUtils]: 141: Hoare triple {53893#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53893#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:02,191 INFO L273 TraceCheckUtils]: 142: Hoare triple {53893#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53894#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:02,192 INFO L273 TraceCheckUtils]: 143: Hoare triple {53894#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53894#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:02,192 INFO L273 TraceCheckUtils]: 144: Hoare triple {53894#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53894#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:02,193 INFO L273 TraceCheckUtils]: 145: Hoare triple {53894#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53895#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:02,193 INFO L273 TraceCheckUtils]: 146: Hoare triple {53895#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53895#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:02,194 INFO L273 TraceCheckUtils]: 147: Hoare triple {53895#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53895#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:02,195 INFO L273 TraceCheckUtils]: 148: Hoare triple {53895#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53896#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:02,195 INFO L273 TraceCheckUtils]: 149: Hoare triple {53896#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53896#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:02,196 INFO L273 TraceCheckUtils]: 150: Hoare triple {53896#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53896#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:02,196 INFO L273 TraceCheckUtils]: 151: Hoare triple {53896#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53897#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:02,197 INFO L273 TraceCheckUtils]: 152: Hoare triple {53897#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53897#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:02,197 INFO L273 TraceCheckUtils]: 153: Hoare triple {53897#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53897#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:02,198 INFO L273 TraceCheckUtils]: 154: Hoare triple {53897#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53898#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:02,199 INFO L273 TraceCheckUtils]: 155: Hoare triple {53898#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53898#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:02,199 INFO L273 TraceCheckUtils]: 156: Hoare triple {53898#(<= main_~i~0 51)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53898#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:02,200 INFO L273 TraceCheckUtils]: 157: Hoare triple {53898#(<= main_~i~0 51)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53899#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:02,200 INFO L273 TraceCheckUtils]: 158: Hoare triple {53899#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53899#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:02,201 INFO L273 TraceCheckUtils]: 159: Hoare triple {53899#(<= main_~i~0 52)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53899#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:02,201 INFO L273 TraceCheckUtils]: 160: Hoare triple {53899#(<= main_~i~0 52)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53900#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:02,202 INFO L273 TraceCheckUtils]: 161: Hoare triple {53900#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53900#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:02,202 INFO L273 TraceCheckUtils]: 162: Hoare triple {53900#(<= main_~i~0 53)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53900#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:02,203 INFO L273 TraceCheckUtils]: 163: Hoare triple {53900#(<= main_~i~0 53)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53901#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:02,204 INFO L273 TraceCheckUtils]: 164: Hoare triple {53901#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53901#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:02,204 INFO L273 TraceCheckUtils]: 165: Hoare triple {53901#(<= main_~i~0 54)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53901#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:02,205 INFO L273 TraceCheckUtils]: 166: Hoare triple {53901#(<= main_~i~0 54)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53902#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:02,205 INFO L273 TraceCheckUtils]: 167: Hoare triple {53902#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53902#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:02,206 INFO L273 TraceCheckUtils]: 168: Hoare triple {53902#(<= main_~i~0 55)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53902#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:02,207 INFO L273 TraceCheckUtils]: 169: Hoare triple {53902#(<= main_~i~0 55)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53903#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:02,207 INFO L273 TraceCheckUtils]: 170: Hoare triple {53903#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53903#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:02,208 INFO L273 TraceCheckUtils]: 171: Hoare triple {53903#(<= main_~i~0 56)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53903#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:02,208 INFO L273 TraceCheckUtils]: 172: Hoare triple {53903#(<= main_~i~0 56)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53904#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:02,209 INFO L273 TraceCheckUtils]: 173: Hoare triple {53904#(<= main_~i~0 57)} assume !(~i~0 < 100000); {53848#false} is VALID [2018-11-23 12:01:02,209 INFO L273 TraceCheckUtils]: 174: Hoare triple {53848#false} havoc ~x~0;~x~0 := 0; {53848#false} is VALID [2018-11-23 12:01:02,209 INFO L273 TraceCheckUtils]: 175: Hoare triple {53848#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {53848#false} is VALID [2018-11-23 12:01:02,210 INFO L256 TraceCheckUtils]: 176: Hoare triple {53848#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {53848#false} is VALID [2018-11-23 12:01:02,210 INFO L273 TraceCheckUtils]: 177: Hoare triple {53848#false} ~cond := #in~cond; {53848#false} is VALID [2018-11-23 12:01:02,210 INFO L273 TraceCheckUtils]: 178: Hoare triple {53848#false} assume 0 == ~cond; {53848#false} is VALID [2018-11-23 12:01:02,210 INFO L273 TraceCheckUtils]: 179: Hoare triple {53848#false} assume !false; {53848#false} is VALID [2018-11-23 12:01:02,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:02,230 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:01:02,230 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-23 12:01:02,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:02,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:01:02,380 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:01:02,850 INFO L256 TraceCheckUtils]: 0: Hoare triple {53847#true} call ULTIMATE.init(); {53847#true} is VALID [2018-11-23 12:01:02,851 INFO L273 TraceCheckUtils]: 1: Hoare triple {53847#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {53847#true} is VALID [2018-11-23 12:01:02,851 INFO L273 TraceCheckUtils]: 2: Hoare triple {53847#true} assume true; {53847#true} is VALID [2018-11-23 12:01:02,851 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {53847#true} {53847#true} #88#return; {53847#true} is VALID [2018-11-23 12:01:02,851 INFO L256 TraceCheckUtils]: 4: Hoare triple {53847#true} call #t~ret13 := main(); {53847#true} is VALID [2018-11-23 12:01:02,852 INFO L273 TraceCheckUtils]: 5: Hoare triple {53847#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~int(~#array~0.base, ~#array~0.offset, 4);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~int(~#array~0.base, 4 + ~#array~0.offset, 4);~largest2~0 := #t~mem1;havoc #t~mem1; {53847#true} is VALID [2018-11-23 12:01:02,852 INFO L273 TraceCheckUtils]: 6: Hoare triple {53847#true} assume ~largest1~0 < ~largest2~0;~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {53847#true} is VALID [2018-11-23 12:01:02,852 INFO L273 TraceCheckUtils]: 7: Hoare triple {53847#true} ~i~0 := 2; {53849#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:02,853 INFO L273 TraceCheckUtils]: 8: Hoare triple {53849#(<= main_~i~0 2)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53849#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:02,853 INFO L273 TraceCheckUtils]: 9: Hoare triple {53849#(<= main_~i~0 2)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53849#(<= main_~i~0 2)} is VALID [2018-11-23 12:01:02,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {53849#(<= main_~i~0 2)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53850#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:02,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {53850#(<= main_~i~0 3)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53850#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:02,854 INFO L273 TraceCheckUtils]: 12: Hoare triple {53850#(<= main_~i~0 3)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53850#(<= main_~i~0 3)} is VALID [2018-11-23 12:01:02,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {53850#(<= main_~i~0 3)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53851#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:02,855 INFO L273 TraceCheckUtils]: 14: Hoare triple {53851#(<= main_~i~0 4)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53851#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:02,855 INFO L273 TraceCheckUtils]: 15: Hoare triple {53851#(<= main_~i~0 4)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53851#(<= main_~i~0 4)} is VALID [2018-11-23 12:01:02,856 INFO L273 TraceCheckUtils]: 16: Hoare triple {53851#(<= main_~i~0 4)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53852#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:02,856 INFO L273 TraceCheckUtils]: 17: Hoare triple {53852#(<= main_~i~0 5)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53852#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:02,856 INFO L273 TraceCheckUtils]: 18: Hoare triple {53852#(<= main_~i~0 5)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53852#(<= main_~i~0 5)} is VALID [2018-11-23 12:01:02,857 INFO L273 TraceCheckUtils]: 19: Hoare triple {53852#(<= main_~i~0 5)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53853#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:02,858 INFO L273 TraceCheckUtils]: 20: Hoare triple {53853#(<= main_~i~0 6)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53853#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:02,858 INFO L273 TraceCheckUtils]: 21: Hoare triple {53853#(<= main_~i~0 6)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53853#(<= main_~i~0 6)} is VALID [2018-11-23 12:01:02,859 INFO L273 TraceCheckUtils]: 22: Hoare triple {53853#(<= main_~i~0 6)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53854#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:02,859 INFO L273 TraceCheckUtils]: 23: Hoare triple {53854#(<= main_~i~0 7)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53854#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:02,860 INFO L273 TraceCheckUtils]: 24: Hoare triple {53854#(<= main_~i~0 7)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53854#(<= main_~i~0 7)} is VALID [2018-11-23 12:01:02,861 INFO L273 TraceCheckUtils]: 25: Hoare triple {53854#(<= main_~i~0 7)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53855#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:02,861 INFO L273 TraceCheckUtils]: 26: Hoare triple {53855#(<= main_~i~0 8)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53855#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:02,862 INFO L273 TraceCheckUtils]: 27: Hoare triple {53855#(<= main_~i~0 8)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53855#(<= main_~i~0 8)} is VALID [2018-11-23 12:01:02,862 INFO L273 TraceCheckUtils]: 28: Hoare triple {53855#(<= main_~i~0 8)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53856#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:02,863 INFO L273 TraceCheckUtils]: 29: Hoare triple {53856#(<= main_~i~0 9)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53856#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:02,863 INFO L273 TraceCheckUtils]: 30: Hoare triple {53856#(<= main_~i~0 9)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53856#(<= main_~i~0 9)} is VALID [2018-11-23 12:01:02,864 INFO L273 TraceCheckUtils]: 31: Hoare triple {53856#(<= main_~i~0 9)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53857#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:02,865 INFO L273 TraceCheckUtils]: 32: Hoare triple {53857#(<= main_~i~0 10)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53857#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:02,865 INFO L273 TraceCheckUtils]: 33: Hoare triple {53857#(<= main_~i~0 10)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53857#(<= main_~i~0 10)} is VALID [2018-11-23 12:01:02,866 INFO L273 TraceCheckUtils]: 34: Hoare triple {53857#(<= main_~i~0 10)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53858#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:02,866 INFO L273 TraceCheckUtils]: 35: Hoare triple {53858#(<= main_~i~0 11)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53858#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:02,867 INFO L273 TraceCheckUtils]: 36: Hoare triple {53858#(<= main_~i~0 11)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53858#(<= main_~i~0 11)} is VALID [2018-11-23 12:01:02,867 INFO L273 TraceCheckUtils]: 37: Hoare triple {53858#(<= main_~i~0 11)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53859#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:02,868 INFO L273 TraceCheckUtils]: 38: Hoare triple {53859#(<= main_~i~0 12)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53859#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:02,868 INFO L273 TraceCheckUtils]: 39: Hoare triple {53859#(<= main_~i~0 12)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53859#(<= main_~i~0 12)} is VALID [2018-11-23 12:01:02,869 INFO L273 TraceCheckUtils]: 40: Hoare triple {53859#(<= main_~i~0 12)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53860#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:02,870 INFO L273 TraceCheckUtils]: 41: Hoare triple {53860#(<= main_~i~0 13)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53860#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:02,870 INFO L273 TraceCheckUtils]: 42: Hoare triple {53860#(<= main_~i~0 13)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53860#(<= main_~i~0 13)} is VALID [2018-11-23 12:01:02,871 INFO L273 TraceCheckUtils]: 43: Hoare triple {53860#(<= main_~i~0 13)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53861#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:02,871 INFO L273 TraceCheckUtils]: 44: Hoare triple {53861#(<= main_~i~0 14)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53861#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:02,872 INFO L273 TraceCheckUtils]: 45: Hoare triple {53861#(<= main_~i~0 14)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53861#(<= main_~i~0 14)} is VALID [2018-11-23 12:01:02,873 INFO L273 TraceCheckUtils]: 46: Hoare triple {53861#(<= main_~i~0 14)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53862#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:02,873 INFO L273 TraceCheckUtils]: 47: Hoare triple {53862#(<= main_~i~0 15)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53862#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:02,874 INFO L273 TraceCheckUtils]: 48: Hoare triple {53862#(<= main_~i~0 15)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53862#(<= main_~i~0 15)} is VALID [2018-11-23 12:01:02,874 INFO L273 TraceCheckUtils]: 49: Hoare triple {53862#(<= main_~i~0 15)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53863#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:02,875 INFO L273 TraceCheckUtils]: 50: Hoare triple {53863#(<= main_~i~0 16)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53863#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:02,875 INFO L273 TraceCheckUtils]: 51: Hoare triple {53863#(<= main_~i~0 16)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53863#(<= main_~i~0 16)} is VALID [2018-11-23 12:01:02,876 INFO L273 TraceCheckUtils]: 52: Hoare triple {53863#(<= main_~i~0 16)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53864#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:02,877 INFO L273 TraceCheckUtils]: 53: Hoare triple {53864#(<= main_~i~0 17)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53864#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:02,877 INFO L273 TraceCheckUtils]: 54: Hoare triple {53864#(<= main_~i~0 17)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53864#(<= main_~i~0 17)} is VALID [2018-11-23 12:01:02,878 INFO L273 TraceCheckUtils]: 55: Hoare triple {53864#(<= main_~i~0 17)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53865#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:02,878 INFO L273 TraceCheckUtils]: 56: Hoare triple {53865#(<= main_~i~0 18)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53865#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:02,879 INFO L273 TraceCheckUtils]: 57: Hoare triple {53865#(<= main_~i~0 18)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53865#(<= main_~i~0 18)} is VALID [2018-11-23 12:01:02,879 INFO L273 TraceCheckUtils]: 58: Hoare triple {53865#(<= main_~i~0 18)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53866#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:02,880 INFO L273 TraceCheckUtils]: 59: Hoare triple {53866#(<= main_~i~0 19)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53866#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:02,880 INFO L273 TraceCheckUtils]: 60: Hoare triple {53866#(<= main_~i~0 19)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53866#(<= main_~i~0 19)} is VALID [2018-11-23 12:01:02,881 INFO L273 TraceCheckUtils]: 61: Hoare triple {53866#(<= main_~i~0 19)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53867#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:02,882 INFO L273 TraceCheckUtils]: 62: Hoare triple {53867#(<= main_~i~0 20)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53867#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:02,882 INFO L273 TraceCheckUtils]: 63: Hoare triple {53867#(<= main_~i~0 20)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53867#(<= main_~i~0 20)} is VALID [2018-11-23 12:01:02,883 INFO L273 TraceCheckUtils]: 64: Hoare triple {53867#(<= main_~i~0 20)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53868#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:02,883 INFO L273 TraceCheckUtils]: 65: Hoare triple {53868#(<= main_~i~0 21)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53868#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:02,884 INFO L273 TraceCheckUtils]: 66: Hoare triple {53868#(<= main_~i~0 21)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53868#(<= main_~i~0 21)} is VALID [2018-11-23 12:01:02,885 INFO L273 TraceCheckUtils]: 67: Hoare triple {53868#(<= main_~i~0 21)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53869#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:02,885 INFO L273 TraceCheckUtils]: 68: Hoare triple {53869#(<= main_~i~0 22)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53869#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:02,886 INFO L273 TraceCheckUtils]: 69: Hoare triple {53869#(<= main_~i~0 22)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53869#(<= main_~i~0 22)} is VALID [2018-11-23 12:01:02,886 INFO L273 TraceCheckUtils]: 70: Hoare triple {53869#(<= main_~i~0 22)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53870#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:02,887 INFO L273 TraceCheckUtils]: 71: Hoare triple {53870#(<= main_~i~0 23)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53870#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:02,887 INFO L273 TraceCheckUtils]: 72: Hoare triple {53870#(<= main_~i~0 23)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53870#(<= main_~i~0 23)} is VALID [2018-11-23 12:01:02,888 INFO L273 TraceCheckUtils]: 73: Hoare triple {53870#(<= main_~i~0 23)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53871#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:02,889 INFO L273 TraceCheckUtils]: 74: Hoare triple {53871#(<= main_~i~0 24)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53871#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:02,889 INFO L273 TraceCheckUtils]: 75: Hoare triple {53871#(<= main_~i~0 24)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53871#(<= main_~i~0 24)} is VALID [2018-11-23 12:01:02,890 INFO L273 TraceCheckUtils]: 76: Hoare triple {53871#(<= main_~i~0 24)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53872#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:02,890 INFO L273 TraceCheckUtils]: 77: Hoare triple {53872#(<= main_~i~0 25)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53872#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:02,891 INFO L273 TraceCheckUtils]: 78: Hoare triple {53872#(<= main_~i~0 25)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53872#(<= main_~i~0 25)} is VALID [2018-11-23 12:01:02,891 INFO L273 TraceCheckUtils]: 79: Hoare triple {53872#(<= main_~i~0 25)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53873#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:02,892 INFO L273 TraceCheckUtils]: 80: Hoare triple {53873#(<= main_~i~0 26)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53873#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:02,892 INFO L273 TraceCheckUtils]: 81: Hoare triple {53873#(<= main_~i~0 26)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53873#(<= main_~i~0 26)} is VALID [2018-11-23 12:01:02,893 INFO L273 TraceCheckUtils]: 82: Hoare triple {53873#(<= main_~i~0 26)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53874#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:02,894 INFO L273 TraceCheckUtils]: 83: Hoare triple {53874#(<= main_~i~0 27)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53874#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:02,894 INFO L273 TraceCheckUtils]: 84: Hoare triple {53874#(<= main_~i~0 27)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53874#(<= main_~i~0 27)} is VALID [2018-11-23 12:01:02,895 INFO L273 TraceCheckUtils]: 85: Hoare triple {53874#(<= main_~i~0 27)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53875#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:02,895 INFO L273 TraceCheckUtils]: 86: Hoare triple {53875#(<= main_~i~0 28)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53875#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:02,896 INFO L273 TraceCheckUtils]: 87: Hoare triple {53875#(<= main_~i~0 28)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53875#(<= main_~i~0 28)} is VALID [2018-11-23 12:01:02,897 INFO L273 TraceCheckUtils]: 88: Hoare triple {53875#(<= main_~i~0 28)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53876#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:02,897 INFO L273 TraceCheckUtils]: 89: Hoare triple {53876#(<= main_~i~0 29)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53876#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:02,898 INFO L273 TraceCheckUtils]: 90: Hoare triple {53876#(<= main_~i~0 29)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53876#(<= main_~i~0 29)} is VALID [2018-11-23 12:01:02,898 INFO L273 TraceCheckUtils]: 91: Hoare triple {53876#(<= main_~i~0 29)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53877#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:02,899 INFO L273 TraceCheckUtils]: 92: Hoare triple {53877#(<= main_~i~0 30)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53877#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:02,899 INFO L273 TraceCheckUtils]: 93: Hoare triple {53877#(<= main_~i~0 30)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53877#(<= main_~i~0 30)} is VALID [2018-11-23 12:01:02,900 INFO L273 TraceCheckUtils]: 94: Hoare triple {53877#(<= main_~i~0 30)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53878#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:02,900 INFO L273 TraceCheckUtils]: 95: Hoare triple {53878#(<= main_~i~0 31)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53878#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:02,901 INFO L273 TraceCheckUtils]: 96: Hoare triple {53878#(<= main_~i~0 31)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53878#(<= main_~i~0 31)} is VALID [2018-11-23 12:01:02,902 INFO L273 TraceCheckUtils]: 97: Hoare triple {53878#(<= main_~i~0 31)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53879#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:02,902 INFO L273 TraceCheckUtils]: 98: Hoare triple {53879#(<= main_~i~0 32)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53879#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:02,903 INFO L273 TraceCheckUtils]: 99: Hoare triple {53879#(<= main_~i~0 32)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53879#(<= main_~i~0 32)} is VALID [2018-11-23 12:01:02,903 INFO L273 TraceCheckUtils]: 100: Hoare triple {53879#(<= main_~i~0 32)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53880#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:02,904 INFO L273 TraceCheckUtils]: 101: Hoare triple {53880#(<= main_~i~0 33)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53880#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:02,904 INFO L273 TraceCheckUtils]: 102: Hoare triple {53880#(<= main_~i~0 33)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53880#(<= main_~i~0 33)} is VALID [2018-11-23 12:01:02,905 INFO L273 TraceCheckUtils]: 103: Hoare triple {53880#(<= main_~i~0 33)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53881#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:02,906 INFO L273 TraceCheckUtils]: 104: Hoare triple {53881#(<= main_~i~0 34)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53881#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:02,906 INFO L273 TraceCheckUtils]: 105: Hoare triple {53881#(<= main_~i~0 34)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53881#(<= main_~i~0 34)} is VALID [2018-11-23 12:01:02,907 INFO L273 TraceCheckUtils]: 106: Hoare triple {53881#(<= main_~i~0 34)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53882#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:02,907 INFO L273 TraceCheckUtils]: 107: Hoare triple {53882#(<= main_~i~0 35)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53882#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:02,908 INFO L273 TraceCheckUtils]: 108: Hoare triple {53882#(<= main_~i~0 35)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53882#(<= main_~i~0 35)} is VALID [2018-11-23 12:01:02,908 INFO L273 TraceCheckUtils]: 109: Hoare triple {53882#(<= main_~i~0 35)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53883#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:02,909 INFO L273 TraceCheckUtils]: 110: Hoare triple {53883#(<= main_~i~0 36)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53883#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:02,909 INFO L273 TraceCheckUtils]: 111: Hoare triple {53883#(<= main_~i~0 36)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53883#(<= main_~i~0 36)} is VALID [2018-11-23 12:01:02,910 INFO L273 TraceCheckUtils]: 112: Hoare triple {53883#(<= main_~i~0 36)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53884#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:02,911 INFO L273 TraceCheckUtils]: 113: Hoare triple {53884#(<= main_~i~0 37)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53884#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:02,911 INFO L273 TraceCheckUtils]: 114: Hoare triple {53884#(<= main_~i~0 37)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53884#(<= main_~i~0 37)} is VALID [2018-11-23 12:01:02,912 INFO L273 TraceCheckUtils]: 115: Hoare triple {53884#(<= main_~i~0 37)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53885#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:02,912 INFO L273 TraceCheckUtils]: 116: Hoare triple {53885#(<= main_~i~0 38)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53885#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:02,913 INFO L273 TraceCheckUtils]: 117: Hoare triple {53885#(<= main_~i~0 38)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53885#(<= main_~i~0 38)} is VALID [2018-11-23 12:01:02,914 INFO L273 TraceCheckUtils]: 118: Hoare triple {53885#(<= main_~i~0 38)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53886#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:02,914 INFO L273 TraceCheckUtils]: 119: Hoare triple {53886#(<= main_~i~0 39)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53886#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:02,915 INFO L273 TraceCheckUtils]: 120: Hoare triple {53886#(<= main_~i~0 39)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53886#(<= main_~i~0 39)} is VALID [2018-11-23 12:01:02,915 INFO L273 TraceCheckUtils]: 121: Hoare triple {53886#(<= main_~i~0 39)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53887#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:02,916 INFO L273 TraceCheckUtils]: 122: Hoare triple {53887#(<= main_~i~0 40)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53887#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:02,916 INFO L273 TraceCheckUtils]: 123: Hoare triple {53887#(<= main_~i~0 40)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53887#(<= main_~i~0 40)} is VALID [2018-11-23 12:01:02,917 INFO L273 TraceCheckUtils]: 124: Hoare triple {53887#(<= main_~i~0 40)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53888#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:02,918 INFO L273 TraceCheckUtils]: 125: Hoare triple {53888#(<= main_~i~0 41)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53888#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:02,918 INFO L273 TraceCheckUtils]: 126: Hoare triple {53888#(<= main_~i~0 41)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53888#(<= main_~i~0 41)} is VALID [2018-11-23 12:01:02,919 INFO L273 TraceCheckUtils]: 127: Hoare triple {53888#(<= main_~i~0 41)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53889#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:02,919 INFO L273 TraceCheckUtils]: 128: Hoare triple {53889#(<= main_~i~0 42)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53889#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:02,920 INFO L273 TraceCheckUtils]: 129: Hoare triple {53889#(<= main_~i~0 42)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53889#(<= main_~i~0 42)} is VALID [2018-11-23 12:01:02,920 INFO L273 TraceCheckUtils]: 130: Hoare triple {53889#(<= main_~i~0 42)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53890#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:02,921 INFO L273 TraceCheckUtils]: 131: Hoare triple {53890#(<= main_~i~0 43)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53890#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:02,921 INFO L273 TraceCheckUtils]: 132: Hoare triple {53890#(<= main_~i~0 43)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53890#(<= main_~i~0 43)} is VALID [2018-11-23 12:01:02,922 INFO L273 TraceCheckUtils]: 133: Hoare triple {53890#(<= main_~i~0 43)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53891#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:02,923 INFO L273 TraceCheckUtils]: 134: Hoare triple {53891#(<= main_~i~0 44)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53891#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:02,923 INFO L273 TraceCheckUtils]: 135: Hoare triple {53891#(<= main_~i~0 44)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53891#(<= main_~i~0 44)} is VALID [2018-11-23 12:01:02,924 INFO L273 TraceCheckUtils]: 136: Hoare triple {53891#(<= main_~i~0 44)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53892#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:02,924 INFO L273 TraceCheckUtils]: 137: Hoare triple {53892#(<= main_~i~0 45)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53892#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:02,925 INFO L273 TraceCheckUtils]: 138: Hoare triple {53892#(<= main_~i~0 45)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53892#(<= main_~i~0 45)} is VALID [2018-11-23 12:01:02,926 INFO L273 TraceCheckUtils]: 139: Hoare triple {53892#(<= main_~i~0 45)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53893#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:02,926 INFO L273 TraceCheckUtils]: 140: Hoare triple {53893#(<= main_~i~0 46)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53893#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:02,927 INFO L273 TraceCheckUtils]: 141: Hoare triple {53893#(<= main_~i~0 46)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53893#(<= main_~i~0 46)} is VALID [2018-11-23 12:01:02,927 INFO L273 TraceCheckUtils]: 142: Hoare triple {53893#(<= main_~i~0 46)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53894#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:02,928 INFO L273 TraceCheckUtils]: 143: Hoare triple {53894#(<= main_~i~0 47)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53894#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:02,928 INFO L273 TraceCheckUtils]: 144: Hoare triple {53894#(<= main_~i~0 47)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53894#(<= main_~i~0 47)} is VALID [2018-11-23 12:01:02,929 INFO L273 TraceCheckUtils]: 145: Hoare triple {53894#(<= main_~i~0 47)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53895#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:02,930 INFO L273 TraceCheckUtils]: 146: Hoare triple {53895#(<= main_~i~0 48)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53895#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:02,930 INFO L273 TraceCheckUtils]: 147: Hoare triple {53895#(<= main_~i~0 48)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53895#(<= main_~i~0 48)} is VALID [2018-11-23 12:01:02,931 INFO L273 TraceCheckUtils]: 148: Hoare triple {53895#(<= main_~i~0 48)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53896#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:02,931 INFO L273 TraceCheckUtils]: 149: Hoare triple {53896#(<= main_~i~0 49)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53896#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:02,932 INFO L273 TraceCheckUtils]: 150: Hoare triple {53896#(<= main_~i~0 49)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53896#(<= main_~i~0 49)} is VALID [2018-11-23 12:01:02,932 INFO L273 TraceCheckUtils]: 151: Hoare triple {53896#(<= main_~i~0 49)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53897#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:02,933 INFO L273 TraceCheckUtils]: 152: Hoare triple {53897#(<= main_~i~0 50)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53897#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:02,933 INFO L273 TraceCheckUtils]: 153: Hoare triple {53897#(<= main_~i~0 50)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53897#(<= main_~i~0 50)} is VALID [2018-11-23 12:01:02,934 INFO L273 TraceCheckUtils]: 154: Hoare triple {53897#(<= main_~i~0 50)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53898#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:02,935 INFO L273 TraceCheckUtils]: 155: Hoare triple {53898#(<= main_~i~0 51)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53898#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:02,935 INFO L273 TraceCheckUtils]: 156: Hoare triple {53898#(<= main_~i~0 51)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53898#(<= main_~i~0 51)} is VALID [2018-11-23 12:01:02,936 INFO L273 TraceCheckUtils]: 157: Hoare triple {53898#(<= main_~i~0 51)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53899#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:02,936 INFO L273 TraceCheckUtils]: 158: Hoare triple {53899#(<= main_~i~0 52)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53899#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:02,937 INFO L273 TraceCheckUtils]: 159: Hoare triple {53899#(<= main_~i~0 52)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53899#(<= main_~i~0 52)} is VALID [2018-11-23 12:01:02,938 INFO L273 TraceCheckUtils]: 160: Hoare triple {53899#(<= main_~i~0 52)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53900#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:02,938 INFO L273 TraceCheckUtils]: 161: Hoare triple {53900#(<= main_~i~0 53)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53900#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:02,939 INFO L273 TraceCheckUtils]: 162: Hoare triple {53900#(<= main_~i~0 53)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53900#(<= main_~i~0 53)} is VALID [2018-11-23 12:01:02,939 INFO L273 TraceCheckUtils]: 163: Hoare triple {53900#(<= main_~i~0 53)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53901#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:02,940 INFO L273 TraceCheckUtils]: 164: Hoare triple {53901#(<= main_~i~0 54)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53901#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:02,940 INFO L273 TraceCheckUtils]: 165: Hoare triple {53901#(<= main_~i~0 54)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53901#(<= main_~i~0 54)} is VALID [2018-11-23 12:01:02,941 INFO L273 TraceCheckUtils]: 166: Hoare triple {53901#(<= main_~i~0 54)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53902#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:02,941 INFO L273 TraceCheckUtils]: 167: Hoare triple {53902#(<= main_~i~0 55)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53902#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:02,942 INFO L273 TraceCheckUtils]: 168: Hoare triple {53902#(<= main_~i~0 55)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53902#(<= main_~i~0 55)} is VALID [2018-11-23 12:01:02,943 INFO L273 TraceCheckUtils]: 169: Hoare triple {53902#(<= main_~i~0 55)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53903#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:02,943 INFO L273 TraceCheckUtils]: 170: Hoare triple {53903#(<= main_~i~0 56)} assume !!(~i~0 < 100000);call #t~mem3 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4); {53903#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:02,944 INFO L273 TraceCheckUtils]: 171: Hoare triple {53903#(<= main_~i~0 56)} assume #t~mem3 >= ~largest1~0;havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~i~0, 4);~largest1~0 := #t~mem4;havoc #t~mem4; {53903#(<= main_~i~0 56)} is VALID [2018-11-23 12:01:02,944 INFO L273 TraceCheckUtils]: 172: Hoare triple {53903#(<= main_~i~0 56)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {53904#(<= main_~i~0 57)} is VALID [2018-11-23 12:01:02,945 INFO L273 TraceCheckUtils]: 173: Hoare triple {53904#(<= main_~i~0 57)} assume !(~i~0 < 100000); {53848#false} is VALID [2018-11-23 12:01:02,945 INFO L273 TraceCheckUtils]: 174: Hoare triple {53848#false} havoc ~x~0;~x~0 := 0; {53848#false} is VALID [2018-11-23 12:01:02,945 INFO L273 TraceCheckUtils]: 175: Hoare triple {53848#false} assume !!(~x~0 < 100000);call #t~mem8 := read~int(~#array~0.base, ~#array~0.offset + 4 * ~x~0, 4); {53848#false} is VALID [2018-11-23 12:01:02,946 INFO L256 TraceCheckUtils]: 176: Hoare triple {53848#false} call __VERIFIER_assert((if #t~mem8 <= ~largest1~0 then 1 else 0)); {53848#false} is VALID [2018-11-23 12:01:02,946 INFO L273 TraceCheckUtils]: 177: Hoare triple {53848#false} ~cond := #in~cond; {53848#false} is VALID [2018-11-23 12:01:02,946 INFO L273 TraceCheckUtils]: 178: Hoare triple {53848#false} assume 0 == ~cond; {53848#false} is VALID [2018-11-23 12:01:02,946 INFO L273 TraceCheckUtils]: 179: Hoare triple {53848#false} assume !false; {53848#false} is VALID [2018-11-23 12:01:02,967 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:01:02,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:01:02,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 58] total 58 [2018-11-23 12:01:02,986 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 180 [2018-11-23 12:01:02,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:01:02,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states. [2018-11-23 12:01:03,162 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-23 12:01:03,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-11-23 12:01:03,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-11-23 12:01:03,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 12:01:03,164 INFO L87 Difference]: Start difference. First operand 246 states and 361 transitions. Second operand 58 states. [2018-11-23 12:01:04,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:04,636 INFO L93 Difference]: Finished difference Result 270 states and 393 transitions. [2018-11-23 12:01:04,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-11-23 12:01:04,636 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 180 [2018-11-23 12:01:04,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:01:04,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:01:04,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 393 transitions. [2018-11-23 12:01:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-11-23 12:01:04,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 393 transitions. [2018-11-23 12:01:04,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 58 states and 393 transitions. [2018-11-23 12:01:05,015 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 393 edges. 393 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:01:05,020 INFO L225 Difference]: With dead ends: 270 [2018-11-23 12:01:05,020 INFO L226 Difference]: Without dead ends: 253 [2018-11-23 12:01:05,021 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-11-23 12:01:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-11-23 12:01:05,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 250. [2018-11-23 12:01:05,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:01:05,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand 250 states. [2018-11-23 12:01:05,553 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand 250 states. [2018-11-23 12:01:05,553 INFO L87 Difference]: Start difference. First operand 253 states. Second operand 250 states. [2018-11-23 12:01:05,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:05,558 INFO L93 Difference]: Finished difference Result 253 states and 372 transitions. [2018-11-23 12:01:05,558 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 372 transitions. [2018-11-23 12:01:05,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:05,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:05,558 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand 253 states. [2018-11-23 12:01:05,559 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 253 states. [2018-11-23 12:01:05,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:01:05,562 INFO L93 Difference]: Finished difference Result 253 states and 372 transitions. [2018-11-23 12:01:05,563 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 372 transitions. [2018-11-23 12:01:05,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:01:05,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:01:05,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:01:05,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:01:05,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-23 12:01:05,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 367 transitions. [2018-11-23 12:01:05,567 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 367 transitions. Word has length 180 [2018-11-23 12:01:05,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:01:05,567 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 367 transitions. [2018-11-23 12:01:05,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-11-23 12:01:05,568 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 367 transitions. [2018-11-23 12:01:05,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-11-23 12:01:05,568 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:01:05,568 INFO L402 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:01:05,569 INFO L423 AbstractCegarLoop]: === Iteration 58 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:01:05,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:01:05,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1997669668, now seen corresponding path program 56 times [2018-11-23 12:01:05,569 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:01:05,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:01:05,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:05,569 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:01:05,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:01:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat