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_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/sanfoundry_02_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:01:52,256 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:01:52,259 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:01:52,273 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:01:52,274 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:01:52,275 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:01:52,276 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:01:52,278 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:01:52,280 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:01:52,281 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:01:52,282 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:01:52,282 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:01:52,283 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:01:52,284 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:01:52,285 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:01:52,286 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:01:52,287 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:01:52,289 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:01:52,291 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:01:52,292 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:01:52,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:01:52,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:01:52,298 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:01:52,298 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:01:52,298 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:01:52,299 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:01:52,300 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:01:52,301 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:01:52,302 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:01:52,303 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:01:52,303 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:01:52,304 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:01:52,304 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:01:52,305 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:01:52,306 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:01:52,308 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:01:52,308 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 10:01:52,326 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:01:52,327 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:01:52,328 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:01:52,328 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:01:52,329 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:01:52,329 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:01:52,329 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:01:52,329 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:01:52,329 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:01:52,330 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:01:52,330 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:01:52,330 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:01:52,330 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:01:52,330 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:01:52,330 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:01:52,331 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:01:52,331 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:01:52,331 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:01:52,331 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:01:52,331 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:01:52,332 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:01:52,332 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:01:52,332 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:01:52,332 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:01:52,332 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:01:52,333 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:01:52,333 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:01:52,333 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:01:52,333 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:01:52,333 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:01:52,334 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:01:52,334 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:01:52,334 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:01:52,406 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:01:52,422 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:01:52,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:01:52,428 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:01:52,428 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:01:52,429 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 10:01:52,505 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59203a5f7/4c95ea88875641e7990239fb60cc7f56/FLAG4f3447973 [2018-11-23 10:01:53,046 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:01:53,047 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sanfoundry_02_true-unreach-call_ground.i [2018-11-23 10:01:53,053 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59203a5f7/4c95ea88875641e7990239fb60cc7f56/FLAG4f3447973 [2018-11-23 10:01:53,388 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59203a5f7/4c95ea88875641e7990239fb60cc7f56 [2018-11-23 10:01:53,399 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:01:53,401 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:01:53,402 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:01:53,402 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:01:53,406 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:01:53,408 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:01:53" (1/1) ... [2018-11-23 10:01:53,411 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f2658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:01:53, skipping insertion in model container [2018-11-23 10:01:53,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:01:53" (1/1) ... [2018-11-23 10:01:53,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:01:53,443 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:01:53,679 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:01:53,687 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:01:53,735 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:01:53,769 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:01:53,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:01:53 WrapperNode [2018-11-23 10:01:53,770 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:01:53,771 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:01:53,771 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:01:53,771 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:01:53,782 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:01:53" (1/1) ... [2018-11-23 10:01:53,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:01:53" (1/1) ... [2018-11-23 10:01:53,803 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:01:53,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:01:53,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:01:53,804 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:01:53,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:01:53" (1/1) ... [2018-11-23 10:01:53,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:01:53" (1/1) ... [2018-11-23 10:01:53,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:01:53" (1/1) ... [2018-11-23 10:01:53,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:01:53" (1/1) ... [2018-11-23 10:01:53,835 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:01:53" (1/1) ... [2018-11-23 10:01:53,843 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:01:53" (1/1) ... [2018-11-23 10:01:53,845 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:01:53" (1/1) ... [2018-11-23 10:01:53,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:01:53,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:01:53,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:01:53,849 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:01:53,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:01:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:01:53,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:01:53,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:01:53,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:01:53,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:01:53,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:01:53,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:01:53,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:01:53,997 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:01:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:01:53,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:01:53,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:01:54,750 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:01:54,750 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-11-23 10:01:54,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:01:54 BoogieIcfgContainer [2018-11-23 10:01:54,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:01:54,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:01:54,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:01:54,755 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:01:54,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:01:53" (1/3) ... [2018-11-23 10:01:54,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c51756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:01:54, skipping insertion in model container [2018-11-23 10:01:54,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:01:53" (2/3) ... [2018-11-23 10:01:54,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55c51756 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:01:54, skipping insertion in model container [2018-11-23 10:01:54,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:01:54" (3/3) ... [2018-11-23 10:01:54,760 INFO L112 eAbstractionObserver]: Analyzing ICFG sanfoundry_02_true-unreach-call_ground.i [2018-11-23 10:01:54,771 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:01:54,779 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:01:54,797 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:01:54,830 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:01:54,830 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:01:54,831 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:01:54,831 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:01:54,831 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:01:54,831 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:01:54,832 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:01:54,832 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:01:54,832 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:01:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2018-11-23 10:01:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:01:54,859 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:01:54,860 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:01:54,862 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:01:54,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:01:54,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1324526188, now seen corresponding path program 1 times [2018-11-23 10:01:54,872 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:01:54,873 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:01:54,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:01:54,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:01:54,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:01:54,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:01:55,248 INFO L256 TraceCheckUtils]: 0: Hoare triple {37#true} call ULTIMATE.init(); {37#true} is VALID [2018-11-23 10:01:55,252 INFO L273 TraceCheckUtils]: 1: Hoare triple {37#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {37#true} is VALID [2018-11-23 10:01:55,253 INFO L273 TraceCheckUtils]: 2: Hoare triple {37#true} assume true; {37#true} is VALID [2018-11-23 10:01:55,253 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} #88#return; {37#true} is VALID [2018-11-23 10:01:55,253 INFO L256 TraceCheckUtils]: 4: Hoare triple {37#true} call #t~ret13 := main(); {37#true} is VALID [2018-11-23 10:01:55,253 INFO L273 TraceCheckUtils]: 5: Hoare triple {37#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~#array~0.offset), 4bv32);~largest2~0 := #t~mem1;havoc #t~mem1; {37#true} is VALID [2018-11-23 10:01:55,254 INFO L273 TraceCheckUtils]: 6: Hoare triple {37#true} assume ~bvslt32(~largest1~0, ~largest2~0);~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {37#true} is VALID [2018-11-23 10:01:55,254 INFO L273 TraceCheckUtils]: 7: Hoare triple {37#true} ~i~0 := 2bv32; {37#true} is VALID [2018-11-23 10:01:55,256 INFO L273 TraceCheckUtils]: 8: Hoare triple {37#true} assume !true; {38#false} is VALID [2018-11-23 10:01:55,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {38#false} havoc ~x~0;~x~0 := 0bv32; {38#false} is VALID [2018-11-23 10:01:55,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {38#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {38#false} is VALID [2018-11-23 10:01:55,257 INFO L256 TraceCheckUtils]: 11: Hoare triple {38#false} call __VERIFIER_assert((if ~bvsle32(#t~mem8, ~largest1~0) then 1bv32 else 0bv32)); {38#false} is VALID [2018-11-23 10:01:55,257 INFO L273 TraceCheckUtils]: 12: Hoare triple {38#false} ~cond := #in~cond; {38#false} is VALID [2018-11-23 10:01:55,258 INFO L273 TraceCheckUtils]: 13: Hoare triple {38#false} assume 0bv32 == ~cond; {38#false} is VALID [2018-11-23 10:01:55,258 INFO L273 TraceCheckUtils]: 14: Hoare triple {38#false} assume !false; {38#false} is VALID [2018-11-23 10:01:55,262 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 10:01:55,262 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:01:55,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:01:55,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:01:55,277 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:01:55,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:01:55,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:01:55,440 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 10:01:55,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:01:55,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:01:55,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:01:55,454 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 2 states. [2018-11-23 10:01:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:55,595 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2018-11-23 10:01:55,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:01:55,596 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2018-11-23 10:01:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:01:55,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:01:55,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 10:01:55,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:01:55,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2018-11-23 10:01:55,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2018-11-23 10:01:55,913 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 10:01:55,925 INFO L225 Difference]: With dead ends: 56 [2018-11-23 10:01:55,925 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 10:01:55,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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 10:01:55,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 10:01:56,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-11-23 10:01:56,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:01:56,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 29 states. [2018-11-23 10:01:56,027 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 10:01:56,027 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 10:01:56,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:56,033 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-23 10:01:56,033 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 10:01:56,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:01:56,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:01:56,035 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 29 states. [2018-11-23 10:01:56,035 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 29 states. [2018-11-23 10:01:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:56,040 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2018-11-23 10:01:56,041 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 10:01:56,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:01:56,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:01:56,042 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:01:56,042 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:01:56,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 10:01:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2018-11-23 10:01:56,048 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 15 [2018-11-23 10:01:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:01:56,049 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2018-11-23 10:01:56,049 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:01:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2018-11-23 10:01:56,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-23 10:01:56,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:01:56,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:01:56,051 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:01:56,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:01:56,052 INFO L82 PathProgramCache]: Analyzing trace with hash 9369180, now seen corresponding path program 1 times [2018-11-23 10:01:56,052 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:01:56,053 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:01:56,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:01:56,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:01:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:01:56,130 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:01:56,282 INFO L256 TraceCheckUtils]: 0: Hoare triple {251#true} call ULTIMATE.init(); {251#true} is VALID [2018-11-23 10:01:56,283 INFO L273 TraceCheckUtils]: 1: Hoare triple {251#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {251#true} is VALID [2018-11-23 10:01:56,283 INFO L273 TraceCheckUtils]: 2: Hoare triple {251#true} assume true; {251#true} is VALID [2018-11-23 10:01:56,283 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {251#true} {251#true} #88#return; {251#true} is VALID [2018-11-23 10:01:56,285 INFO L256 TraceCheckUtils]: 4: Hoare triple {251#true} call #t~ret13 := main(); {251#true} is VALID [2018-11-23 10:01:56,285 INFO L273 TraceCheckUtils]: 5: Hoare triple {251#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~#array~0.offset), 4bv32);~largest2~0 := #t~mem1;havoc #t~mem1; {251#true} is VALID [2018-11-23 10:01:56,286 INFO L273 TraceCheckUtils]: 6: Hoare triple {251#true} assume ~bvslt32(~largest1~0, ~largest2~0);~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {251#true} is VALID [2018-11-23 10:01:56,302 INFO L273 TraceCheckUtils]: 7: Hoare triple {251#true} ~i~0 := 2bv32; {277#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:56,316 INFO L273 TraceCheckUtils]: 8: Hoare triple {277#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {252#false} is VALID [2018-11-23 10:01:56,316 INFO L273 TraceCheckUtils]: 9: Hoare triple {252#false} havoc ~x~0;~x~0 := 0bv32; {252#false} is VALID [2018-11-23 10:01:56,317 INFO L273 TraceCheckUtils]: 10: Hoare triple {252#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {252#false} is VALID [2018-11-23 10:01:56,317 INFO L256 TraceCheckUtils]: 11: Hoare triple {252#false} call __VERIFIER_assert((if ~bvsle32(#t~mem8, ~largest1~0) then 1bv32 else 0bv32)); {252#false} is VALID [2018-11-23 10:01:56,317 INFO L273 TraceCheckUtils]: 12: Hoare triple {252#false} ~cond := #in~cond; {252#false} is VALID [2018-11-23 10:01:56,319 INFO L273 TraceCheckUtils]: 13: Hoare triple {252#false} assume 0bv32 == ~cond; {252#false} is VALID [2018-11-23 10:01:56,319 INFO L273 TraceCheckUtils]: 14: Hoare triple {252#false} assume !false; {252#false} is VALID [2018-11-23 10:01:56,323 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 10:01:56,323 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:01:56,333 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:01:56,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:01:56,335 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:01:56,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:01:56,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:01:56,539 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 10:01:56,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:01:56,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:01:56,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:01:56,540 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 3 states. [2018-11-23 10:01:56,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:56,840 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2018-11-23 10:01:56,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:01:56,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-23 10:01:56,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:01:56,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:01:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 10:01:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:01:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2018-11-23 10:01:56,848 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2018-11-23 10:01:56,990 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 10:01:56,994 INFO L225 Difference]: With dead ends: 50 [2018-11-23 10:01:56,994 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 10:01:56,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 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 10:01:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 10:01:57,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-11-23 10:01:57,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:01:57,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 30 states. [2018-11-23 10:01:57,014 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 30 states. [2018-11-23 10:01:57,014 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 30 states. [2018-11-23 10:01:57,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:57,018 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2018-11-23 10:01:57,018 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2018-11-23 10:01:57,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:01:57,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:01:57,019 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 33 states. [2018-11-23 10:01:57,020 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 33 states. [2018-11-23 10:01:57,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:57,023 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2018-11-23 10:01:57,023 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2018-11-23 10:01:57,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:01:57,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:01:57,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:01:57,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:01:57,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 10:01:57,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-11-23 10:01:57,028 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 15 [2018-11-23 10:01:57,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:01:57,028 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-11-23 10:01:57,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:01:57,029 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-11-23 10:01:57,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 10:01:57,030 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:01:57,030 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 10:01:57,030 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:01:57,030 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:01:57,031 INFO L82 PathProgramCache]: Analyzing trace with hash 594149057, now seen corresponding path program 1 times [2018-11-23 10:01:57,031 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:01:57,031 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:01:57,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:01:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:01:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:01:57,097 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:01:57,155 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-23 10:01:57,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {471#true} is VALID [2018-11-23 10:01:57,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-23 10:01:57,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #88#return; {471#true} is VALID [2018-11-23 10:01:57,157 INFO L256 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret13 := main(); {471#true} is VALID [2018-11-23 10:01:57,157 INFO L273 TraceCheckUtils]: 5: Hoare triple {471#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~#array~0.offset), 4bv32);~largest2~0 := #t~mem1;havoc #t~mem1; {471#true} is VALID [2018-11-23 10:01:57,157 INFO L273 TraceCheckUtils]: 6: Hoare triple {471#true} assume ~bvslt32(~largest1~0, ~largest2~0);~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {471#true} is VALID [2018-11-23 10:01:57,158 INFO L273 TraceCheckUtils]: 7: Hoare triple {471#true} ~i~0 := 2bv32; {497#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:57,158 INFO L273 TraceCheckUtils]: 8: Hoare triple {497#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {497#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:57,159 INFO L273 TraceCheckUtils]: 9: Hoare triple {497#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {497#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:57,161 INFO L273 TraceCheckUtils]: 10: Hoare triple {497#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {507#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:57,162 INFO L273 TraceCheckUtils]: 11: Hoare triple {507#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {472#false} is VALID [2018-11-23 10:01:57,162 INFO L273 TraceCheckUtils]: 12: Hoare triple {472#false} havoc ~x~0;~x~0 := 0bv32; {472#false} is VALID [2018-11-23 10:01:57,163 INFO L273 TraceCheckUtils]: 13: Hoare triple {472#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {472#false} is VALID [2018-11-23 10:01:57,163 INFO L256 TraceCheckUtils]: 14: Hoare triple {472#false} call __VERIFIER_assert((if ~bvsle32(#t~mem8, ~largest1~0) then 1bv32 else 0bv32)); {472#false} is VALID [2018-11-23 10:01:57,163 INFO L273 TraceCheckUtils]: 15: Hoare triple {472#false} ~cond := #in~cond; {472#false} is VALID [2018-11-23 10:01:57,163 INFO L273 TraceCheckUtils]: 16: Hoare triple {472#false} assume 0bv32 == ~cond; {472#false} is VALID [2018-11-23 10:01:57,164 INFO L273 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-23 10:01:57,166 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 10:01:57,166 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:01:57,291 INFO L273 TraceCheckUtils]: 17: Hoare triple {472#false} assume !false; {472#false} is VALID [2018-11-23 10:01:57,292 INFO L273 TraceCheckUtils]: 16: Hoare triple {472#false} assume 0bv32 == ~cond; {472#false} is VALID [2018-11-23 10:01:57,292 INFO L273 TraceCheckUtils]: 15: Hoare triple {472#false} ~cond := #in~cond; {472#false} is VALID [2018-11-23 10:01:57,292 INFO L256 TraceCheckUtils]: 14: Hoare triple {472#false} call __VERIFIER_assert((if ~bvsle32(#t~mem8, ~largest1~0) then 1bv32 else 0bv32)); {472#false} is VALID [2018-11-23 10:01:57,293 INFO L273 TraceCheckUtils]: 13: Hoare triple {472#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {472#false} is VALID [2018-11-23 10:01:57,293 INFO L273 TraceCheckUtils]: 12: Hoare triple {472#false} havoc ~x~0;~x~0 := 0bv32; {472#false} is VALID [2018-11-23 10:01:57,296 INFO L273 TraceCheckUtils]: 11: Hoare triple {547#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {472#false} is VALID [2018-11-23 10:01:57,297 INFO L273 TraceCheckUtils]: 10: Hoare triple {551#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {547#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:01:57,307 INFO L273 TraceCheckUtils]: 9: Hoare triple {551#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {551#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:57,307 INFO L273 TraceCheckUtils]: 8: Hoare triple {551#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {551#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:57,312 INFO L273 TraceCheckUtils]: 7: Hoare triple {471#true} ~i~0 := 2bv32; {551#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:57,312 INFO L273 TraceCheckUtils]: 6: Hoare triple {471#true} assume ~bvslt32(~largest1~0, ~largest2~0);~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {471#true} is VALID [2018-11-23 10:01:57,312 INFO L273 TraceCheckUtils]: 5: Hoare triple {471#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~#array~0.offset), 4bv32);~largest2~0 := #t~mem1;havoc #t~mem1; {471#true} is VALID [2018-11-23 10:01:57,313 INFO L256 TraceCheckUtils]: 4: Hoare triple {471#true} call #t~ret13 := main(); {471#true} is VALID [2018-11-23 10:01:57,313 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {471#true} {471#true} #88#return; {471#true} is VALID [2018-11-23 10:01:57,313 INFO L273 TraceCheckUtils]: 2: Hoare triple {471#true} assume true; {471#true} is VALID [2018-11-23 10:01:57,314 INFO L273 TraceCheckUtils]: 1: Hoare triple {471#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {471#true} is VALID [2018-11-23 10:01:57,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {471#true} call ULTIMATE.init(); {471#true} is VALID [2018-11-23 10:01:57,315 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 10:01:57,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:01:57,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:01:57,319 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 10:01:57,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:01:57,320 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:01:57,403 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:01:57,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:01:57,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:01:57,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:01:57,406 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 6 states. [2018-11-23 10:01:57,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:57,962 INFO L93 Difference]: Finished difference Result 59 states and 78 transitions. [2018-11-23 10:01:57,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:01:57,963 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-23 10:01:57,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:01:57,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:01:57,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2018-11-23 10:01:57,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:01:57,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 78 transitions. [2018-11-23 10:01:57,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 78 transitions. [2018-11-23 10:01:58,186 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 10:01:58,190 INFO L225 Difference]: With dead ends: 59 [2018-11-23 10:01:58,190 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 10:01:58,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:01:58,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 10:01:58,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 10:01:58,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:01:58,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 10:01:58,213 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 10:01:58,213 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 10:01:58,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:58,219 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2018-11-23 10:01:58,219 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2018-11-23 10:01:58,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:01:58,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:01:58,220 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 10:01:58,220 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 10:01:58,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:58,227 INFO L93 Difference]: Finished difference Result 42 states and 55 transitions. [2018-11-23 10:01:58,227 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2018-11-23 10:01:58,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:01:58,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:01:58,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:01:58,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:01:58,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 10:01:58,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 55 transitions. [2018-11-23 10:01:58,232 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 55 transitions. Word has length 18 [2018-11-23 10:01:58,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:01:58,233 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 55 transitions. [2018-11-23 10:01:58,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:01:58,233 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 55 transitions. [2018-11-23 10:01:58,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:01:58,235 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:01:58,235 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 10:01:58,235 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:01:58,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:01:58,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1171382812, now seen corresponding path program 2 times [2018-11-23 10:01:58,236 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:01:58,237 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:01:58,261 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:01:58,323 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:01:58,324 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:01:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:01:58,354 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:01:58,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2018-11-23 10:01:58,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {804#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {804#true} is VALID [2018-11-23 10:01:58,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2018-11-23 10:01:58,487 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #88#return; {804#true} is VALID [2018-11-23 10:01:58,487 INFO L256 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret13 := main(); {804#true} is VALID [2018-11-23 10:01:58,487 INFO L273 TraceCheckUtils]: 5: Hoare triple {804#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~#array~0.offset), 4bv32);~largest2~0 := #t~mem1;havoc #t~mem1; {804#true} is VALID [2018-11-23 10:01:58,488 INFO L273 TraceCheckUtils]: 6: Hoare triple {804#true} assume ~bvslt32(~largest1~0, ~largest2~0);~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {804#true} is VALID [2018-11-23 10:01:58,488 INFO L273 TraceCheckUtils]: 7: Hoare triple {804#true} ~i~0 := 2bv32; {830#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:58,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {830#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {830#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:58,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {830#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {830#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:58,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {830#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {840#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:58,494 INFO L273 TraceCheckUtils]: 11: Hoare triple {840#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {840#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:58,494 INFO L273 TraceCheckUtils]: 12: Hoare triple {840#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {840#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:58,495 INFO L273 TraceCheckUtils]: 13: Hoare triple {840#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {850#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:01:58,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {850#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {850#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:01:58,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {850#(= (_ bv4 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {850#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:01:58,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {850#(= (_ bv4 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {860#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:58,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {860#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {860#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:58,499 INFO L273 TraceCheckUtils]: 18: Hoare triple {860#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {860#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:01:58,506 INFO L273 TraceCheckUtils]: 19: Hoare triple {860#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {870#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:01:58,509 INFO L273 TraceCheckUtils]: 20: Hoare triple {870#(= (_ bv6 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {805#false} is VALID [2018-11-23 10:01:58,509 INFO L273 TraceCheckUtils]: 21: Hoare triple {805#false} havoc ~x~0;~x~0 := 0bv32; {805#false} is VALID [2018-11-23 10:01:58,509 INFO L273 TraceCheckUtils]: 22: Hoare triple {805#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {805#false} is VALID [2018-11-23 10:01:58,510 INFO L256 TraceCheckUtils]: 23: Hoare triple {805#false} call __VERIFIER_assert((if ~bvsle32(#t~mem8, ~largest1~0) then 1bv32 else 0bv32)); {805#false} is VALID [2018-11-23 10:01:58,510 INFO L273 TraceCheckUtils]: 24: Hoare triple {805#false} ~cond := #in~cond; {805#false} is VALID [2018-11-23 10:01:58,510 INFO L273 TraceCheckUtils]: 25: Hoare triple {805#false} assume 0bv32 == ~cond; {805#false} is VALID [2018-11-23 10:01:58,510 INFO L273 TraceCheckUtils]: 26: Hoare triple {805#false} assume !false; {805#false} is VALID [2018-11-23 10:01:58,512 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 10:01:58,512 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:01:58,754 INFO L273 TraceCheckUtils]: 26: Hoare triple {805#false} assume !false; {805#false} is VALID [2018-11-23 10:01:58,755 INFO L273 TraceCheckUtils]: 25: Hoare triple {805#false} assume 0bv32 == ~cond; {805#false} is VALID [2018-11-23 10:01:58,755 INFO L273 TraceCheckUtils]: 24: Hoare triple {805#false} ~cond := #in~cond; {805#false} is VALID [2018-11-23 10:01:58,756 INFO L256 TraceCheckUtils]: 23: Hoare triple {805#false} call __VERIFIER_assert((if ~bvsle32(#t~mem8, ~largest1~0) then 1bv32 else 0bv32)); {805#false} is VALID [2018-11-23 10:01:58,756 INFO L273 TraceCheckUtils]: 22: Hoare triple {805#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {805#false} is VALID [2018-11-23 10:01:58,756 INFO L273 TraceCheckUtils]: 21: Hoare triple {805#false} havoc ~x~0;~x~0 := 0bv32; {805#false} is VALID [2018-11-23 10:01:58,757 INFO L273 TraceCheckUtils]: 20: Hoare triple {910#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {805#false} is VALID [2018-11-23 10:01:58,758 INFO L273 TraceCheckUtils]: 19: Hoare triple {914#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {910#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:01:58,758 INFO L273 TraceCheckUtils]: 18: Hoare triple {914#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {914#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:58,759 INFO L273 TraceCheckUtils]: 17: Hoare triple {914#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {914#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:58,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {924#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {914#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:58,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {924#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {924#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:58,767 INFO L273 TraceCheckUtils]: 14: Hoare triple {924#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {924#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:58,778 INFO L273 TraceCheckUtils]: 13: Hoare triple {934#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {924#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:58,779 INFO L273 TraceCheckUtils]: 12: Hoare triple {934#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {934#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:58,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {934#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {934#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:58,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {944#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {934#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:58,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {944#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {944#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:58,789 INFO L273 TraceCheckUtils]: 8: Hoare triple {944#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {944#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:58,789 INFO L273 TraceCheckUtils]: 7: Hoare triple {804#true} ~i~0 := 2bv32; {944#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:01:58,790 INFO L273 TraceCheckUtils]: 6: Hoare triple {804#true} assume ~bvslt32(~largest1~0, ~largest2~0);~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {804#true} is VALID [2018-11-23 10:01:58,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {804#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~#array~0.offset), 4bv32);~largest2~0 := #t~mem1;havoc #t~mem1; {804#true} is VALID [2018-11-23 10:01:58,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {804#true} call #t~ret13 := main(); {804#true} is VALID [2018-11-23 10:01:58,790 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {804#true} {804#true} #88#return; {804#true} is VALID [2018-11-23 10:01:58,791 INFO L273 TraceCheckUtils]: 2: Hoare triple {804#true} assume true; {804#true} is VALID [2018-11-23 10:01:58,791 INFO L273 TraceCheckUtils]: 1: Hoare triple {804#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {804#true} is VALID [2018-11-23 10:01:58,791 INFO L256 TraceCheckUtils]: 0: Hoare triple {804#true} call ULTIMATE.init(); {804#true} is VALID [2018-11-23 10:01:58,793 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 10:01:58,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:01:58,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:01:58,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-23 10:01:58,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:01:58,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:01:58,878 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:01:58,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:01:58,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:01:58,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:01:58,880 INFO L87 Difference]: Start difference. First operand 42 states and 55 transitions. Second operand 12 states. [2018-11-23 10:02:00,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:00,600 INFO L93 Difference]: Finished difference Result 83 states and 117 transitions. [2018-11-23 10:02:00,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:02:00,600 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 27 [2018-11-23 10:02:00,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:00,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:00,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2018-11-23 10:02:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:00,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2018-11-23 10:02:00,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 117 transitions. [2018-11-23 10:02:00,852 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 10:02:00,855 INFO L225 Difference]: With dead ends: 83 [2018-11-23 10:02:00,855 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 10:02:00,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:02:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 10:02:00,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 10:02:00,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:00,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-23 10:02:00,906 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 10:02:00,907 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 10:02:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:00,911 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2018-11-23 10:02:00,911 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2018-11-23 10:02:00,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:00,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:00,912 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 10:02:00,912 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 10:02:00,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:00,917 INFO L93 Difference]: Finished difference Result 66 states and 91 transitions. [2018-11-23 10:02:00,917 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2018-11-23 10:02:00,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:00,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:00,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:00,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:00,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 10:02:00,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 91 transitions. [2018-11-23 10:02:00,922 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 91 transitions. Word has length 27 [2018-11-23 10:02:00,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:00,923 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 91 transitions. [2018-11-23 10:02:00,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:02:00,923 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 91 transitions. [2018-11-23 10:02:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 10:02:00,925 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:00,925 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 10:02:00,925 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:00,926 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:00,926 INFO L82 PathProgramCache]: Analyzing trace with hash 60454844, now seen corresponding path program 3 times [2018-11-23 10:02:00,926 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:00,927 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:00,947 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:02:01,383 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 10:02:01,383 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:01,427 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:01,705 INFO L256 TraceCheckUtils]: 0: Hoare triple {1311#true} call ULTIMATE.init(); {1311#true} is VALID [2018-11-23 10:02:01,706 INFO L273 TraceCheckUtils]: 1: Hoare triple {1311#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1311#true} is VALID [2018-11-23 10:02:01,706 INFO L273 TraceCheckUtils]: 2: Hoare triple {1311#true} assume true; {1311#true} is VALID [2018-11-23 10:02:01,706 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1311#true} {1311#true} #88#return; {1311#true} is VALID [2018-11-23 10:02:01,707 INFO L256 TraceCheckUtils]: 4: Hoare triple {1311#true} call #t~ret13 := main(); {1311#true} is VALID [2018-11-23 10:02:01,708 INFO L273 TraceCheckUtils]: 5: Hoare triple {1311#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~#array~0.offset), 4bv32);~largest2~0 := #t~mem1;havoc #t~mem1; {1311#true} is VALID [2018-11-23 10:02:01,708 INFO L273 TraceCheckUtils]: 6: Hoare triple {1311#true} assume ~bvslt32(~largest1~0, ~largest2~0);~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1311#true} is VALID [2018-11-23 10:02:01,722 INFO L273 TraceCheckUtils]: 7: Hoare triple {1311#true} ~i~0 := 2bv32; {1337#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,725 INFO L273 TraceCheckUtils]: 8: Hoare triple {1337#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1337#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,726 INFO L273 TraceCheckUtils]: 9: Hoare triple {1337#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1337#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,730 INFO L273 TraceCheckUtils]: 10: Hoare triple {1337#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1347#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {1347#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1347#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,733 INFO L273 TraceCheckUtils]: 12: Hoare triple {1347#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1347#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,733 INFO L273 TraceCheckUtils]: 13: Hoare triple {1347#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1357#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:01,734 INFO L273 TraceCheckUtils]: 14: Hoare triple {1357#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1357#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:01,734 INFO L273 TraceCheckUtils]: 15: Hoare triple {1357#(= (_ bv4 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1357#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:01,735 INFO L273 TraceCheckUtils]: 16: Hoare triple {1357#(= (_ bv4 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1367#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,736 INFO L273 TraceCheckUtils]: 17: Hoare triple {1367#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1367#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,736 INFO L273 TraceCheckUtils]: 18: Hoare triple {1367#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1367#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,737 INFO L273 TraceCheckUtils]: 19: Hoare triple {1367#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1377#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:01,738 INFO L273 TraceCheckUtils]: 20: Hoare triple {1377#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1377#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:01,739 INFO L273 TraceCheckUtils]: 21: Hoare triple {1377#(= (_ bv6 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1377#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:01,740 INFO L273 TraceCheckUtils]: 22: Hoare triple {1377#(= (_ bv6 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1387#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,740 INFO L273 TraceCheckUtils]: 23: Hoare triple {1387#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1387#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,741 INFO L273 TraceCheckUtils]: 24: Hoare triple {1387#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1387#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,742 INFO L273 TraceCheckUtils]: 25: Hoare triple {1387#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1397#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:01,743 INFO L273 TraceCheckUtils]: 26: Hoare triple {1397#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1397#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:01,744 INFO L273 TraceCheckUtils]: 27: Hoare triple {1397#(= (_ bv8 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1397#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:01,745 INFO L273 TraceCheckUtils]: 28: Hoare triple {1397#(= (_ bv8 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1407#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,745 INFO L273 TraceCheckUtils]: 29: Hoare triple {1407#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1407#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,746 INFO L273 TraceCheckUtils]: 30: Hoare triple {1407#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1407#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,747 INFO L273 TraceCheckUtils]: 31: Hoare triple {1407#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1417#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:01,748 INFO L273 TraceCheckUtils]: 32: Hoare triple {1417#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1417#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:01,749 INFO L273 TraceCheckUtils]: 33: Hoare triple {1417#(= (_ bv10 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1417#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:01,749 INFO L273 TraceCheckUtils]: 34: Hoare triple {1417#(= (_ bv10 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1427#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,750 INFO L273 TraceCheckUtils]: 35: Hoare triple {1427#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1427#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,751 INFO L273 TraceCheckUtils]: 36: Hoare triple {1427#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1427#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:01,752 INFO L273 TraceCheckUtils]: 37: Hoare triple {1427#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1437#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:02:01,753 INFO L273 TraceCheckUtils]: 38: Hoare triple {1437#(= (_ bv12 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {1312#false} is VALID [2018-11-23 10:02:01,753 INFO L273 TraceCheckUtils]: 39: Hoare triple {1312#false} havoc ~x~0;~x~0 := 0bv32; {1312#false} is VALID [2018-11-23 10:02:01,753 INFO L273 TraceCheckUtils]: 40: Hoare triple {1312#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1312#false} is VALID [2018-11-23 10:02:01,754 INFO L256 TraceCheckUtils]: 41: Hoare triple {1312#false} call __VERIFIER_assert((if ~bvsle32(#t~mem8, ~largest1~0) then 1bv32 else 0bv32)); {1312#false} is VALID [2018-11-23 10:02:01,754 INFO L273 TraceCheckUtils]: 42: Hoare triple {1312#false} ~cond := #in~cond; {1312#false} is VALID [2018-11-23 10:02:01,754 INFO L273 TraceCheckUtils]: 43: Hoare triple {1312#false} assume 0bv32 == ~cond; {1312#false} is VALID [2018-11-23 10:02:01,755 INFO L273 TraceCheckUtils]: 44: Hoare triple {1312#false} assume !false; {1312#false} is VALID [2018-11-23 10:02:01,761 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 10:02:01,761 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:02,451 INFO L273 TraceCheckUtils]: 44: Hoare triple {1312#false} assume !false; {1312#false} is VALID [2018-11-23 10:02:02,452 INFO L273 TraceCheckUtils]: 43: Hoare triple {1312#false} assume 0bv32 == ~cond; {1312#false} is VALID [2018-11-23 10:02:02,452 INFO L273 TraceCheckUtils]: 42: Hoare triple {1312#false} ~cond := #in~cond; {1312#false} is VALID [2018-11-23 10:02:02,452 INFO L256 TraceCheckUtils]: 41: Hoare triple {1312#false} call __VERIFIER_assert((if ~bvsle32(#t~mem8, ~largest1~0) then 1bv32 else 0bv32)); {1312#false} is VALID [2018-11-23 10:02:02,453 INFO L273 TraceCheckUtils]: 40: Hoare triple {1312#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1312#false} is VALID [2018-11-23 10:02:02,453 INFO L273 TraceCheckUtils]: 39: Hoare triple {1312#false} havoc ~x~0;~x~0 := 0bv32; {1312#false} is VALID [2018-11-23 10:02:02,454 INFO L273 TraceCheckUtils]: 38: Hoare triple {1477#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1312#false} is VALID [2018-11-23 10:02:02,454 INFO L273 TraceCheckUtils]: 37: Hoare triple {1481#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1477#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:02,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {1481#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1481#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {1481#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1481#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,460 INFO L273 TraceCheckUtils]: 34: Hoare triple {1491#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1481#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,461 INFO L273 TraceCheckUtils]: 33: Hoare triple {1491#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1491#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,462 INFO L273 TraceCheckUtils]: 32: Hoare triple {1491#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1491#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,467 INFO L273 TraceCheckUtils]: 31: Hoare triple {1501#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1491#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,467 INFO L273 TraceCheckUtils]: 30: Hoare triple {1501#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1501#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,468 INFO L273 TraceCheckUtils]: 29: Hoare triple {1501#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1501#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,474 INFO L273 TraceCheckUtils]: 28: Hoare triple {1511#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1501#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,475 INFO L273 TraceCheckUtils]: 27: Hoare triple {1511#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1511#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,475 INFO L273 TraceCheckUtils]: 26: Hoare triple {1511#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1511#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,480 INFO L273 TraceCheckUtils]: 25: Hoare triple {1521#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1511#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,481 INFO L273 TraceCheckUtils]: 24: Hoare triple {1521#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1521#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,481 INFO L273 TraceCheckUtils]: 23: Hoare triple {1521#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1521#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,486 INFO L273 TraceCheckUtils]: 22: Hoare triple {1531#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1521#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,487 INFO L273 TraceCheckUtils]: 21: Hoare triple {1531#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1531#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,489 INFO L273 TraceCheckUtils]: 20: Hoare triple {1531#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1531#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,495 INFO L273 TraceCheckUtils]: 19: Hoare triple {1541#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1531#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,496 INFO L273 TraceCheckUtils]: 18: Hoare triple {1541#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1541#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,498 INFO L273 TraceCheckUtils]: 17: Hoare triple {1541#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1541#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,503 INFO L273 TraceCheckUtils]: 16: Hoare triple {1551#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1541#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,504 INFO L273 TraceCheckUtils]: 15: Hoare triple {1551#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1551#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,504 INFO L273 TraceCheckUtils]: 14: Hoare triple {1551#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1551#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,509 INFO L273 TraceCheckUtils]: 13: Hoare triple {1561#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1551#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,510 INFO L273 TraceCheckUtils]: 12: Hoare triple {1561#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1561#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,511 INFO L273 TraceCheckUtils]: 11: Hoare triple {1561#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1561#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,522 INFO L273 TraceCheckUtils]: 10: Hoare triple {1571#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1561#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {1571#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {1571#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {1571#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1571#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,525 INFO L273 TraceCheckUtils]: 7: Hoare triple {1311#true} ~i~0 := 2bv32; {1571#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:02,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {1311#true} assume ~bvslt32(~largest1~0, ~largest2~0);~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {1311#true} is VALID [2018-11-23 10:02:02,526 INFO L273 TraceCheckUtils]: 5: Hoare triple {1311#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~#array~0.offset), 4bv32);~largest2~0 := #t~mem1;havoc #t~mem1; {1311#true} is VALID [2018-11-23 10:02:02,526 INFO L256 TraceCheckUtils]: 4: Hoare triple {1311#true} call #t~ret13 := main(); {1311#true} is VALID [2018-11-23 10:02:02,526 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1311#true} {1311#true} #88#return; {1311#true} is VALID [2018-11-23 10:02:02,527 INFO L273 TraceCheckUtils]: 2: Hoare triple {1311#true} assume true; {1311#true} is VALID [2018-11-23 10:02:02,527 INFO L273 TraceCheckUtils]: 1: Hoare triple {1311#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1311#true} is VALID [2018-11-23 10:02:02,527 INFO L256 TraceCheckUtils]: 0: Hoare triple {1311#true} call ULTIMATE.init(); {1311#true} is VALID [2018-11-23 10:02:02,532 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 10:02:02,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:02,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:02:02,543 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-11-23 10:02:02,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:02,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:02:02,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:02,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:02:02,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:02:02,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:02:02,740 INFO L87 Difference]: Start difference. First operand 66 states and 91 transitions. Second operand 24 states. [2018-11-23 10:02:08,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:08,958 INFO L93 Difference]: Finished difference Result 131 states and 195 transitions. [2018-11-23 10:02:08,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:02:08,958 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 45 [2018-11-23 10:02:08,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:08,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:08,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 195 transitions. [2018-11-23 10:02:08,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:08,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 195 transitions. [2018-11-23 10:02:08,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 195 transitions. [2018-11-23 10:02:09,503 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 10:02:09,507 INFO L225 Difference]: With dead ends: 131 [2018-11-23 10:02:09,508 INFO L226 Difference]: Without dead ends: 114 [2018-11-23 10:02:09,509 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:02:09,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-11-23 10:02:09,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2018-11-23 10:02:09,564 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:09,564 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand 114 states. [2018-11-23 10:02:09,564 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-23 10:02:09,564 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-23 10:02:09,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:09,569 INFO L93 Difference]: Finished difference Result 114 states and 163 transitions. [2018-11-23 10:02:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2018-11-23 10:02:09,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:09,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:09,570 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand 114 states. [2018-11-23 10:02:09,570 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 114 states. [2018-11-23 10:02:09,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:09,576 INFO L93 Difference]: Finished difference Result 114 states and 163 transitions. [2018-11-23 10:02:09,576 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2018-11-23 10:02:09,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:09,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:09,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:09,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:09,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-11-23 10:02:09,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 163 transitions. [2018-11-23 10:02:09,582 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 163 transitions. Word has length 45 [2018-11-23 10:02:09,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:09,582 INFO L480 AbstractCegarLoop]: Abstraction has 114 states and 163 transitions. [2018-11-23 10:02:09,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:02:09,582 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 163 transitions. [2018-11-23 10:02:09,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-11-23 10:02:09,584 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:09,585 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 10:02:09,585 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:09,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:09,585 INFO L82 PathProgramCache]: Analyzing trace with hash 93006588, now seen corresponding path program 4 times [2018-11-23 10:02:09,586 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:09,586 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:09,608 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:02:09,749 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:02:09,749 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:09,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:09,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:10,314 INFO L256 TraceCheckUtils]: 0: Hoare triple {2166#true} call ULTIMATE.init(); {2166#true} is VALID [2018-11-23 10:02:10,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {2166#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2166#true} is VALID [2018-11-23 10:02:10,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {2166#true} assume true; {2166#true} is VALID [2018-11-23 10:02:10,315 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2166#true} {2166#true} #88#return; {2166#true} is VALID [2018-11-23 10:02:10,315 INFO L256 TraceCheckUtils]: 4: Hoare triple {2166#true} call #t~ret13 := main(); {2166#true} is VALID [2018-11-23 10:02:10,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {2166#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~#array~0.offset), 4bv32);~largest2~0 := #t~mem1;havoc #t~mem1; {2166#true} is VALID [2018-11-23 10:02:10,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {2166#true} assume ~bvslt32(~largest1~0, ~largest2~0);~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {2166#true} is VALID [2018-11-23 10:02:10,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {2166#true} ~i~0 := 2bv32; {2192#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,317 INFO L273 TraceCheckUtils]: 8: Hoare triple {2192#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2192#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,318 INFO L273 TraceCheckUtils]: 9: Hoare triple {2192#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2192#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {2192#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2202#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,319 INFO L273 TraceCheckUtils]: 11: Hoare triple {2202#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2202#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {2202#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2202#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,321 INFO L273 TraceCheckUtils]: 13: Hoare triple {2202#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2212#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:10,322 INFO L273 TraceCheckUtils]: 14: Hoare triple {2212#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2212#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:10,326 INFO L273 TraceCheckUtils]: 15: Hoare triple {2212#(= (_ bv4 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2212#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:10,327 INFO L273 TraceCheckUtils]: 16: Hoare triple {2212#(= (_ bv4 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2222#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,327 INFO L273 TraceCheckUtils]: 17: Hoare triple {2222#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2222#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,328 INFO L273 TraceCheckUtils]: 18: Hoare triple {2222#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2222#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,329 INFO L273 TraceCheckUtils]: 19: Hoare triple {2222#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2232#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:10,329 INFO L273 TraceCheckUtils]: 20: Hoare triple {2232#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2232#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:10,330 INFO L273 TraceCheckUtils]: 21: Hoare triple {2232#(= (_ bv6 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2232#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:10,330 INFO L273 TraceCheckUtils]: 22: Hoare triple {2232#(= (_ bv6 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2242#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,331 INFO L273 TraceCheckUtils]: 23: Hoare triple {2242#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2242#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,331 INFO L273 TraceCheckUtils]: 24: Hoare triple {2242#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2242#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,332 INFO L273 TraceCheckUtils]: 25: Hoare triple {2242#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2252#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:10,333 INFO L273 TraceCheckUtils]: 26: Hoare triple {2252#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2252#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:10,333 INFO L273 TraceCheckUtils]: 27: Hoare triple {2252#(= (_ bv8 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2252#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:10,334 INFO L273 TraceCheckUtils]: 28: Hoare triple {2252#(= (_ bv8 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2262#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,335 INFO L273 TraceCheckUtils]: 29: Hoare triple {2262#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2262#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,335 INFO L273 TraceCheckUtils]: 30: Hoare triple {2262#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2262#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,336 INFO L273 TraceCheckUtils]: 31: Hoare triple {2262#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2272#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:10,337 INFO L273 TraceCheckUtils]: 32: Hoare triple {2272#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2272#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:10,337 INFO L273 TraceCheckUtils]: 33: Hoare triple {2272#(= (_ bv10 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2272#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:10,338 INFO L273 TraceCheckUtils]: 34: Hoare triple {2272#(= (_ bv10 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2282#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,339 INFO L273 TraceCheckUtils]: 35: Hoare triple {2282#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2282#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,339 INFO L273 TraceCheckUtils]: 36: Hoare triple {2282#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2282#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,340 INFO L273 TraceCheckUtils]: 37: Hoare triple {2282#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2292#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:02:10,341 INFO L273 TraceCheckUtils]: 38: Hoare triple {2292#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2292#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:02:10,341 INFO L273 TraceCheckUtils]: 39: Hoare triple {2292#(= (_ bv12 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2292#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:02:10,342 INFO L273 TraceCheckUtils]: 40: Hoare triple {2292#(= (_ bv12 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2302#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,343 INFO L273 TraceCheckUtils]: 41: Hoare triple {2302#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2302#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,343 INFO L273 TraceCheckUtils]: 42: Hoare triple {2302#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2302#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,345 INFO L273 TraceCheckUtils]: 43: Hoare triple {2302#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2312#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:02:10,348 INFO L273 TraceCheckUtils]: 44: Hoare triple {2312#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2312#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:02:10,352 INFO L273 TraceCheckUtils]: 45: Hoare triple {2312#(= (_ bv14 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2312#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:02:10,354 INFO L273 TraceCheckUtils]: 46: Hoare triple {2312#(= (_ bv14 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2322#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,356 INFO L273 TraceCheckUtils]: 47: Hoare triple {2322#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2322#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,356 INFO L273 TraceCheckUtils]: 48: Hoare triple {2322#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2322#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,356 INFO L273 TraceCheckUtils]: 49: Hoare triple {2322#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2332#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:02:10,357 INFO L273 TraceCheckUtils]: 50: Hoare triple {2332#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2332#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:02:10,358 INFO L273 TraceCheckUtils]: 51: Hoare triple {2332#(= (_ bv16 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2332#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:02:10,358 INFO L273 TraceCheckUtils]: 52: Hoare triple {2332#(= (_ bv16 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2342#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,360 INFO L273 TraceCheckUtils]: 53: Hoare triple {2342#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2342#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,360 INFO L273 TraceCheckUtils]: 54: Hoare triple {2342#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2342#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,361 INFO L273 TraceCheckUtils]: 55: Hoare triple {2342#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2352#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:02:10,361 INFO L273 TraceCheckUtils]: 56: Hoare triple {2352#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2352#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:02:10,362 INFO L273 TraceCheckUtils]: 57: Hoare triple {2352#(= (_ bv18 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2352#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:02:10,362 INFO L273 TraceCheckUtils]: 58: Hoare triple {2352#(= (_ bv18 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2362#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,363 INFO L273 TraceCheckUtils]: 59: Hoare triple {2362#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2362#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,363 INFO L273 TraceCheckUtils]: 60: Hoare triple {2362#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2362#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,369 INFO L273 TraceCheckUtils]: 61: Hoare triple {2362#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2372#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:02:10,369 INFO L273 TraceCheckUtils]: 62: Hoare triple {2372#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2372#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:02:10,370 INFO L273 TraceCheckUtils]: 63: Hoare triple {2372#(= (_ bv20 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2372#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:02:10,371 INFO L273 TraceCheckUtils]: 64: Hoare triple {2372#(= (_ bv20 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2382#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,371 INFO L273 TraceCheckUtils]: 65: Hoare triple {2382#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2382#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,371 INFO L273 TraceCheckUtils]: 66: Hoare triple {2382#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2382#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,372 INFO L273 TraceCheckUtils]: 67: Hoare triple {2382#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2392#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,372 INFO L273 TraceCheckUtils]: 68: Hoare triple {2392#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2392#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,373 INFO L273 TraceCheckUtils]: 69: Hoare triple {2392#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2392#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,373 INFO L273 TraceCheckUtils]: 70: Hoare triple {2392#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2402#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,374 INFO L273 TraceCheckUtils]: 71: Hoare triple {2402#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2402#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,374 INFO L273 TraceCheckUtils]: 72: Hoare triple {2402#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2402#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,375 INFO L273 TraceCheckUtils]: 73: Hoare triple {2402#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2412#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:10,376 INFO L273 TraceCheckUtils]: 74: Hoare triple {2412#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2167#false} is VALID [2018-11-23 10:02:10,376 INFO L273 TraceCheckUtils]: 75: Hoare triple {2167#false} havoc ~x~0;~x~0 := 0bv32; {2167#false} is VALID [2018-11-23 10:02:10,377 INFO L273 TraceCheckUtils]: 76: Hoare triple {2167#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2167#false} is VALID [2018-11-23 10:02:10,377 INFO L256 TraceCheckUtils]: 77: Hoare triple {2167#false} call __VERIFIER_assert((if ~bvsle32(#t~mem8, ~largest1~0) then 1bv32 else 0bv32)); {2167#false} is VALID [2018-11-23 10:02:10,377 INFO L273 TraceCheckUtils]: 78: Hoare triple {2167#false} ~cond := #in~cond; {2167#false} is VALID [2018-11-23 10:02:10,377 INFO L273 TraceCheckUtils]: 79: Hoare triple {2167#false} assume 0bv32 == ~cond; {2167#false} is VALID [2018-11-23 10:02:10,378 INFO L273 TraceCheckUtils]: 80: Hoare triple {2167#false} assume !false; {2167#false} is VALID [2018-11-23 10:02:10,389 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 10:02:10,389 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:12,475 INFO L273 TraceCheckUtils]: 80: Hoare triple {2167#false} assume !false; {2167#false} is VALID [2018-11-23 10:02:12,476 INFO L273 TraceCheckUtils]: 79: Hoare triple {2167#false} assume 0bv32 == ~cond; {2167#false} is VALID [2018-11-23 10:02:12,476 INFO L273 TraceCheckUtils]: 78: Hoare triple {2167#false} ~cond := #in~cond; {2167#false} is VALID [2018-11-23 10:02:12,477 INFO L256 TraceCheckUtils]: 77: Hoare triple {2167#false} call __VERIFIER_assert((if ~bvsle32(#t~mem8, ~largest1~0) then 1bv32 else 0bv32)); {2167#false} is VALID [2018-11-23 10:02:12,477 INFO L273 TraceCheckUtils]: 76: Hoare triple {2167#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2167#false} is VALID [2018-11-23 10:02:12,477 INFO L273 TraceCheckUtils]: 75: Hoare triple {2167#false} havoc ~x~0;~x~0 := 0bv32; {2167#false} is VALID [2018-11-23 10:02:12,479 INFO L273 TraceCheckUtils]: 74: Hoare triple {2452#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2167#false} is VALID [2018-11-23 10:02:12,480 INFO L273 TraceCheckUtils]: 73: Hoare triple {2456#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2452#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:12,480 INFO L273 TraceCheckUtils]: 72: Hoare triple {2456#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2456#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,480 INFO L273 TraceCheckUtils]: 71: Hoare triple {2456#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2456#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,485 INFO L273 TraceCheckUtils]: 70: Hoare triple {2466#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2456#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,485 INFO L273 TraceCheckUtils]: 69: Hoare triple {2466#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2466#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,486 INFO L273 TraceCheckUtils]: 68: Hoare triple {2466#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2466#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,491 INFO L273 TraceCheckUtils]: 67: Hoare triple {2476#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2466#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,492 INFO L273 TraceCheckUtils]: 66: Hoare triple {2476#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2476#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,492 INFO L273 TraceCheckUtils]: 65: Hoare triple {2476#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2476#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,497 INFO L273 TraceCheckUtils]: 64: Hoare triple {2486#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2476#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,497 INFO L273 TraceCheckUtils]: 63: Hoare triple {2486#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2486#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,499 INFO L273 TraceCheckUtils]: 62: Hoare triple {2486#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2486#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,503 INFO L273 TraceCheckUtils]: 61: Hoare triple {2496#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2486#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,503 INFO L273 TraceCheckUtils]: 60: Hoare triple {2496#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2496#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,504 INFO L273 TraceCheckUtils]: 59: Hoare triple {2496#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2496#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,510 INFO L273 TraceCheckUtils]: 58: Hoare triple {2506#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2496#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,511 INFO L273 TraceCheckUtils]: 57: Hoare triple {2506#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2506#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,511 INFO L273 TraceCheckUtils]: 56: Hoare triple {2506#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2506#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,519 INFO L273 TraceCheckUtils]: 55: Hoare triple {2516#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2506#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,520 INFO L273 TraceCheckUtils]: 54: Hoare triple {2516#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2516#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,520 INFO L273 TraceCheckUtils]: 53: Hoare triple {2516#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2516#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,526 INFO L273 TraceCheckUtils]: 52: Hoare triple {2526#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2516#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,526 INFO L273 TraceCheckUtils]: 51: Hoare triple {2526#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2526#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,527 INFO L273 TraceCheckUtils]: 50: Hoare triple {2526#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2526#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,532 INFO L273 TraceCheckUtils]: 49: Hoare triple {2536#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2526#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,533 INFO L273 TraceCheckUtils]: 48: Hoare triple {2536#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2536#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,533 INFO L273 TraceCheckUtils]: 47: Hoare triple {2536#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2536#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,539 INFO L273 TraceCheckUtils]: 46: Hoare triple {2546#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2536#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,539 INFO L273 TraceCheckUtils]: 45: Hoare triple {2546#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2546#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,540 INFO L273 TraceCheckUtils]: 44: Hoare triple {2546#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2546#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,549 INFO L273 TraceCheckUtils]: 43: Hoare triple {2556#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2546#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,550 INFO L273 TraceCheckUtils]: 42: Hoare triple {2556#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2556#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,551 INFO L273 TraceCheckUtils]: 41: Hoare triple {2556#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2556#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,556 INFO L273 TraceCheckUtils]: 40: Hoare triple {2566#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2556#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,556 INFO L273 TraceCheckUtils]: 39: Hoare triple {2566#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2566#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,557 INFO L273 TraceCheckUtils]: 38: Hoare triple {2566#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2566#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,561 INFO L273 TraceCheckUtils]: 37: Hoare triple {2576#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2566#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,562 INFO L273 TraceCheckUtils]: 36: Hoare triple {2576#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2576#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,562 INFO L273 TraceCheckUtils]: 35: Hoare triple {2576#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2576#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,566 INFO L273 TraceCheckUtils]: 34: Hoare triple {2586#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2576#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,567 INFO L273 TraceCheckUtils]: 33: Hoare triple {2586#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2586#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,567 INFO L273 TraceCheckUtils]: 32: Hoare triple {2586#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2586#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,574 INFO L273 TraceCheckUtils]: 31: Hoare triple {2596#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2586#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,574 INFO L273 TraceCheckUtils]: 30: Hoare triple {2596#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2596#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,575 INFO L273 TraceCheckUtils]: 29: Hoare triple {2596#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2596#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,584 INFO L273 TraceCheckUtils]: 28: Hoare triple {2606#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2596#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,585 INFO L273 TraceCheckUtils]: 27: Hoare triple {2606#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2606#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,585 INFO L273 TraceCheckUtils]: 26: Hoare triple {2606#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2606#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,590 INFO L273 TraceCheckUtils]: 25: Hoare triple {2616#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2606#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,590 INFO L273 TraceCheckUtils]: 24: Hoare triple {2616#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2616#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,591 INFO L273 TraceCheckUtils]: 23: Hoare triple {2616#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2616#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,598 INFO L273 TraceCheckUtils]: 22: Hoare triple {2626#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2616#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,599 INFO L273 TraceCheckUtils]: 21: Hoare triple {2626#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2626#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,599 INFO L273 TraceCheckUtils]: 20: Hoare triple {2626#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2626#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,604 INFO L273 TraceCheckUtils]: 19: Hoare triple {2636#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2626#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {2636#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2636#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,609 INFO L273 TraceCheckUtils]: 17: Hoare triple {2636#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2636#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,613 INFO L273 TraceCheckUtils]: 16: Hoare triple {2646#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2636#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,614 INFO L273 TraceCheckUtils]: 15: Hoare triple {2646#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2646#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,614 INFO L273 TraceCheckUtils]: 14: Hoare triple {2646#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2646#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,622 INFO L273 TraceCheckUtils]: 13: Hoare triple {2656#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2646#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,623 INFO L273 TraceCheckUtils]: 12: Hoare triple {2656#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2656#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {2656#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2656#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,628 INFO L273 TraceCheckUtils]: 10: Hoare triple {2666#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2656#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,628 INFO L273 TraceCheckUtils]: 9: Hoare triple {2666#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {2666#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,629 INFO L273 TraceCheckUtils]: 8: Hoare triple {2666#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2666#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,629 INFO L273 TraceCheckUtils]: 7: Hoare triple {2166#true} ~i~0 := 2bv32; {2666#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:12,629 INFO L273 TraceCheckUtils]: 6: Hoare triple {2166#true} assume ~bvslt32(~largest1~0, ~largest2~0);~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {2166#true} is VALID [2018-11-23 10:02:12,629 INFO L273 TraceCheckUtils]: 5: Hoare triple {2166#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~#array~0.offset), 4bv32);~largest2~0 := #t~mem1;havoc #t~mem1; {2166#true} is VALID [2018-11-23 10:02:12,630 INFO L256 TraceCheckUtils]: 4: Hoare triple {2166#true} call #t~ret13 := main(); {2166#true} is VALID [2018-11-23 10:02:12,630 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2166#true} {2166#true} #88#return; {2166#true} is VALID [2018-11-23 10:02:12,630 INFO L273 TraceCheckUtils]: 2: Hoare triple {2166#true} assume true; {2166#true} is VALID [2018-11-23 10:02:12,630 INFO L273 TraceCheckUtils]: 1: Hoare triple {2166#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2166#true} is VALID [2018-11-23 10:02:12,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {2166#true} call ULTIMATE.init(); {2166#true} is VALID [2018-11-23 10:02:12,642 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 10:02:12,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:12,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:02:12,646 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 81 [2018-11-23 10:02:12,646 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:12,647 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:02:13,040 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:13,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:02:13,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:02:13,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:02:13,043 INFO L87 Difference]: Start difference. First operand 114 states and 163 transitions. Second operand 48 states. [2018-11-23 10:02:26,823 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:02:27,529 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:02:28,308 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:02:29,132 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:02:29,894 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:02:30,615 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:02:31,323 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:02:39,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:39,747 INFO L93 Difference]: Finished difference Result 227 states and 351 transitions. [2018-11-23 10:02:39,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:02:39,747 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 81 [2018-11-23 10:02:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:39,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:02:39,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 351 transitions. [2018-11-23 10:02:39,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:02:39,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 351 transitions. [2018-11-23 10:02:39,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 351 transitions. [2018-11-23 10:02:40,462 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 10:02:40,470 INFO L225 Difference]: With dead ends: 227 [2018-11-23 10:02:40,471 INFO L226 Difference]: Without dead ends: 210 [2018-11-23 10:02:40,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:02:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-11-23 10:02:40,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 210. [2018-11-23 10:02:40,546 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:40,546 INFO L82 GeneralOperation]: Start isEquivalent. First operand 210 states. Second operand 210 states. [2018-11-23 10:02:40,546 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 210 states. [2018-11-23 10:02:40,546 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 210 states. [2018-11-23 10:02:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:40,554 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2018-11-23 10:02:40,554 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 307 transitions. [2018-11-23 10:02:40,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:40,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:40,555 INFO L74 IsIncluded]: Start isIncluded. First operand 210 states. Second operand 210 states. [2018-11-23 10:02:40,555 INFO L87 Difference]: Start difference. First operand 210 states. Second operand 210 states. [2018-11-23 10:02:40,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:40,563 INFO L93 Difference]: Finished difference Result 210 states and 307 transitions. [2018-11-23 10:02:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 307 transitions. [2018-11-23 10:02:40,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:40,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:40,565 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:40,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-11-23 10:02:40,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 307 transitions. [2018-11-23 10:02:40,573 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 307 transitions. Word has length 81 [2018-11-23 10:02:40,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:40,573 INFO L480 AbstractCegarLoop]: Abstraction has 210 states and 307 transitions. [2018-11-23 10:02:40,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:02:40,574 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 307 transitions. [2018-11-23 10:02:40,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-11-23 10:02:40,576 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:40,576 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 10:02:40,576 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:40,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:40,577 INFO L82 PathProgramCache]: Analyzing trace with hash -1178422916, now seen corresponding path program 5 times [2018-11-23 10:02:40,577 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:40,578 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:40,607 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 10:02:50,476 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2018-11-23 10:02:50,477 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:50,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:50,696 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:52,339 INFO L256 TraceCheckUtils]: 0: Hoare triple {3717#true} call ULTIMATE.init(); {3717#true} is VALID [2018-11-23 10:02:52,340 INFO L273 TraceCheckUtils]: 1: Hoare triple {3717#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3717#true} is VALID [2018-11-23 10:02:52,340 INFO L273 TraceCheckUtils]: 2: Hoare triple {3717#true} assume true; {3717#true} is VALID [2018-11-23 10:02:52,340 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3717#true} {3717#true} #88#return; {3717#true} is VALID [2018-11-23 10:02:52,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {3717#true} call #t~ret13 := main(); {3717#true} is VALID [2018-11-23 10:02:52,341 INFO L273 TraceCheckUtils]: 5: Hoare triple {3717#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~#array~0.offset), 4bv32);~largest2~0 := #t~mem1;havoc #t~mem1; {3717#true} is VALID [2018-11-23 10:02:52,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {3717#true} assume ~bvslt32(~largest1~0, ~largest2~0);~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {3717#true} is VALID [2018-11-23 10:02:52,342 INFO L273 TraceCheckUtils]: 7: Hoare triple {3717#true} ~i~0 := 2bv32; {3743#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {3743#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3743#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,342 INFO L273 TraceCheckUtils]: 9: Hoare triple {3743#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3743#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {3743#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3753#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,345 INFO L273 TraceCheckUtils]: 11: Hoare triple {3753#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3753#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,347 INFO L273 TraceCheckUtils]: 12: Hoare triple {3753#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3753#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,348 INFO L273 TraceCheckUtils]: 13: Hoare triple {3753#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3763#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:52,348 INFO L273 TraceCheckUtils]: 14: Hoare triple {3763#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3763#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:52,348 INFO L273 TraceCheckUtils]: 15: Hoare triple {3763#(= (_ bv4 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3763#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 10:02:52,349 INFO L273 TraceCheckUtils]: 16: Hoare triple {3763#(= (_ bv4 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,349 INFO L273 TraceCheckUtils]: 17: Hoare triple {3773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,349 INFO L273 TraceCheckUtils]: 18: Hoare triple {3773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,350 INFO L273 TraceCheckUtils]: 19: Hoare triple {3773#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3783#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:52,351 INFO L273 TraceCheckUtils]: 20: Hoare triple {3783#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3783#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:52,351 INFO L273 TraceCheckUtils]: 21: Hoare triple {3783#(= (_ bv6 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3783#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 10:02:52,352 INFO L273 TraceCheckUtils]: 22: Hoare triple {3783#(= (_ bv6 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3793#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,352 INFO L273 TraceCheckUtils]: 23: Hoare triple {3793#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3793#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,353 INFO L273 TraceCheckUtils]: 24: Hoare triple {3793#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3793#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,353 INFO L273 TraceCheckUtils]: 25: Hoare triple {3793#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3803#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:52,354 INFO L273 TraceCheckUtils]: 26: Hoare triple {3803#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3803#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:52,355 INFO L273 TraceCheckUtils]: 27: Hoare triple {3803#(= (_ bv8 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3803#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 10:02:52,355 INFO L273 TraceCheckUtils]: 28: Hoare triple {3803#(= (_ bv8 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3813#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,356 INFO L273 TraceCheckUtils]: 29: Hoare triple {3813#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3813#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,356 INFO L273 TraceCheckUtils]: 30: Hoare triple {3813#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3813#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,357 INFO L273 TraceCheckUtils]: 31: Hoare triple {3813#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3823#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:52,358 INFO L273 TraceCheckUtils]: 32: Hoare triple {3823#(= (_ bv10 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3823#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:52,358 INFO L273 TraceCheckUtils]: 33: Hoare triple {3823#(= (_ bv10 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3823#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 10:02:52,359 INFO L273 TraceCheckUtils]: 34: Hoare triple {3823#(= (_ bv10 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3833#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,359 INFO L273 TraceCheckUtils]: 35: Hoare triple {3833#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3833#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,360 INFO L273 TraceCheckUtils]: 36: Hoare triple {3833#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3833#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,361 INFO L273 TraceCheckUtils]: 37: Hoare triple {3833#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3843#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:02:52,361 INFO L273 TraceCheckUtils]: 38: Hoare triple {3843#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3843#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:02:52,362 INFO L273 TraceCheckUtils]: 39: Hoare triple {3843#(= (_ bv12 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3843#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 10:02:52,362 INFO L273 TraceCheckUtils]: 40: Hoare triple {3843#(= (_ bv12 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3853#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,363 INFO L273 TraceCheckUtils]: 41: Hoare triple {3853#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3853#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,363 INFO L273 TraceCheckUtils]: 42: Hoare triple {3853#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3853#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,364 INFO L273 TraceCheckUtils]: 43: Hoare triple {3853#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3863#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:02:52,365 INFO L273 TraceCheckUtils]: 44: Hoare triple {3863#(= (_ bv14 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3863#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:02:52,365 INFO L273 TraceCheckUtils]: 45: Hoare triple {3863#(= (_ bv14 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3863#(= (_ bv14 32) main_~i~0)} is VALID [2018-11-23 10:02:52,366 INFO L273 TraceCheckUtils]: 46: Hoare triple {3863#(= (_ bv14 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3873#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,366 INFO L273 TraceCheckUtils]: 47: Hoare triple {3873#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3873#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,367 INFO L273 TraceCheckUtils]: 48: Hoare triple {3873#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3873#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,368 INFO L273 TraceCheckUtils]: 49: Hoare triple {3873#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3883#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:02:52,368 INFO L273 TraceCheckUtils]: 50: Hoare triple {3883#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3883#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:02:52,369 INFO L273 TraceCheckUtils]: 51: Hoare triple {3883#(= (_ bv16 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3883#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 10:02:52,370 INFO L273 TraceCheckUtils]: 52: Hoare triple {3883#(= (_ bv16 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3893#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,370 INFO L273 TraceCheckUtils]: 53: Hoare triple {3893#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3893#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,371 INFO L273 TraceCheckUtils]: 54: Hoare triple {3893#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3893#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,372 INFO L273 TraceCheckUtils]: 55: Hoare triple {3893#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3903#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:02:52,372 INFO L273 TraceCheckUtils]: 56: Hoare triple {3903#(= (_ bv18 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3903#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:02:52,373 INFO L273 TraceCheckUtils]: 57: Hoare triple {3903#(= (_ bv18 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3903#(= (_ bv18 32) main_~i~0)} is VALID [2018-11-23 10:02:52,373 INFO L273 TraceCheckUtils]: 58: Hoare triple {3903#(= (_ bv18 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3913#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,374 INFO L273 TraceCheckUtils]: 59: Hoare triple {3913#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3913#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,375 INFO L273 TraceCheckUtils]: 60: Hoare triple {3913#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3913#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,375 INFO L273 TraceCheckUtils]: 61: Hoare triple {3913#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3923#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:02:52,376 INFO L273 TraceCheckUtils]: 62: Hoare triple {3923#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3923#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:02:52,376 INFO L273 TraceCheckUtils]: 63: Hoare triple {3923#(= (_ bv20 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3923#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 10:02:52,377 INFO L273 TraceCheckUtils]: 64: Hoare triple {3923#(= (_ bv20 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3933#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,378 INFO L273 TraceCheckUtils]: 65: Hoare triple {3933#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3933#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,378 INFO L273 TraceCheckUtils]: 66: Hoare triple {3933#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3933#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,379 INFO L273 TraceCheckUtils]: 67: Hoare triple {3933#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3943#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,380 INFO L273 TraceCheckUtils]: 68: Hoare triple {3943#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3943#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,380 INFO L273 TraceCheckUtils]: 69: Hoare triple {3943#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3943#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,381 INFO L273 TraceCheckUtils]: 70: Hoare triple {3943#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3953#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,382 INFO L273 TraceCheckUtils]: 71: Hoare triple {3953#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3953#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,382 INFO L273 TraceCheckUtils]: 72: Hoare triple {3953#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3953#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,383 INFO L273 TraceCheckUtils]: 73: Hoare triple {3953#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3963#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,384 INFO L273 TraceCheckUtils]: 74: Hoare triple {3963#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3963#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,384 INFO L273 TraceCheckUtils]: 75: Hoare triple {3963#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3963#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,385 INFO L273 TraceCheckUtils]: 76: Hoare triple {3963#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3973#(= (_ bv25 32) main_~i~0)} is VALID [2018-11-23 10:02:52,385 INFO L273 TraceCheckUtils]: 77: Hoare triple {3973#(= (_ bv25 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3973#(= (_ bv25 32) main_~i~0)} is VALID [2018-11-23 10:02:52,386 INFO L273 TraceCheckUtils]: 78: Hoare triple {3973#(= (_ bv25 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3973#(= (_ bv25 32) main_~i~0)} is VALID [2018-11-23 10:02:52,387 INFO L273 TraceCheckUtils]: 79: Hoare triple {3973#(= (_ bv25 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3983#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,387 INFO L273 TraceCheckUtils]: 80: Hoare triple {3983#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3983#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,388 INFO L273 TraceCheckUtils]: 81: Hoare triple {3983#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3983#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,389 INFO L273 TraceCheckUtils]: 82: Hoare triple {3983#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3993#(= (_ bv27 32) main_~i~0)} is VALID [2018-11-23 10:02:52,389 INFO L273 TraceCheckUtils]: 83: Hoare triple {3993#(= (_ bv27 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3993#(= (_ bv27 32) main_~i~0)} is VALID [2018-11-23 10:02:52,390 INFO L273 TraceCheckUtils]: 84: Hoare triple {3993#(= (_ bv27 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {3993#(= (_ bv27 32) main_~i~0)} is VALID [2018-11-23 10:02:52,391 INFO L273 TraceCheckUtils]: 85: Hoare triple {3993#(= (_ bv27 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4003#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,391 INFO L273 TraceCheckUtils]: 86: Hoare triple {4003#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4003#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,392 INFO L273 TraceCheckUtils]: 87: Hoare triple {4003#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4003#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,392 INFO L273 TraceCheckUtils]: 88: Hoare triple {4003#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4013#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 10:02:52,393 INFO L273 TraceCheckUtils]: 89: Hoare triple {4013#(= (_ bv29 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4013#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 10:02:52,393 INFO L273 TraceCheckUtils]: 90: Hoare triple {4013#(= (_ bv29 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4013#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 10:02:52,394 INFO L273 TraceCheckUtils]: 91: Hoare triple {4013#(= (_ bv29 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4023#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,395 INFO L273 TraceCheckUtils]: 92: Hoare triple {4023#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4023#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,395 INFO L273 TraceCheckUtils]: 93: Hoare triple {4023#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4023#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,396 INFO L273 TraceCheckUtils]: 94: Hoare triple {4023#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4033#(= (_ bv31 32) main_~i~0)} is VALID [2018-11-23 10:02:52,396 INFO L273 TraceCheckUtils]: 95: Hoare triple {4033#(= (_ bv31 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4033#(= (_ bv31 32) main_~i~0)} is VALID [2018-11-23 10:02:52,397 INFO L273 TraceCheckUtils]: 96: Hoare triple {4033#(= (_ bv31 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4033#(= (_ bv31 32) main_~i~0)} is VALID [2018-11-23 10:02:52,398 INFO L273 TraceCheckUtils]: 97: Hoare triple {4033#(= (_ bv31 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4043#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,398 INFO L273 TraceCheckUtils]: 98: Hoare triple {4043#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4043#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,399 INFO L273 TraceCheckUtils]: 99: Hoare triple {4043#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4043#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,399 INFO L273 TraceCheckUtils]: 100: Hoare triple {4043#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4053#(= (_ bv33 32) main_~i~0)} is VALID [2018-11-23 10:02:52,400 INFO L273 TraceCheckUtils]: 101: Hoare triple {4053#(= (_ bv33 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4053#(= (_ bv33 32) main_~i~0)} is VALID [2018-11-23 10:02:52,401 INFO L273 TraceCheckUtils]: 102: Hoare triple {4053#(= (_ bv33 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4053#(= (_ bv33 32) main_~i~0)} is VALID [2018-11-23 10:02:52,401 INFO L273 TraceCheckUtils]: 103: Hoare triple {4053#(= (_ bv33 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4063#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,402 INFO L273 TraceCheckUtils]: 104: Hoare triple {4063#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4063#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,402 INFO L273 TraceCheckUtils]: 105: Hoare triple {4063#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4063#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,403 INFO L273 TraceCheckUtils]: 106: Hoare triple {4063#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4073#(= (_ bv35 32) main_~i~0)} is VALID [2018-11-23 10:02:52,404 INFO L273 TraceCheckUtils]: 107: Hoare triple {4073#(= (_ bv35 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4073#(= (_ bv35 32) main_~i~0)} is VALID [2018-11-23 10:02:52,404 INFO L273 TraceCheckUtils]: 108: Hoare triple {4073#(= (_ bv35 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4073#(= (_ bv35 32) main_~i~0)} is VALID [2018-11-23 10:02:52,405 INFO L273 TraceCheckUtils]: 109: Hoare triple {4073#(= (_ bv35 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4083#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,405 INFO L273 TraceCheckUtils]: 110: Hoare triple {4083#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4083#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,406 INFO L273 TraceCheckUtils]: 111: Hoare triple {4083#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4083#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,407 INFO L273 TraceCheckUtils]: 112: Hoare triple {4083#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4093#(= (_ bv37 32) main_~i~0)} is VALID [2018-11-23 10:02:52,407 INFO L273 TraceCheckUtils]: 113: Hoare triple {4093#(= (_ bv37 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4093#(= (_ bv37 32) main_~i~0)} is VALID [2018-11-23 10:02:52,408 INFO L273 TraceCheckUtils]: 114: Hoare triple {4093#(= (_ bv37 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4093#(= (_ bv37 32) main_~i~0)} is VALID [2018-11-23 10:02:52,409 INFO L273 TraceCheckUtils]: 115: Hoare triple {4093#(= (_ bv37 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4103#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,409 INFO L273 TraceCheckUtils]: 116: Hoare triple {4103#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4103#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,410 INFO L273 TraceCheckUtils]: 117: Hoare triple {4103#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4103#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,411 INFO L273 TraceCheckUtils]: 118: Hoare triple {4103#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4113#(= (_ bv39 32) main_~i~0)} is VALID [2018-11-23 10:02:52,411 INFO L273 TraceCheckUtils]: 119: Hoare triple {4113#(= (_ bv39 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4113#(= (_ bv39 32) main_~i~0)} is VALID [2018-11-23 10:02:52,412 INFO L273 TraceCheckUtils]: 120: Hoare triple {4113#(= (_ bv39 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4113#(= (_ bv39 32) main_~i~0)} is VALID [2018-11-23 10:02:52,412 INFO L273 TraceCheckUtils]: 121: Hoare triple {4113#(= (_ bv39 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4123#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,413 INFO L273 TraceCheckUtils]: 122: Hoare triple {4123#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4123#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,413 INFO L273 TraceCheckUtils]: 123: Hoare triple {4123#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4123#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,414 INFO L273 TraceCheckUtils]: 124: Hoare triple {4123#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4133#(= (_ bv41 32) main_~i~0)} is VALID [2018-11-23 10:02:52,415 INFO L273 TraceCheckUtils]: 125: Hoare triple {4133#(= (_ bv41 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4133#(= (_ bv41 32) main_~i~0)} is VALID [2018-11-23 10:02:52,415 INFO L273 TraceCheckUtils]: 126: Hoare triple {4133#(= (_ bv41 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4133#(= (_ bv41 32) main_~i~0)} is VALID [2018-11-23 10:02:52,416 INFO L273 TraceCheckUtils]: 127: Hoare triple {4133#(= (_ bv41 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4143#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,417 INFO L273 TraceCheckUtils]: 128: Hoare triple {4143#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4143#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,417 INFO L273 TraceCheckUtils]: 129: Hoare triple {4143#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4143#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,418 INFO L273 TraceCheckUtils]: 130: Hoare triple {4143#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4153#(= (_ bv43 32) main_~i~0)} is VALID [2018-11-23 10:02:52,419 INFO L273 TraceCheckUtils]: 131: Hoare triple {4153#(= (_ bv43 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4153#(= (_ bv43 32) main_~i~0)} is VALID [2018-11-23 10:02:52,419 INFO L273 TraceCheckUtils]: 132: Hoare triple {4153#(= (_ bv43 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4153#(= (_ bv43 32) main_~i~0)} is VALID [2018-11-23 10:02:52,420 INFO L273 TraceCheckUtils]: 133: Hoare triple {4153#(= (_ bv43 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4163#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,420 INFO L273 TraceCheckUtils]: 134: Hoare triple {4163#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4163#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,421 INFO L273 TraceCheckUtils]: 135: Hoare triple {4163#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4163#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,422 INFO L273 TraceCheckUtils]: 136: Hoare triple {4163#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4173#(= (_ bv45 32) main_~i~0)} is VALID [2018-11-23 10:02:52,422 INFO L273 TraceCheckUtils]: 137: Hoare triple {4173#(= (_ bv45 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4173#(= (_ bv45 32) main_~i~0)} is VALID [2018-11-23 10:02:52,423 INFO L273 TraceCheckUtils]: 138: Hoare triple {4173#(= (_ bv45 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4173#(= (_ bv45 32) main_~i~0)} is VALID [2018-11-23 10:02:52,424 INFO L273 TraceCheckUtils]: 139: Hoare triple {4173#(= (_ bv45 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4183#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,441 INFO L273 TraceCheckUtils]: 140: Hoare triple {4183#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4183#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,441 INFO L273 TraceCheckUtils]: 141: Hoare triple {4183#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4183#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,442 INFO L273 TraceCheckUtils]: 142: Hoare triple {4183#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4193#(= (_ bv47 32) main_~i~0)} is VALID [2018-11-23 10:02:52,442 INFO L273 TraceCheckUtils]: 143: Hoare triple {4193#(= (_ bv47 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4193#(= (_ bv47 32) main_~i~0)} is VALID [2018-11-23 10:02:52,442 INFO L273 TraceCheckUtils]: 144: Hoare triple {4193#(= (_ bv47 32) main_~i~0)} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4193#(= (_ bv47 32) main_~i~0)} is VALID [2018-11-23 10:02:52,443 INFO L273 TraceCheckUtils]: 145: Hoare triple {4193#(= (_ bv47 32) main_~i~0)} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4203#(= (bvadd main_~i~0 (_ bv4294967248 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:52,461 INFO L273 TraceCheckUtils]: 146: Hoare triple {4203#(= (bvadd main_~i~0 (_ bv4294967248 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3718#false} is VALID [2018-11-23 10:02:52,461 INFO L273 TraceCheckUtils]: 147: Hoare triple {3718#false} havoc ~x~0;~x~0 := 0bv32; {3718#false} is VALID [2018-11-23 10:02:52,461 INFO L273 TraceCheckUtils]: 148: Hoare triple {3718#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3718#false} is VALID [2018-11-23 10:02:52,461 INFO L256 TraceCheckUtils]: 149: Hoare triple {3718#false} call __VERIFIER_assert((if ~bvsle32(#t~mem8, ~largest1~0) then 1bv32 else 0bv32)); {3718#false} is VALID [2018-11-23 10:02:52,462 INFO L273 TraceCheckUtils]: 150: Hoare triple {3718#false} ~cond := #in~cond; {3718#false} is VALID [2018-11-23 10:02:52,462 INFO L273 TraceCheckUtils]: 151: Hoare triple {3718#false} assume 0bv32 == ~cond; {3718#false} is VALID [2018-11-23 10:02:52,462 INFO L273 TraceCheckUtils]: 152: Hoare triple {3718#false} assume !false; {3718#false} is VALID [2018-11-23 10:02:52,497 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 10:02:52,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:03:00,163 INFO L273 TraceCheckUtils]: 152: Hoare triple {3718#false} assume !false; {3718#false} is VALID [2018-11-23 10:03:00,164 INFO L273 TraceCheckUtils]: 151: Hoare triple {3718#false} assume 0bv32 == ~cond; {3718#false} is VALID [2018-11-23 10:03:00,164 INFO L273 TraceCheckUtils]: 150: Hoare triple {3718#false} ~cond := #in~cond; {3718#false} is VALID [2018-11-23 10:03:00,164 INFO L256 TraceCheckUtils]: 149: Hoare triple {3718#false} call __VERIFIER_assert((if ~bvsle32(#t~mem8, ~largest1~0) then 1bv32 else 0bv32)); {3718#false} is VALID [2018-11-23 10:03:00,164 INFO L273 TraceCheckUtils]: 148: Hoare triple {3718#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem8 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3718#false} is VALID [2018-11-23 10:03:00,165 INFO L273 TraceCheckUtils]: 147: Hoare triple {3718#false} havoc ~x~0;~x~0 := 0bv32; {3718#false} is VALID [2018-11-23 10:03:00,169 INFO L273 TraceCheckUtils]: 146: Hoare triple {4243#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3718#false} is VALID [2018-11-23 10:03:00,169 INFO L273 TraceCheckUtils]: 145: Hoare triple {4247#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4243#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:03:00,170 INFO L273 TraceCheckUtils]: 144: Hoare triple {4247#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4247#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,187 INFO L273 TraceCheckUtils]: 143: Hoare triple {4247#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4247#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,191 INFO L273 TraceCheckUtils]: 142: Hoare triple {4257#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4247#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,192 INFO L273 TraceCheckUtils]: 141: Hoare triple {4257#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4257#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,192 INFO L273 TraceCheckUtils]: 140: Hoare triple {4257#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4257#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,199 INFO L273 TraceCheckUtils]: 139: Hoare triple {4267#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4257#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,199 INFO L273 TraceCheckUtils]: 138: Hoare triple {4267#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4267#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,200 INFO L273 TraceCheckUtils]: 137: Hoare triple {4267#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4267#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,205 INFO L273 TraceCheckUtils]: 136: Hoare triple {4277#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4267#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,205 INFO L273 TraceCheckUtils]: 135: Hoare triple {4277#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4277#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,206 INFO L273 TraceCheckUtils]: 134: Hoare triple {4277#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4277#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,210 INFO L273 TraceCheckUtils]: 133: Hoare triple {4287#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4277#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,210 INFO L273 TraceCheckUtils]: 132: Hoare triple {4287#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4287#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,211 INFO L273 TraceCheckUtils]: 131: Hoare triple {4287#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4287#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,215 INFO L273 TraceCheckUtils]: 130: Hoare triple {4297#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4287#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,215 INFO L273 TraceCheckUtils]: 129: Hoare triple {4297#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4297#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,216 INFO L273 TraceCheckUtils]: 128: Hoare triple {4297#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4297#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,222 INFO L273 TraceCheckUtils]: 127: Hoare triple {4307#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4297#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,223 INFO L273 TraceCheckUtils]: 126: Hoare triple {4307#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4307#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,223 INFO L273 TraceCheckUtils]: 125: Hoare triple {4307#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4307#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,228 INFO L273 TraceCheckUtils]: 124: Hoare triple {4317#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4307#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,229 INFO L273 TraceCheckUtils]: 123: Hoare triple {4317#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4317#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,229 INFO L273 TraceCheckUtils]: 122: Hoare triple {4317#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4317#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,235 INFO L273 TraceCheckUtils]: 121: Hoare triple {4327#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4317#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,236 INFO L273 TraceCheckUtils]: 120: Hoare triple {4327#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4327#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,236 INFO L273 TraceCheckUtils]: 119: Hoare triple {4327#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4327#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,244 INFO L273 TraceCheckUtils]: 118: Hoare triple {4337#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4327#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,245 INFO L273 TraceCheckUtils]: 117: Hoare triple {4337#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4337#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,245 INFO L273 TraceCheckUtils]: 116: Hoare triple {4337#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4337#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,250 INFO L273 TraceCheckUtils]: 115: Hoare triple {4347#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4337#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,251 INFO L273 TraceCheckUtils]: 114: Hoare triple {4347#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4347#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,251 INFO L273 TraceCheckUtils]: 113: Hoare triple {4347#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4347#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,255 INFO L273 TraceCheckUtils]: 112: Hoare triple {4357#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4347#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,256 INFO L273 TraceCheckUtils]: 111: Hoare triple {4357#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4357#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,256 INFO L273 TraceCheckUtils]: 110: Hoare triple {4357#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4357#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,260 INFO L273 TraceCheckUtils]: 109: Hoare triple {4367#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4357#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,260 INFO L273 TraceCheckUtils]: 108: Hoare triple {4367#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4367#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,261 INFO L273 TraceCheckUtils]: 107: Hoare triple {4367#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4367#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,266 INFO L273 TraceCheckUtils]: 106: Hoare triple {4377#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4367#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,266 INFO L273 TraceCheckUtils]: 105: Hoare triple {4377#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4377#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,267 INFO L273 TraceCheckUtils]: 104: Hoare triple {4377#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4377#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,274 INFO L273 TraceCheckUtils]: 103: Hoare triple {4387#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4377#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,275 INFO L273 TraceCheckUtils]: 102: Hoare triple {4387#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4387#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,275 INFO L273 TraceCheckUtils]: 101: Hoare triple {4387#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4387#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,283 INFO L273 TraceCheckUtils]: 100: Hoare triple {4397#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4387#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,284 INFO L273 TraceCheckUtils]: 99: Hoare triple {4397#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4397#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,284 INFO L273 TraceCheckUtils]: 98: Hoare triple {4397#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4397#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,288 INFO L273 TraceCheckUtils]: 97: Hoare triple {4407#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4397#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,289 INFO L273 TraceCheckUtils]: 96: Hoare triple {4407#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4407#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,289 INFO L273 TraceCheckUtils]: 95: Hoare triple {4407#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4407#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,296 INFO L273 TraceCheckUtils]: 94: Hoare triple {4417#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4407#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,296 INFO L273 TraceCheckUtils]: 93: Hoare triple {4417#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4417#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,297 INFO L273 TraceCheckUtils]: 92: Hoare triple {4417#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4417#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,302 INFO L273 TraceCheckUtils]: 91: Hoare triple {4427#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4417#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,302 INFO L273 TraceCheckUtils]: 90: Hoare triple {4427#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4427#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,303 INFO L273 TraceCheckUtils]: 89: Hoare triple {4427#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4427#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,307 INFO L273 TraceCheckUtils]: 88: Hoare triple {4437#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4427#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,308 INFO L273 TraceCheckUtils]: 87: Hoare triple {4437#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4437#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,308 INFO L273 TraceCheckUtils]: 86: Hoare triple {4437#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4437#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,317 INFO L273 TraceCheckUtils]: 85: Hoare triple {4447#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4437#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,317 INFO L273 TraceCheckUtils]: 84: Hoare triple {4447#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4447#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,318 INFO L273 TraceCheckUtils]: 83: Hoare triple {4447#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4447#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,322 INFO L273 TraceCheckUtils]: 82: Hoare triple {4457#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4447#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,323 INFO L273 TraceCheckUtils]: 81: Hoare triple {4457#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4457#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,323 INFO L273 TraceCheckUtils]: 80: Hoare triple {4457#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4457#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,330 INFO L273 TraceCheckUtils]: 79: Hoare triple {4467#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4457#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,330 INFO L273 TraceCheckUtils]: 78: Hoare triple {4467#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4467#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,331 INFO L273 TraceCheckUtils]: 77: Hoare triple {4467#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4467#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,336 INFO L273 TraceCheckUtils]: 76: Hoare triple {4477#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4467#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,337 INFO L273 TraceCheckUtils]: 75: Hoare triple {4477#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4477#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,337 INFO L273 TraceCheckUtils]: 74: Hoare triple {4477#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4477#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,342 INFO L273 TraceCheckUtils]: 73: Hoare triple {4487#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4477#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,343 INFO L273 TraceCheckUtils]: 72: Hoare triple {4487#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4487#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,343 INFO L273 TraceCheckUtils]: 71: Hoare triple {4487#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4487#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,348 INFO L273 TraceCheckUtils]: 70: Hoare triple {4497#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4487#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,349 INFO L273 TraceCheckUtils]: 69: Hoare triple {4497#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4497#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,349 INFO L273 TraceCheckUtils]: 68: Hoare triple {4497#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4497#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,355 INFO L273 TraceCheckUtils]: 67: Hoare triple {4507#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4497#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,356 INFO L273 TraceCheckUtils]: 66: Hoare triple {4507#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4507#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,356 INFO L273 TraceCheckUtils]: 65: Hoare triple {4507#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4507#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,364 INFO L273 TraceCheckUtils]: 64: Hoare triple {4517#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4507#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,364 INFO L273 TraceCheckUtils]: 63: Hoare triple {4517#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4517#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,365 INFO L273 TraceCheckUtils]: 62: Hoare triple {4517#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4517#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,369 INFO L273 TraceCheckUtils]: 61: Hoare triple {4527#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4517#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,370 INFO L273 TraceCheckUtils]: 60: Hoare triple {4527#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4527#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,370 INFO L273 TraceCheckUtils]: 59: Hoare triple {4527#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4527#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,376 INFO L273 TraceCheckUtils]: 58: Hoare triple {4537#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4527#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,376 INFO L273 TraceCheckUtils]: 57: Hoare triple {4537#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4537#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,377 INFO L273 TraceCheckUtils]: 56: Hoare triple {4537#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4537#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,382 INFO L273 TraceCheckUtils]: 55: Hoare triple {4547#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4537#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,383 INFO L273 TraceCheckUtils]: 54: Hoare triple {4547#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4547#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,383 INFO L273 TraceCheckUtils]: 53: Hoare triple {4547#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4547#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,390 INFO L273 TraceCheckUtils]: 52: Hoare triple {4557#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4547#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,390 INFO L273 TraceCheckUtils]: 51: Hoare triple {4557#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4557#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,390 INFO L273 TraceCheckUtils]: 50: Hoare triple {4557#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4557#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,396 INFO L273 TraceCheckUtils]: 49: Hoare triple {4567#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4557#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,396 INFO L273 TraceCheckUtils]: 48: Hoare triple {4567#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4567#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,397 INFO L273 TraceCheckUtils]: 47: Hoare triple {4567#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4567#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,402 INFO L273 TraceCheckUtils]: 46: Hoare triple {4577#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4567#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,402 INFO L273 TraceCheckUtils]: 45: Hoare triple {4577#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4577#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,403 INFO L273 TraceCheckUtils]: 44: Hoare triple {4577#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4577#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,408 INFO L273 TraceCheckUtils]: 43: Hoare triple {4587#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4577#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {4587#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4587#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,409 INFO L273 TraceCheckUtils]: 41: Hoare triple {4587#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4587#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,413 INFO L273 TraceCheckUtils]: 40: Hoare triple {4597#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4587#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,414 INFO L273 TraceCheckUtils]: 39: Hoare triple {4597#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4597#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,414 INFO L273 TraceCheckUtils]: 38: Hoare triple {4597#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4597#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,421 INFO L273 TraceCheckUtils]: 37: Hoare triple {4607#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4597#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,421 INFO L273 TraceCheckUtils]: 36: Hoare triple {4607#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4607#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,421 INFO L273 TraceCheckUtils]: 35: Hoare triple {4607#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4607#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,426 INFO L273 TraceCheckUtils]: 34: Hoare triple {4617#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4607#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,427 INFO L273 TraceCheckUtils]: 33: Hoare triple {4617#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4617#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,427 INFO L273 TraceCheckUtils]: 32: Hoare triple {4617#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4617#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,433 INFO L273 TraceCheckUtils]: 31: Hoare triple {4627#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4617#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,433 INFO L273 TraceCheckUtils]: 30: Hoare triple {4627#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4627#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,433 INFO L273 TraceCheckUtils]: 29: Hoare triple {4627#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4627#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,442 INFO L273 TraceCheckUtils]: 28: Hoare triple {4637#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4627#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,442 INFO L273 TraceCheckUtils]: 27: Hoare triple {4637#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4637#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,442 INFO L273 TraceCheckUtils]: 26: Hoare triple {4637#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4637#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,447 INFO L273 TraceCheckUtils]: 25: Hoare triple {4647#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4637#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,447 INFO L273 TraceCheckUtils]: 24: Hoare triple {4647#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4647#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,448 INFO L273 TraceCheckUtils]: 23: Hoare triple {4647#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4647#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,455 INFO L273 TraceCheckUtils]: 22: Hoare triple {4657#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4647#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,455 INFO L273 TraceCheckUtils]: 21: Hoare triple {4657#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4657#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,456 INFO L273 TraceCheckUtils]: 20: Hoare triple {4657#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4657#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,461 INFO L273 TraceCheckUtils]: 19: Hoare triple {4667#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4657#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,461 INFO L273 TraceCheckUtils]: 18: Hoare triple {4667#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4667#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,462 INFO L273 TraceCheckUtils]: 17: Hoare triple {4667#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4667#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,468 INFO L273 TraceCheckUtils]: 16: Hoare triple {4677#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4667#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,469 INFO L273 TraceCheckUtils]: 15: Hoare triple {4677#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4677#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,469 INFO L273 TraceCheckUtils]: 14: Hoare triple {4677#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4677#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,488 INFO L273 TraceCheckUtils]: 13: Hoare triple {4687#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4677#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,491 INFO L273 TraceCheckUtils]: 12: Hoare triple {4687#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4687#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,492 INFO L273 TraceCheckUtils]: 11: Hoare triple {4687#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4687#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,499 INFO L273 TraceCheckUtils]: 10: Hoare triple {4697#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4687#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,505 INFO L273 TraceCheckUtils]: 9: Hoare triple {4697#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} assume ~bvsge32(#t~mem3, ~largest1~0);havoc #t~mem3;~largest2~0 := ~largest1~0;call #t~mem4 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~largest1~0 := #t~mem4;havoc #t~mem4; {4697#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,505 INFO L273 TraceCheckUtils]: 8: Hoare triple {4697#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#array~0.base, ~bvadd32(~#array~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4697#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,506 INFO L273 TraceCheckUtils]: 7: Hoare triple {3717#true} ~i~0 := 2bv32; {4697#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 10:03:00,506 INFO L273 TraceCheckUtils]: 6: Hoare triple {3717#true} assume ~bvslt32(~largest1~0, ~largest2~0);~temp~0 := ~largest1~0;~largest1~0 := ~largest2~0;~largest2~0 := ~temp~0; {3717#true} is VALID [2018-11-23 10:03:00,506 INFO L273 TraceCheckUtils]: 5: Hoare triple {3717#true} call ~#array~0.base, ~#array~0.offset := #Ultimate.alloc(400000bv32);havoc ~i~0;havoc ~largest1~0;havoc ~largest2~0;havoc ~temp~0;call #t~mem0 := read~intINTTYPE4(~#array~0.base, ~#array~0.offset, 4bv32);~largest1~0 := #t~mem0;havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#array~0.base, ~bvadd32(4bv32, ~#array~0.offset), 4bv32);~largest2~0 := #t~mem1;havoc #t~mem1; {3717#true} is VALID [2018-11-23 10:03:00,506 INFO L256 TraceCheckUtils]: 4: Hoare triple {3717#true} call #t~ret13 := main(); {3717#true} is VALID [2018-11-23 10:03:00,506 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3717#true} {3717#true} #88#return; {3717#true} is VALID [2018-11-23 10:03:00,506 INFO L273 TraceCheckUtils]: 2: Hoare triple {3717#true} assume true; {3717#true} is VALID [2018-11-23 10:03:00,507 INFO L273 TraceCheckUtils]: 1: Hoare triple {3717#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3717#true} is VALID [2018-11-23 10:03:00,507 INFO L256 TraceCheckUtils]: 0: Hoare triple {3717#true} call ULTIMATE.init(); {3717#true} is VALID [2018-11-23 10:03:00,535 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 10:03:00,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:03:00,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2018-11-23 10:03:00,539 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 153 [2018-11-23 10:03:00,540 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:03:00,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states. [2018-11-23 10:03:01,345 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:03:01,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-11-23 10:03:01,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-11-23 10:03:01,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2018-11-23 10:03:01,350 INFO L87 Difference]: Start difference. First operand 210 states and 307 transitions. Second operand 96 states. [2018-11-23 10:03:52,869 WARN L180 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 7 [2018-11-23 10:03:55,225 WARN L180 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 7 [2018-11-23 10:03:57,607 WARN L180 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 7 [2018-11-23 10:04:00,121 WARN L180 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 7 [2018-11-23 10:04:02,692 WARN L180 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 7 [2018-11-23 10:04:05,367 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 7 [2018-11-23 10:04:08,053 WARN L180 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 7 [2018-11-23 10:04:10,797 WARN L180 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 7 [2018-11-23 10:04:13,664 WARN L180 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 7 [2018-11-23 10:04:16,498 WARN L180 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 7 [2018-11-23 10:04:19,291 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 7 [2018-11-23 10:04:22,065 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 7 [2018-11-23 10:04:24,934 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 7 [2018-11-23 10:04:27,798 WARN L180 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 7 [2018-11-23 10:04:30,574 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 7 [2018-11-23 10:04:33,452 WARN L180 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 7 [2018-11-23 10:04:36,341 WARN L180 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 7 [2018-11-23 10:04:39,179 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 7 [2018-11-23 10:04:41,947 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 7 [2018-11-23 10:04:44,753 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 7 [2018-11-23 10:04:47,575 WARN L180 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 7 [2018-11-23 10:04:50,252 WARN L180 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 7 [2018-11-23 10:04:52,893 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 7 [2018-11-23 10:04:55,373 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 7 [2018-11-23 10:04:57,776 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:05:00,065 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:05:02,299 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:05:04,565 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:05:06,828 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:05:08,926 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:05:10,961 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:05:12,933 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:05:29,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:05:29,898 INFO L93 Difference]: Finished difference Result 419 states and 663 transitions. [2018-11-23 10:05:29,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-23 10:05:29,898 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 153 [2018-11-23 10:05:29,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:05:29,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 10:05:29,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 663 transitions. [2018-11-23 10:05:29,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 10:05:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 663 transitions. [2018-11-23 10:05:29,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states and 663 transitions. [2018-11-23 10:05:31,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 663 edges. 663 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:05:31,394 INFO L225 Difference]: With dead ends: 419 [2018-11-23 10:05:31,394 INFO L226 Difference]: Without dead ends: 402 [2018-11-23 10:05:31,401 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 93.9s TimeCoverageRelationStatistics Valid=6814, Invalid=13208, Unknown=0, NotChecked=0, Total=20022 [2018-11-23 10:05:31,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-11-23 10:05:31,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 402. [2018-11-23 10:05:31,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:05:31,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand 402 states. [2018-11-23 10:05:31,901 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand 402 states. [2018-11-23 10:05:31,901 INFO L87 Difference]: Start difference. First operand 402 states. Second operand 402 states. [2018-11-23 10:05:31,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:05:31,919 INFO L93 Difference]: Finished difference Result 402 states and 595 transitions. [2018-11-23 10:05:31,919 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 595 transitions. [2018-11-23 10:05:31,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:05:31,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:05:31,921 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand 402 states. [2018-11-23 10:05:31,921 INFO L87 Difference]: Start difference. First operand 402 states. Second operand 402 states. [2018-11-23 10:05:31,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:05:31,938 INFO L93 Difference]: Finished difference Result 402 states and 595 transitions. [2018-11-23 10:05:31,938 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 595 transitions. [2018-11-23 10:05:31,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:05:31,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:05:31,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:05:31,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:05:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-11-23 10:05:31,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 595 transitions. [2018-11-23 10:05:31,956 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 595 transitions. Word has length 153 [2018-11-23 10:05:31,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:05:31,956 INFO L480 AbstractCegarLoop]: Abstraction has 402 states and 595 transitions. [2018-11-23 10:05:31,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-11-23 10:05:31,957 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 595 transitions. [2018-11-23 10:05:31,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-11-23 10:05:31,962 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:05:31,962 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:05:31,963 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:05:31,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:05:31,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1505083780, now seen corresponding path program 6 times [2018-11-23 10:05:31,964 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:05:31,964 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:05:31,992 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE