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/standard_minInArray_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:58:44,839 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:58:44,841 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:58:44,853 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:58:44,854 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:58:44,855 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:58:44,856 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:58:44,858 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:58:44,860 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:58:44,861 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:58:44,863 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:58:44,863 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:58:44,864 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:58:44,865 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:58:44,867 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:58:44,876 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:58:44,877 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:58:44,884 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:58:44,888 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:58:44,890 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:58:44,893 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:58:44,897 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:58:44,900 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:58:44,902 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:58:44,904 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:58:44,905 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:58:44,906 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:58:44,908 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:58:44,909 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:58:44,911 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:58:44,911 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:58:44,911 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:58:44,913 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:58:44,913 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:58:44,914 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:58:44,916 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:58:44,916 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 09:58:44,945 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:58:44,946 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:58:44,947 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:58:44,947 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:58:44,947 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:58:44,948 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:58:44,948 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:58:44,948 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:58:44,948 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:58:44,948 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:58:44,949 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:58:44,949 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:58:44,949 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:58:44,949 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:58:44,949 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:58:44,950 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:58:44,950 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:58:44,950 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:58:44,950 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:58:44,950 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:58:44,951 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:58:44,951 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:58:44,951 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:58:44,951 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:58:44,952 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:44,952 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:58:44,952 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:58:44,952 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:58:44,952 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:58:44,953 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:58:44,953 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:58:44,953 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:58:44,953 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:58:45,008 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:58:45,029 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:58:45,033 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:58:45,034 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:58:45,035 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:58:45,036 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_minInArray_false-unreach-call_ground.i [2018-11-23 09:58:45,109 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cdcd50de/f7e22d05301f489a98a21e789b5b3485/FLAG7fdd45153 [2018-11-23 09:58:45,618 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:58:45,618 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_minInArray_false-unreach-call_ground.i [2018-11-23 09:58:45,627 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cdcd50de/f7e22d05301f489a98a21e789b5b3485/FLAG7fdd45153 [2018-11-23 09:58:45,958 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6cdcd50de/f7e22d05301f489a98a21e789b5b3485 [2018-11-23 09:58:45,971 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:58:45,973 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:58:45,974 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:45,974 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:58:45,978 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:58:45,979 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:45" (1/1) ... [2018-11-23 09:58:45,983 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7629bdd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:45, skipping insertion in model container [2018-11-23 09:58:45,983 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:45" (1/1) ... [2018-11-23 09:58:45,994 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:58:46,020 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:58:46,235 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:46,241 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:58:46,265 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:46,292 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:58:46,292 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:46 WrapperNode [2018-11-23 09:58:46,292 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:46,293 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:46,294 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:58:46,294 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:58:46,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:46" (1/1) ... [2018-11-23 09:58:46,315 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:46" (1/1) ... [2018-11-23 09:58:46,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:46,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:58:46,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:58:46,325 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:58:46,336 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:46" (1/1) ... [2018-11-23 09:58:46,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:46" (1/1) ... [2018-11-23 09:58:46,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:46" (1/1) ... [2018-11-23 09:58:46,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:46" (1/1) ... [2018-11-23 09:58:46,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:46" (1/1) ... [2018-11-23 09:58:46,358 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:46" (1/1) ... [2018-11-23 09:58:46,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:46" (1/1) ... [2018-11-23 09:58:46,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:58:46,362 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:58:46,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:58:46,363 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:58:46,364 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:46" (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 09:58:46,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:58:46,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:58:46,502 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:58:46,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:58:46,502 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:58:46,502 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:58:46,503 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:58:46,503 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:58:46,503 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:58:46,503 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:58:46,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:58:47,029 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:58:47,029 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 09:58:47,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:47 BoogieIcfgContainer [2018-11-23 09:58:47,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:58:47,031 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:58:47,031 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:58:47,034 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:58:47,035 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:58:45" (1/3) ... [2018-11-23 09:58:47,035 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b46c1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:47, skipping insertion in model container [2018-11-23 09:58:47,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:46" (2/3) ... [2018-11-23 09:58:47,036 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b46c1da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:47, skipping insertion in model container [2018-11-23 09:58:47,036 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:47" (3/3) ... [2018-11-23 09:58:47,038 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_minInArray_false-unreach-call_ground.i [2018-11-23 09:58:47,047 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:58:47,054 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:58:47,070 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:58:47,104 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:58:47,105 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:58:47,106 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:58:47,106 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:58:47,107 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:58:47,107 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:58:47,107 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:58:47,108 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:58:47,108 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:58:47,127 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2018-11-23 09:58:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 09:58:47,134 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:47,135 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:47,138 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:47,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:47,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1513105276, now seen corresponding path program 1 times [2018-11-23 09:58:47,148 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:47,149 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 09:58:47,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:47,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:47,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:47,311 INFO L256 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {28#true} is VALID [2018-11-23 09:58:47,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {28#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {28#true} is VALID [2018-11-23 09:58:47,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2018-11-23 09:58:47,316 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #55#return; {28#true} is VALID [2018-11-23 09:58:47,316 INFO L256 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret4 := main(); {28#true} is VALID [2018-11-23 09:58:47,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~min~0 := 0bv32;~i~0 := 0bv32; {28#true} is VALID [2018-11-23 09:58:47,318 INFO L273 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2018-11-23 09:58:47,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {29#false} havoc ~x~0;~x~0 := 0bv32; {29#false} is VALID [2018-11-23 09:58:47,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {29#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {29#false} is VALID [2018-11-23 09:58:47,319 INFO L256 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~bvsgt32(#t~mem3, ~min~0) then 1bv32 else 0bv32)); {29#false} is VALID [2018-11-23 09:58:47,319 INFO L273 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2018-11-23 09:58:47,320 INFO L273 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2018-11-23 09:58:47,320 INFO L273 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2018-11-23 09:58:47,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 09:58:47,323 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:47,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:47,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:58:47,334 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 09:58:47,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:47,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:58:47,509 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:47,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:58:47,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:58:47,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:47,524 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2018-11-23 09:58:47,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:47,813 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 09:58:47,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:58:47,813 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 09:58:47,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 09:58:47,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 49 transitions. [2018-11-23 09:58:47,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 49 transitions. [2018-11-23 09:58:47,979 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:47,990 INFO L225 Difference]: With dead ends: 41 [2018-11-23 09:58:47,990 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 09:58:47,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 12 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 09:58:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 09:58:48,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 09:58:48,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:48,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 09:58:48,033 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 09:58:48,033 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 09:58:48,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:48,038 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 09:58:48,038 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 09:58:48,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:48,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:48,039 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 09:58:48,040 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 09:58:48,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:48,043 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 09:58:48,044 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 09:58:48,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:48,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:48,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:48,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:48,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 09:58:48,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 09:58:48,049 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 09:58:48,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:48,050 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 09:58:48,050 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:58:48,050 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 09:58:48,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 09:58:48,051 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:48,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:48,051 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:48,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:48,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1609256121, now seen corresponding path program 1 times [2018-11-23 09:58:48,052 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:48,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 09:58:48,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:48,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:48,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:48,133 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:48,271 INFO L256 TraceCheckUtils]: 0: Hoare triple {188#true} call ULTIMATE.init(); {188#true} is VALID [2018-11-23 09:58:48,271 INFO L273 TraceCheckUtils]: 1: Hoare triple {188#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {188#true} is VALID [2018-11-23 09:58:48,272 INFO L273 TraceCheckUtils]: 2: Hoare triple {188#true} assume true; {188#true} is VALID [2018-11-23 09:58:48,272 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {188#true} {188#true} #55#return; {188#true} is VALID [2018-11-23 09:58:48,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {188#true} call #t~ret4 := main(); {188#true} is VALID [2018-11-23 09:58:48,276 INFO L273 TraceCheckUtils]: 5: Hoare triple {188#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~min~0 := 0bv32;~i~0 := 0bv32; {208#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:48,277 INFO L273 TraceCheckUtils]: 6: Hoare triple {208#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {189#false} is VALID [2018-11-23 09:58:48,277 INFO L273 TraceCheckUtils]: 7: Hoare triple {189#false} havoc ~x~0;~x~0 := 0bv32; {189#false} is VALID [2018-11-23 09:58:48,277 INFO L273 TraceCheckUtils]: 8: Hoare triple {189#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {189#false} is VALID [2018-11-23 09:58:48,277 INFO L256 TraceCheckUtils]: 9: Hoare triple {189#false} call __VERIFIER_assert((if ~bvsgt32(#t~mem3, ~min~0) then 1bv32 else 0bv32)); {189#false} is VALID [2018-11-23 09:58:48,278 INFO L273 TraceCheckUtils]: 10: Hoare triple {189#false} ~cond := #in~cond; {189#false} is VALID [2018-11-23 09:58:48,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {189#false} assume 0bv32 == ~cond; {189#false} is VALID [2018-11-23 09:58:48,278 INFO L273 TraceCheckUtils]: 12: Hoare triple {189#false} assume !false; {189#false} is VALID [2018-11-23 09:58:48,279 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 09:58:48,281 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:48,282 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:48,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:48,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 09:58:48,284 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:48,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:58:48,311 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:48,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:48,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:48,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:48,313 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 3 states. [2018-11-23 09:58:48,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:48,426 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-23 09:58:48,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:48,426 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-23 09:58:48,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:48,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:48,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 09:58:48,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:48,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2018-11-23 09:58:48,433 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 38 transitions. [2018-11-23 09:58:48,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:48,665 INFO L225 Difference]: With dead ends: 34 [2018-11-23 09:58:48,667 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 09:58:48,668 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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 09:58:48,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 09:58:48,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-11-23 09:58:48,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:48,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2018-11-23 09:58:48,800 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2018-11-23 09:58:48,801 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2018-11-23 09:58:48,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:48,805 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 09:58:48,805 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 09:58:48,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:48,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:48,807 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2018-11-23 09:58:48,807 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2018-11-23 09:58:48,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:48,810 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2018-11-23 09:58:48,811 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2018-11-23 09:58:48,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:48,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:48,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:48,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 09:58:48,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-11-23 09:58:48,814 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 13 [2018-11-23 09:58:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:48,817 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-11-23 09:58:48,817 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:48,817 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-11-23 09:58:48,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 09:58:48,818 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:48,818 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:48,819 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:48,819 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:48,819 INFO L82 PathProgramCache]: Analyzing trace with hash -30491421, now seen corresponding path program 1 times [2018-11-23 09:58:48,820 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:48,821 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 09:58:48,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:48,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:48,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:48,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:48,995 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 09:58:48,995 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {351#true} is VALID [2018-11-23 09:58:48,995 INFO L273 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 09:58:48,996 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #55#return; {351#true} is VALID [2018-11-23 09:58:48,996 INFO L256 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret4 := main(); {351#true} is VALID [2018-11-23 09:58:48,996 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~min~0 := 0bv32;~i~0 := 0bv32; {371#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:48,998 INFO L273 TraceCheckUtils]: 6: Hoare triple {371#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {371#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:49,001 INFO L273 TraceCheckUtils]: 7: Hoare triple {371#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {371#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:49,007 INFO L273 TraceCheckUtils]: 8: Hoare triple {371#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {381#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:49,007 INFO L273 TraceCheckUtils]: 9: Hoare triple {381#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {352#false} is VALID [2018-11-23 09:58:49,008 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#false} havoc ~x~0;~x~0 := 0bv32; {352#false} is VALID [2018-11-23 09:58:49,008 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {352#false} is VALID [2018-11-23 09:58:49,008 INFO L256 TraceCheckUtils]: 12: Hoare triple {352#false} call __VERIFIER_assert((if ~bvsgt32(#t~mem3, ~min~0) then 1bv32 else 0bv32)); {352#false} is VALID [2018-11-23 09:58:49,009 INFO L273 TraceCheckUtils]: 13: Hoare triple {352#false} ~cond := #in~cond; {352#false} is VALID [2018-11-23 09:58:49,009 INFO L273 TraceCheckUtils]: 14: Hoare triple {352#false} assume 0bv32 == ~cond; {352#false} is VALID [2018-11-23 09:58:49,009 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 09:58:49,010 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 09:58:49,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:49,143 INFO L273 TraceCheckUtils]: 15: Hoare triple {352#false} assume !false; {352#false} is VALID [2018-11-23 09:58:49,144 INFO L273 TraceCheckUtils]: 14: Hoare triple {352#false} assume 0bv32 == ~cond; {352#false} is VALID [2018-11-23 09:58:49,144 INFO L273 TraceCheckUtils]: 13: Hoare triple {352#false} ~cond := #in~cond; {352#false} is VALID [2018-11-23 09:58:49,144 INFO L256 TraceCheckUtils]: 12: Hoare triple {352#false} call __VERIFIER_assert((if ~bvsgt32(#t~mem3, ~min~0) then 1bv32 else 0bv32)); {352#false} is VALID [2018-11-23 09:58:49,145 INFO L273 TraceCheckUtils]: 11: Hoare triple {352#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {352#false} is VALID [2018-11-23 09:58:49,145 INFO L273 TraceCheckUtils]: 10: Hoare triple {352#false} havoc ~x~0;~x~0 := 0bv32; {352#false} is VALID [2018-11-23 09:58:49,146 INFO L273 TraceCheckUtils]: 9: Hoare triple {421#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {352#false} is VALID [2018-11-23 09:58:49,147 INFO L273 TraceCheckUtils]: 8: Hoare triple {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {421#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:49,148 INFO L273 TraceCheckUtils]: 7: Hoare triple {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,154 INFO L273 TraceCheckUtils]: 6: Hoare triple {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {351#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~min~0 := 0bv32;~i~0 := 0bv32; {425#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,155 INFO L256 TraceCheckUtils]: 4: Hoare triple {351#true} call #t~ret4 := main(); {351#true} is VALID [2018-11-23 09:58:49,156 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {351#true} {351#true} #55#return; {351#true} is VALID [2018-11-23 09:58:49,156 INFO L273 TraceCheckUtils]: 2: Hoare triple {351#true} assume true; {351#true} is VALID [2018-11-23 09:58:49,156 INFO L273 TraceCheckUtils]: 1: Hoare triple {351#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {351#true} is VALID [2018-11-23 09:58:49,156 INFO L256 TraceCheckUtils]: 0: Hoare triple {351#true} call ULTIMATE.init(); {351#true} is VALID [2018-11-23 09:58:49,157 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 09:58:49,161 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:49,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:58:49,163 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 09:58:49,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:49,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:58:49,196 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:49,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:58:49,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:58:49,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:58:49,198 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 6 states. [2018-11-23 09:58:49,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:49,582 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2018-11-23 09:58:49,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:58:49,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-23 09:58:49,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:49,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 09:58:49,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:49,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 49 transitions. [2018-11-23 09:58:49,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 49 transitions. [2018-11-23 09:58:49,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:49,780 INFO L225 Difference]: With dead ends: 41 [2018-11-23 09:58:49,781 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 09:58:49,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 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 09:58:49,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 09:58:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2018-11-23 09:58:49,803 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:49,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2018-11-23 09:58:49,804 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 09:58:49,804 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 09:58:49,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:49,807 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 09:58:49,807 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 09:58:49,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:49,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:49,808 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2018-11-23 09:58:49,808 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2018-11-23 09:58:49,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:49,811 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-23 09:58:49,811 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 09:58:49,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:49,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:49,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:49,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-11-23 09:58:49,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2018-11-23 09:58:49,815 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 16 [2018-11-23 09:58:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:49,815 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2018-11-23 09:58:49,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:58:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2018-11-23 09:58:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 09:58:49,817 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:49,817 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:49,817 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:49,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:49,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1113893945, now seen corresponding path program 2 times [2018-11-23 09:58:49,818 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:49,819 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 09:58:49,845 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:58:49,896 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:58:49,896 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:49,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:49,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:50,091 INFO L256 TraceCheckUtils]: 0: Hoare triple {612#true} call ULTIMATE.init(); {612#true} is VALID [2018-11-23 09:58:50,092 INFO L273 TraceCheckUtils]: 1: Hoare triple {612#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {612#true} is VALID [2018-11-23 09:58:50,092 INFO L273 TraceCheckUtils]: 2: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-23 09:58:50,092 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {612#true} {612#true} #55#return; {612#true} is VALID [2018-11-23 09:58:50,093 INFO L256 TraceCheckUtils]: 4: Hoare triple {612#true} call #t~ret4 := main(); {612#true} is VALID [2018-11-23 09:58:50,095 INFO L273 TraceCheckUtils]: 5: Hoare triple {612#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~min~0 := 0bv32;~i~0 := 0bv32; {632#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:50,096 INFO L273 TraceCheckUtils]: 6: Hoare triple {632#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {632#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:50,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {632#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {632#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:50,097 INFO L273 TraceCheckUtils]: 8: Hoare triple {632#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {642#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,098 INFO L273 TraceCheckUtils]: 9: Hoare triple {642#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {642#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,098 INFO L273 TraceCheckUtils]: 10: Hoare triple {642#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {642#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,099 INFO L273 TraceCheckUtils]: 11: Hoare triple {642#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {652#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,100 INFO L273 TraceCheckUtils]: 12: Hoare triple {652#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {652#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,100 INFO L273 TraceCheckUtils]: 13: Hoare triple {652#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {652#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,101 INFO L273 TraceCheckUtils]: 14: Hoare triple {652#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {662#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,102 INFO L273 TraceCheckUtils]: 15: Hoare triple {662#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {662#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,104 INFO L273 TraceCheckUtils]: 16: Hoare triple {662#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {662#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,105 INFO L273 TraceCheckUtils]: 17: Hoare triple {662#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {672#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:50,105 INFO L273 TraceCheckUtils]: 18: Hoare triple {672#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {613#false} is VALID [2018-11-23 09:58:50,106 INFO L273 TraceCheckUtils]: 19: Hoare triple {613#false} havoc ~x~0;~x~0 := 0bv32; {613#false} is VALID [2018-11-23 09:58:50,106 INFO L273 TraceCheckUtils]: 20: Hoare triple {613#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {613#false} is VALID [2018-11-23 09:58:50,106 INFO L256 TraceCheckUtils]: 21: Hoare triple {613#false} call __VERIFIER_assert((if ~bvsgt32(#t~mem3, ~min~0) then 1bv32 else 0bv32)); {613#false} is VALID [2018-11-23 09:58:50,106 INFO L273 TraceCheckUtils]: 22: Hoare triple {613#false} ~cond := #in~cond; {613#false} is VALID [2018-11-23 09:58:50,106 INFO L273 TraceCheckUtils]: 23: Hoare triple {613#false} assume 0bv32 == ~cond; {613#false} is VALID [2018-11-23 09:58:50,107 INFO L273 TraceCheckUtils]: 24: Hoare triple {613#false} assume !false; {613#false} is VALID [2018-11-23 09:58:50,108 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 09:58:50,108 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:50,303 INFO L273 TraceCheckUtils]: 24: Hoare triple {613#false} assume !false; {613#false} is VALID [2018-11-23 09:58:50,303 INFO L273 TraceCheckUtils]: 23: Hoare triple {613#false} assume 0bv32 == ~cond; {613#false} is VALID [2018-11-23 09:58:50,303 INFO L273 TraceCheckUtils]: 22: Hoare triple {613#false} ~cond := #in~cond; {613#false} is VALID [2018-11-23 09:58:50,304 INFO L256 TraceCheckUtils]: 21: Hoare triple {613#false} call __VERIFIER_assert((if ~bvsgt32(#t~mem3, ~min~0) then 1bv32 else 0bv32)); {613#false} is VALID [2018-11-23 09:58:50,304 INFO L273 TraceCheckUtils]: 20: Hoare triple {613#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {613#false} is VALID [2018-11-23 09:58:50,304 INFO L273 TraceCheckUtils]: 19: Hoare triple {613#false} havoc ~x~0;~x~0 := 0bv32; {613#false} is VALID [2018-11-23 09:58:50,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {712#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {613#false} is VALID [2018-11-23 09:58:50,309 INFO L273 TraceCheckUtils]: 17: Hoare triple {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {712#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:50,310 INFO L273 TraceCheckUtils]: 16: Hoare triple {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,311 INFO L273 TraceCheckUtils]: 15: Hoare triple {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,316 INFO L273 TraceCheckUtils]: 14: Hoare triple {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {716#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,316 INFO L273 TraceCheckUtils]: 13: Hoare triple {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,317 INFO L273 TraceCheckUtils]: 12: Hoare triple {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,323 INFO L273 TraceCheckUtils]: 11: Hoare triple {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {726#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,324 INFO L273 TraceCheckUtils]: 10: Hoare triple {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,325 INFO L273 TraceCheckUtils]: 9: Hoare triple {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,330 INFO L273 TraceCheckUtils]: 8: Hoare triple {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {736#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,330 INFO L273 TraceCheckUtils]: 7: Hoare triple {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,332 INFO L273 TraceCheckUtils]: 5: Hoare triple {612#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~min~0 := 0bv32;~i~0 := 0bv32; {746#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,332 INFO L256 TraceCheckUtils]: 4: Hoare triple {612#true} call #t~ret4 := main(); {612#true} is VALID [2018-11-23 09:58:50,332 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {612#true} {612#true} #55#return; {612#true} is VALID [2018-11-23 09:58:50,332 INFO L273 TraceCheckUtils]: 2: Hoare triple {612#true} assume true; {612#true} is VALID [2018-11-23 09:58:50,333 INFO L273 TraceCheckUtils]: 1: Hoare triple {612#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {612#true} is VALID [2018-11-23 09:58:50,333 INFO L256 TraceCheckUtils]: 0: Hoare triple {612#true} call ULTIMATE.init(); {612#true} is VALID [2018-11-23 09:58:50,335 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 09:58:50,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:50,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:58:50,338 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 09:58:50,339 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:50,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 09:58:50,430 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:50,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:58:50,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:58:50,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:58:50,431 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 12 states. [2018-11-23 09:58:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:51,533 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2018-11-23 09:58:51,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:58:51,533 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 25 [2018-11-23 09:58:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:51,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:51,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-23 09:58:51,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:51,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 76 transitions. [2018-11-23 09:58:51,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 76 transitions. [2018-11-23 09:58:51,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:51,709 INFO L225 Difference]: With dead ends: 59 [2018-11-23 09:58:51,709 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 09:58:51,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 39 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 09:58:51,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 09:58:51,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 09:58:51,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:51,765 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-23 09:58:51,765 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 09:58:51,765 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 09:58:51,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:51,769 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 09:58:51,769 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 09:58:51,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:51,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:51,770 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-23 09:58:51,770 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-23 09:58:51,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:51,774 INFO L93 Difference]: Finished difference Result 48 states and 59 transitions. [2018-11-23 09:58:51,774 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 09:58:51,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:51,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:51,775 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:51,775 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:51,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:58:51,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2018-11-23 09:58:51,778 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 25 [2018-11-23 09:58:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:51,778 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2018-11-23 09:58:51,778 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:58:51,779 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2018-11-23 09:58:51,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-11-23 09:58:51,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:51,781 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:51,781 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:51,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:51,781 INFO L82 PathProgramCache]: Analyzing trace with hash 881632121, now seen corresponding path program 3 times [2018-11-23 09:58:51,782 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:51,782 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 09:58:51,798 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:58:52,218 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2018-11-23 09:58:52,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:52,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:52,252 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:52,568 INFO L256 TraceCheckUtils]: 0: Hoare triple {1023#true} call ULTIMATE.init(); {1023#true} is VALID [2018-11-23 09:58:52,569 INFO L273 TraceCheckUtils]: 1: Hoare triple {1023#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1023#true} is VALID [2018-11-23 09:58:52,570 INFO L273 TraceCheckUtils]: 2: Hoare triple {1023#true} assume true; {1023#true} is VALID [2018-11-23 09:58:52,570 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1023#true} {1023#true} #55#return; {1023#true} is VALID [2018-11-23 09:58:52,571 INFO L256 TraceCheckUtils]: 4: Hoare triple {1023#true} call #t~ret4 := main(); {1023#true} is VALID [2018-11-23 09:58:52,571 INFO L273 TraceCheckUtils]: 5: Hoare triple {1023#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~min~0 := 0bv32;~i~0 := 0bv32; {1043#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:52,572 INFO L273 TraceCheckUtils]: 6: Hoare triple {1043#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1043#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:52,572 INFO L273 TraceCheckUtils]: 7: Hoare triple {1043#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1043#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:52,573 INFO L273 TraceCheckUtils]: 8: Hoare triple {1043#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1053#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,573 INFO L273 TraceCheckUtils]: 9: Hoare triple {1053#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1053#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,574 INFO L273 TraceCheckUtils]: 10: Hoare triple {1053#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1053#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {1053#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1063#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,576 INFO L273 TraceCheckUtils]: 12: Hoare triple {1063#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1063#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,591 INFO L273 TraceCheckUtils]: 13: Hoare triple {1063#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1063#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {1063#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1073#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,593 INFO L273 TraceCheckUtils]: 15: Hoare triple {1073#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1073#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,594 INFO L273 TraceCheckUtils]: 16: Hoare triple {1073#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1073#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,595 INFO L273 TraceCheckUtils]: 17: Hoare triple {1073#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1083#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,596 INFO L273 TraceCheckUtils]: 18: Hoare triple {1083#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1083#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,597 INFO L273 TraceCheckUtils]: 19: Hoare triple {1083#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1083#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,602 INFO L273 TraceCheckUtils]: 20: Hoare triple {1083#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1093#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,603 INFO L273 TraceCheckUtils]: 21: Hoare triple {1093#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1093#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,603 INFO L273 TraceCheckUtils]: 22: Hoare triple {1093#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1093#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,604 INFO L273 TraceCheckUtils]: 23: Hoare triple {1093#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1103#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,604 INFO L273 TraceCheckUtils]: 24: Hoare triple {1103#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1103#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,605 INFO L273 TraceCheckUtils]: 25: Hoare triple {1103#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1103#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,605 INFO L273 TraceCheckUtils]: 26: Hoare triple {1103#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1113#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,606 INFO L273 TraceCheckUtils]: 27: Hoare triple {1113#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1113#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,606 INFO L273 TraceCheckUtils]: 28: Hoare triple {1113#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1113#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,607 INFO L273 TraceCheckUtils]: 29: Hoare triple {1113#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1123#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 09:58:52,608 INFO L273 TraceCheckUtils]: 30: Hoare triple {1123#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1123#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 09:58:52,609 INFO L273 TraceCheckUtils]: 31: Hoare triple {1123#(= (_ bv8 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1123#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 09:58:52,610 INFO L273 TraceCheckUtils]: 32: Hoare triple {1123#(= (_ bv8 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1133#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,611 INFO L273 TraceCheckUtils]: 33: Hoare triple {1133#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1133#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,611 INFO L273 TraceCheckUtils]: 34: Hoare triple {1133#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1133#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,612 INFO L273 TraceCheckUtils]: 35: Hoare triple {1133#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1143#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:52,613 INFO L273 TraceCheckUtils]: 36: Hoare triple {1143#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1024#false} is VALID [2018-11-23 09:58:52,613 INFO L273 TraceCheckUtils]: 37: Hoare triple {1024#false} havoc ~x~0;~x~0 := 0bv32; {1024#false} is VALID [2018-11-23 09:58:52,614 INFO L273 TraceCheckUtils]: 38: Hoare triple {1024#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1024#false} is VALID [2018-11-23 09:58:52,614 INFO L256 TraceCheckUtils]: 39: Hoare triple {1024#false} call __VERIFIER_assert((if ~bvsgt32(#t~mem3, ~min~0) then 1bv32 else 0bv32)); {1024#false} is VALID [2018-11-23 09:58:52,614 INFO L273 TraceCheckUtils]: 40: Hoare triple {1024#false} ~cond := #in~cond; {1024#false} is VALID [2018-11-23 09:58:52,615 INFO L273 TraceCheckUtils]: 41: Hoare triple {1024#false} assume 0bv32 == ~cond; {1024#false} is VALID [2018-11-23 09:58:52,615 INFO L273 TraceCheckUtils]: 42: Hoare triple {1024#false} assume !false; {1024#false} is VALID [2018-11-23 09:58:52,620 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 09:58:52,621 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:53,159 INFO L273 TraceCheckUtils]: 42: Hoare triple {1024#false} assume !false; {1024#false} is VALID [2018-11-23 09:58:53,159 INFO L273 TraceCheckUtils]: 41: Hoare triple {1024#false} assume 0bv32 == ~cond; {1024#false} is VALID [2018-11-23 09:58:53,160 INFO L273 TraceCheckUtils]: 40: Hoare triple {1024#false} ~cond := #in~cond; {1024#false} is VALID [2018-11-23 09:58:53,160 INFO L256 TraceCheckUtils]: 39: Hoare triple {1024#false} call __VERIFIER_assert((if ~bvsgt32(#t~mem3, ~min~0) then 1bv32 else 0bv32)); {1024#false} is VALID [2018-11-23 09:58:53,160 INFO L273 TraceCheckUtils]: 38: Hoare triple {1024#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1024#false} is VALID [2018-11-23 09:58:53,161 INFO L273 TraceCheckUtils]: 37: Hoare triple {1024#false} havoc ~x~0;~x~0 := 0bv32; {1024#false} is VALID [2018-11-23 09:58:53,161 INFO L273 TraceCheckUtils]: 36: Hoare triple {1183#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1024#false} is VALID [2018-11-23 09:58:53,162 INFO L273 TraceCheckUtils]: 35: Hoare triple {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1183#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:53,162 INFO L273 TraceCheckUtils]: 34: Hoare triple {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,167 INFO L273 TraceCheckUtils]: 32: Hoare triple {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1187#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,168 INFO L273 TraceCheckUtils]: 31: Hoare triple {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,168 INFO L273 TraceCheckUtils]: 30: Hoare triple {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,175 INFO L273 TraceCheckUtils]: 29: Hoare triple {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1197#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,175 INFO L273 TraceCheckUtils]: 28: Hoare triple {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,176 INFO L273 TraceCheckUtils]: 27: Hoare triple {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,181 INFO L273 TraceCheckUtils]: 26: Hoare triple {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1207#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,181 INFO L273 TraceCheckUtils]: 25: Hoare triple {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,182 INFO L273 TraceCheckUtils]: 24: Hoare triple {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,186 INFO L273 TraceCheckUtils]: 23: Hoare triple {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1217#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,187 INFO L273 TraceCheckUtils]: 22: Hoare triple {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,187 INFO L273 TraceCheckUtils]: 21: Hoare triple {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,192 INFO L273 TraceCheckUtils]: 20: Hoare triple {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1227#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,192 INFO L273 TraceCheckUtils]: 19: Hoare triple {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,193 INFO L273 TraceCheckUtils]: 18: Hoare triple {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,201 INFO L273 TraceCheckUtils]: 17: Hoare triple {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1237#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,202 INFO L273 TraceCheckUtils]: 15: Hoare triple {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,207 INFO L273 TraceCheckUtils]: 14: Hoare triple {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1247#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,208 INFO L273 TraceCheckUtils]: 13: Hoare triple {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,208 INFO L273 TraceCheckUtils]: 12: Hoare triple {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,214 INFO L273 TraceCheckUtils]: 11: Hoare triple {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1257#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,215 INFO L273 TraceCheckUtils]: 10: Hoare triple {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,215 INFO L273 TraceCheckUtils]: 9: Hoare triple {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,223 INFO L273 TraceCheckUtils]: 8: Hoare triple {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1267#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {1023#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~min~0 := 0bv32;~i~0 := 0bv32; {1277#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:53,234 INFO L256 TraceCheckUtils]: 4: Hoare triple {1023#true} call #t~ret4 := main(); {1023#true} is VALID [2018-11-23 09:58:53,235 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1023#true} {1023#true} #55#return; {1023#true} is VALID [2018-11-23 09:58:53,235 INFO L273 TraceCheckUtils]: 2: Hoare triple {1023#true} assume true; {1023#true} is VALID [2018-11-23 09:58:53,235 INFO L273 TraceCheckUtils]: 1: Hoare triple {1023#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1023#true} is VALID [2018-11-23 09:58:53,235 INFO L256 TraceCheckUtils]: 0: Hoare triple {1023#true} call ULTIMATE.init(); {1023#true} is VALID [2018-11-23 09:58:53,240 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 09:58:53,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:53,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 09:58:53,243 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-11-23 09:58:53,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:53,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 09:58:53,431 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 09:58:53,432 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 09:58:53,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 09:58:53,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 09:58:53,433 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 24 states. [2018-11-23 09:58:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:57,671 INFO L93 Difference]: Finished difference Result 95 states and 130 transitions. [2018-11-23 09:58:57,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 09:58:57,671 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 43 [2018-11-23 09:58:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:57,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 130 transitions. [2018-11-23 09:58:57,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:57,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 130 transitions. [2018-11-23 09:58:57,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 130 transitions. [2018-11-23 09:58:58,124 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:58,129 INFO L225 Difference]: With dead ends: 95 [2018-11-23 09:58:58,129 INFO L226 Difference]: Without dead ends: 84 [2018-11-23 09:58:58,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 09:58:58,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-11-23 09:58:58,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2018-11-23 09:58:58,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:58,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand 84 states. [2018-11-23 09:58:58,191 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-23 09:58:58,191 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-23 09:58:58,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:58,196 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2018-11-23 09:58:58,196 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2018-11-23 09:58:58,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:58,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:58,197 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand 84 states. [2018-11-23 09:58:58,197 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 84 states. [2018-11-23 09:58:58,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:58,201 INFO L93 Difference]: Finished difference Result 84 states and 107 transitions. [2018-11-23 09:58:58,201 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2018-11-23 09:58:58,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:58,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:58,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:58,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 09:58:58,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 107 transitions. [2018-11-23 09:58:58,207 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 107 transitions. Word has length 43 [2018-11-23 09:58:58,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:58,207 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 107 transitions. [2018-11-23 09:58:58,207 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 09:58:58,207 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 107 transitions. [2018-11-23 09:58:58,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 09:58:58,210 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:58,210 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:58,210 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:58,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:58,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1535812089, now seen corresponding path program 4 times [2018-11-23 09:58:58,211 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:58,211 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 09:58:58,240 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:58:58,376 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:58:58,376 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:58,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:58,440 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:59,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {1734#true} call ULTIMATE.init(); {1734#true} is VALID [2018-11-23 09:58:59,366 INFO L273 TraceCheckUtils]: 1: Hoare triple {1734#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1734#true} is VALID [2018-11-23 09:58:59,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {1734#true} assume true; {1734#true} is VALID [2018-11-23 09:58:59,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1734#true} {1734#true} #55#return; {1734#true} is VALID [2018-11-23 09:58:59,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {1734#true} call #t~ret4 := main(); {1734#true} is VALID [2018-11-23 09:58:59,367 INFO L273 TraceCheckUtils]: 5: Hoare triple {1734#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~min~0 := 0bv32;~i~0 := 0bv32; {1754#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:59,368 INFO L273 TraceCheckUtils]: 6: Hoare triple {1754#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1754#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:59,368 INFO L273 TraceCheckUtils]: 7: Hoare triple {1754#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1754#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:59,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {1754#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1764#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,375 INFO L273 TraceCheckUtils]: 9: Hoare triple {1764#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1764#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,375 INFO L273 TraceCheckUtils]: 10: Hoare triple {1764#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1764#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,381 INFO L273 TraceCheckUtils]: 11: Hoare triple {1764#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1774#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:58:59,381 INFO L273 TraceCheckUtils]: 12: Hoare triple {1774#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1774#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:58:59,382 INFO L273 TraceCheckUtils]: 13: Hoare triple {1774#(= (_ bv2 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1774#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:58:59,382 INFO L273 TraceCheckUtils]: 14: Hoare triple {1774#(= (_ bv2 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1784#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,402 INFO L273 TraceCheckUtils]: 15: Hoare triple {1784#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1784#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,411 INFO L273 TraceCheckUtils]: 16: Hoare triple {1784#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1784#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,423 INFO L273 TraceCheckUtils]: 17: Hoare triple {1784#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1794#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:59,423 INFO L273 TraceCheckUtils]: 18: Hoare triple {1794#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1794#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:59,424 INFO L273 TraceCheckUtils]: 19: Hoare triple {1794#(= (_ bv4 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1794#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:59,424 INFO L273 TraceCheckUtils]: 20: Hoare triple {1794#(= (_ bv4 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,425 INFO L273 TraceCheckUtils]: 21: Hoare triple {1804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,425 INFO L273 TraceCheckUtils]: 22: Hoare triple {1804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,426 INFO L273 TraceCheckUtils]: 23: Hoare triple {1804#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1814#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,427 INFO L273 TraceCheckUtils]: 24: Hoare triple {1814#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1814#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,427 INFO L273 TraceCheckUtils]: 25: Hoare triple {1814#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1814#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,429 INFO L273 TraceCheckUtils]: 26: Hoare triple {1814#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1824#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,429 INFO L273 TraceCheckUtils]: 27: Hoare triple {1824#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1824#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,430 INFO L273 TraceCheckUtils]: 28: Hoare triple {1824#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1824#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,430 INFO L273 TraceCheckUtils]: 29: Hoare triple {1824#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1834#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,431 INFO L273 TraceCheckUtils]: 30: Hoare triple {1834#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1834#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,433 INFO L273 TraceCheckUtils]: 31: Hoare triple {1834#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1834#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,434 INFO L273 TraceCheckUtils]: 32: Hoare triple {1834#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1844#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 09:58:59,434 INFO L273 TraceCheckUtils]: 33: Hoare triple {1844#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1844#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 09:58:59,435 INFO L273 TraceCheckUtils]: 34: Hoare triple {1844#(= (_ bv9 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1844#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 09:58:59,436 INFO L273 TraceCheckUtils]: 35: Hoare triple {1844#(= (_ bv9 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1854#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,436 INFO L273 TraceCheckUtils]: 36: Hoare triple {1854#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1854#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,438 INFO L273 TraceCheckUtils]: 37: Hoare triple {1854#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1854#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,438 INFO L273 TraceCheckUtils]: 38: Hoare triple {1854#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1864#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,439 INFO L273 TraceCheckUtils]: 39: Hoare triple {1864#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1864#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,440 INFO L273 TraceCheckUtils]: 40: Hoare triple {1864#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1864#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,440 INFO L273 TraceCheckUtils]: 41: Hoare triple {1864#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1874#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,441 INFO L273 TraceCheckUtils]: 42: Hoare triple {1874#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1874#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,441 INFO L273 TraceCheckUtils]: 43: Hoare triple {1874#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1874#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,442 INFO L273 TraceCheckUtils]: 44: Hoare triple {1874#(= (bvadd main_~i~0 (_ bv4294967284 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1884#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-23 09:58:59,443 INFO L273 TraceCheckUtils]: 45: Hoare triple {1884#(= (_ bv13 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1884#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-23 09:58:59,443 INFO L273 TraceCheckUtils]: 46: Hoare triple {1884#(= (_ bv13 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1884#(= (_ bv13 32) main_~i~0)} is VALID [2018-11-23 09:58:59,444 INFO L273 TraceCheckUtils]: 47: Hoare triple {1884#(= (_ bv13 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1894#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,445 INFO L273 TraceCheckUtils]: 48: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1894#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,446 INFO L273 TraceCheckUtils]: 49: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1894#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,447 INFO L273 TraceCheckUtils]: 50: Hoare triple {1894#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1904#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 09:58:59,448 INFO L273 TraceCheckUtils]: 51: Hoare triple {1904#(= (_ bv15 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1904#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 09:58:59,448 INFO L273 TraceCheckUtils]: 52: Hoare triple {1904#(= (_ bv15 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1904#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 09:58:59,449 INFO L273 TraceCheckUtils]: 53: Hoare triple {1904#(= (_ bv15 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1914#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,450 INFO L273 TraceCheckUtils]: 54: Hoare triple {1914#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1914#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,452 INFO L273 TraceCheckUtils]: 55: Hoare triple {1914#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1914#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,453 INFO L273 TraceCheckUtils]: 56: Hoare triple {1914#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1924#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,453 INFO L273 TraceCheckUtils]: 57: Hoare triple {1924#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1924#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,454 INFO L273 TraceCheckUtils]: 58: Hoare triple {1924#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1924#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,455 INFO L273 TraceCheckUtils]: 59: Hoare triple {1924#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1934#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,458 INFO L273 TraceCheckUtils]: 60: Hoare triple {1934#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1934#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,461 INFO L273 TraceCheckUtils]: 61: Hoare triple {1934#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1934#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,463 INFO L273 TraceCheckUtils]: 62: Hoare triple {1934#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1944#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 09:58:59,463 INFO L273 TraceCheckUtils]: 63: Hoare triple {1944#(= (_ bv19 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1944#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 09:58:59,464 INFO L273 TraceCheckUtils]: 64: Hoare triple {1944#(= (_ bv19 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1944#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 09:58:59,465 INFO L273 TraceCheckUtils]: 65: Hoare triple {1944#(= (_ bv19 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {1954#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,465 INFO L273 TraceCheckUtils]: 66: Hoare triple {1954#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1954#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,466 INFO L273 TraceCheckUtils]: 67: Hoare triple {1954#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1954#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,467 INFO L273 TraceCheckUtils]: 68: Hoare triple {1954#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1964#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,468 INFO L273 TraceCheckUtils]: 69: Hoare triple {1964#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1964#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,468 INFO L273 TraceCheckUtils]: 70: Hoare triple {1964#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {1964#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,469 INFO L273 TraceCheckUtils]: 71: Hoare triple {1964#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {1974#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:59,470 INFO L273 TraceCheckUtils]: 72: Hoare triple {1974#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1735#false} is VALID [2018-11-23 09:58:59,470 INFO L273 TraceCheckUtils]: 73: Hoare triple {1735#false} havoc ~x~0;~x~0 := 0bv32; {1735#false} is VALID [2018-11-23 09:58:59,470 INFO L273 TraceCheckUtils]: 74: Hoare triple {1735#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1735#false} is VALID [2018-11-23 09:58:59,471 INFO L256 TraceCheckUtils]: 75: Hoare triple {1735#false} call __VERIFIER_assert((if ~bvsgt32(#t~mem3, ~min~0) then 1bv32 else 0bv32)); {1735#false} is VALID [2018-11-23 09:58:59,471 INFO L273 TraceCheckUtils]: 76: Hoare triple {1735#false} ~cond := #in~cond; {1735#false} is VALID [2018-11-23 09:58:59,471 INFO L273 TraceCheckUtils]: 77: Hoare triple {1735#false} assume 0bv32 == ~cond; {1735#false} is VALID [2018-11-23 09:58:59,472 INFO L273 TraceCheckUtils]: 78: Hoare triple {1735#false} assume !false; {1735#false} is VALID [2018-11-23 09:58:59,483 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 09:58:59,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:59:01,239 INFO L273 TraceCheckUtils]: 78: Hoare triple {1735#false} assume !false; {1735#false} is VALID [2018-11-23 09:59:01,240 INFO L273 TraceCheckUtils]: 77: Hoare triple {1735#false} assume 0bv32 == ~cond; {1735#false} is VALID [2018-11-23 09:59:01,240 INFO L273 TraceCheckUtils]: 76: Hoare triple {1735#false} ~cond := #in~cond; {1735#false} is VALID [2018-11-23 09:59:01,241 INFO L256 TraceCheckUtils]: 75: Hoare triple {1735#false} call __VERIFIER_assert((if ~bvsgt32(#t~mem3, ~min~0) then 1bv32 else 0bv32)); {1735#false} is VALID [2018-11-23 09:59:01,241 INFO L273 TraceCheckUtils]: 74: Hoare triple {1735#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1735#false} is VALID [2018-11-23 09:59:01,241 INFO L273 TraceCheckUtils]: 73: Hoare triple {1735#false} havoc ~x~0;~x~0 := 0bv32; {1735#false} is VALID [2018-11-23 09:59:01,242 INFO L273 TraceCheckUtils]: 72: Hoare triple {2014#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1735#false} is VALID [2018-11-23 09:59:01,242 INFO L273 TraceCheckUtils]: 71: Hoare triple {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2014#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:59:01,243 INFO L273 TraceCheckUtils]: 70: Hoare triple {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,243 INFO L273 TraceCheckUtils]: 69: Hoare triple {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,247 INFO L273 TraceCheckUtils]: 68: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2018#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,248 INFO L273 TraceCheckUtils]: 67: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,248 INFO L273 TraceCheckUtils]: 66: Hoare triple {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,254 INFO L273 TraceCheckUtils]: 65: Hoare triple {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,255 INFO L273 TraceCheckUtils]: 64: Hoare triple {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,255 INFO L273 TraceCheckUtils]: 63: Hoare triple {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,261 INFO L273 TraceCheckUtils]: 62: Hoare triple {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2038#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,261 INFO L273 TraceCheckUtils]: 61: Hoare triple {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,262 INFO L273 TraceCheckUtils]: 60: Hoare triple {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,268 INFO L273 TraceCheckUtils]: 59: Hoare triple {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2048#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,287 INFO L273 TraceCheckUtils]: 58: Hoare triple {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,288 INFO L273 TraceCheckUtils]: 57: Hoare triple {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,294 INFO L273 TraceCheckUtils]: 56: Hoare triple {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2058#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,294 INFO L273 TraceCheckUtils]: 55: Hoare triple {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,313 INFO L273 TraceCheckUtils]: 54: Hoare triple {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,321 INFO L273 TraceCheckUtils]: 53: Hoare triple {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2068#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,322 INFO L273 TraceCheckUtils]: 52: Hoare triple {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,322 INFO L273 TraceCheckUtils]: 51: Hoare triple {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,328 INFO L273 TraceCheckUtils]: 50: Hoare triple {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2078#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,328 INFO L273 TraceCheckUtils]: 49: Hoare triple {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,328 INFO L273 TraceCheckUtils]: 48: Hoare triple {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,334 INFO L273 TraceCheckUtils]: 47: Hoare triple {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2088#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,335 INFO L273 TraceCheckUtils]: 46: Hoare triple {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,335 INFO L273 TraceCheckUtils]: 45: Hoare triple {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,343 INFO L273 TraceCheckUtils]: 44: Hoare triple {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2098#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,344 INFO L273 TraceCheckUtils]: 43: Hoare triple {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,344 INFO L273 TraceCheckUtils]: 42: Hoare triple {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,352 INFO L273 TraceCheckUtils]: 41: Hoare triple {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2108#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,352 INFO L273 TraceCheckUtils]: 40: Hoare triple {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,353 INFO L273 TraceCheckUtils]: 39: Hoare triple {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,358 INFO L273 TraceCheckUtils]: 38: Hoare triple {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2118#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,359 INFO L273 TraceCheckUtils]: 37: Hoare triple {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,359 INFO L273 TraceCheckUtils]: 36: Hoare triple {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,364 INFO L273 TraceCheckUtils]: 35: Hoare triple {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2128#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,364 INFO L273 TraceCheckUtils]: 34: Hoare triple {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,364 INFO L273 TraceCheckUtils]: 33: Hoare triple {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,369 INFO L273 TraceCheckUtils]: 32: Hoare triple {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2138#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,370 INFO L273 TraceCheckUtils]: 31: Hoare triple {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,370 INFO L273 TraceCheckUtils]: 30: Hoare triple {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,376 INFO L273 TraceCheckUtils]: 29: Hoare triple {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2148#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,376 INFO L273 TraceCheckUtils]: 28: Hoare triple {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,377 INFO L273 TraceCheckUtils]: 27: Hoare triple {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,384 INFO L273 TraceCheckUtils]: 26: Hoare triple {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2158#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,385 INFO L273 TraceCheckUtils]: 25: Hoare triple {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,385 INFO L273 TraceCheckUtils]: 24: Hoare triple {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,389 INFO L273 TraceCheckUtils]: 23: Hoare triple {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2168#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,390 INFO L273 TraceCheckUtils]: 22: Hoare triple {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,390 INFO L273 TraceCheckUtils]: 21: Hoare triple {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2178#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,399 INFO L273 TraceCheckUtils]: 19: Hoare triple {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,400 INFO L273 TraceCheckUtils]: 18: Hoare triple {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,404 INFO L273 TraceCheckUtils]: 17: Hoare triple {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2188#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,404 INFO L273 TraceCheckUtils]: 16: Hoare triple {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,405 INFO L273 TraceCheckUtils]: 15: Hoare triple {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,409 INFO L273 TraceCheckUtils]: 14: Hoare triple {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2198#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,409 INFO L273 TraceCheckUtils]: 13: Hoare triple {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,410 INFO L273 TraceCheckUtils]: 12: Hoare triple {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,415 INFO L273 TraceCheckUtils]: 11: Hoare triple {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2208#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,415 INFO L273 TraceCheckUtils]: 10: Hoare triple {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,415 INFO L273 TraceCheckUtils]: 9: Hoare triple {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,420 INFO L273 TraceCheckUtils]: 8: Hoare triple {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {2218#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,420 INFO L273 TraceCheckUtils]: 7: Hoare triple {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,421 INFO L273 TraceCheckUtils]: 6: Hoare triple {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,421 INFO L273 TraceCheckUtils]: 5: Hoare triple {1734#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~min~0 := 0bv32;~i~0 := 0bv32; {2228#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:01,421 INFO L256 TraceCheckUtils]: 4: Hoare triple {1734#true} call #t~ret4 := main(); {1734#true} is VALID [2018-11-23 09:59:01,422 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1734#true} {1734#true} #55#return; {1734#true} is VALID [2018-11-23 09:59:01,422 INFO L273 TraceCheckUtils]: 2: Hoare triple {1734#true} assume true; {1734#true} is VALID [2018-11-23 09:59:01,422 INFO L273 TraceCheckUtils]: 1: Hoare triple {1734#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1734#true} is VALID [2018-11-23 09:59:01,422 INFO L256 TraceCheckUtils]: 0: Hoare triple {1734#true} call ULTIMATE.init(); {1734#true} is VALID [2018-11-23 09:59:01,430 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 09:59:01,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:59:01,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 09:59:01,433 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 79 [2018-11-23 09:59:01,434 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:59:01,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 09:59:01,822 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:59:01,823 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 09:59:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 09:59:01,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 09:59:01,824 INFO L87 Difference]: Start difference. First operand 84 states and 107 transitions. Second operand 48 states. [2018-11-23 09:59:10,003 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 09:59:10,520 WARN L180 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 09:59:11,067 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 09:59:11,750 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 09:59:12,335 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 09:59:12,957 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 09:59:13,569 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 09:59:14,185 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 09:59:16,383 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 7 [2018-11-23 09:59:20,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:20,906 INFO L93 Difference]: Finished difference Result 167 states and 238 transitions. [2018-11-23 09:59:20,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 09:59:20,906 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 79 [2018-11-23 09:59:20,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:20,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:59:20,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 238 transitions. [2018-11-23 09:59:20,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:59:20,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 238 transitions. [2018-11-23 09:59:20,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 238 transitions. [2018-11-23 09:59:21,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:59:21,403 INFO L225 Difference]: With dead ends: 167 [2018-11-23 09:59:21,403 INFO L226 Difference]: Without dead ends: 156 [2018-11-23 09:59:21,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 09:59:21,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-11-23 09:59:21,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-11-23 09:59:21,466 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:59:21,467 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand 156 states. [2018-11-23 09:59:21,467 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2018-11-23 09:59:21,467 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2018-11-23 09:59:21,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:21,473 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2018-11-23 09:59:21,473 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2018-11-23 09:59:21,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:21,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:21,474 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand 156 states. [2018-11-23 09:59:21,475 INFO L87 Difference]: Start difference. First operand 156 states. Second operand 156 states. [2018-11-23 09:59:21,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:21,481 INFO L93 Difference]: Finished difference Result 156 states and 203 transitions. [2018-11-23 09:59:21,481 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2018-11-23 09:59:21,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:21,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:21,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:59:21,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:59:21,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-11-23 09:59:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 203 transitions. [2018-11-23 09:59:21,488 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 203 transitions. Word has length 79 [2018-11-23 09:59:21,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:21,488 INFO L480 AbstractCegarLoop]: Abstraction has 156 states and 203 transitions. [2018-11-23 09:59:21,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 09:59:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 203 transitions. [2018-11-23 09:59:21,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-11-23 09:59:21,493 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:21,493 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:21,493 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:21,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:21,494 INFO L82 PathProgramCache]: Analyzing trace with hash -1494294791, now seen corresponding path program 5 times [2018-11-23 09:59:21,494 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:59:21,494 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 09:59:21,520 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2018-11-23 09:59:31,430 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2018-11-23 09:59:31,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:59:31,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:31,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:59:33,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {3045#true} call ULTIMATE.init(); {3045#true} is VALID [2018-11-23 09:59:33,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {3045#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3045#true} is VALID [2018-11-23 09:59:33,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {3045#true} assume true; {3045#true} is VALID [2018-11-23 09:59:33,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3045#true} {3045#true} #55#return; {3045#true} is VALID [2018-11-23 09:59:33,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {3045#true} call #t~ret4 := main(); {3045#true} is VALID [2018-11-23 09:59:33,621 INFO L273 TraceCheckUtils]: 5: Hoare triple {3045#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~min~0 := 0bv32;~i~0 := 0bv32; {3065#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:59:33,621 INFO L273 TraceCheckUtils]: 6: Hoare triple {3065#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3065#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:59:33,622 INFO L273 TraceCheckUtils]: 7: Hoare triple {3065#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3065#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:59:33,622 INFO L273 TraceCheckUtils]: 8: Hoare triple {3065#(= main_~i~0 (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3075#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,622 INFO L273 TraceCheckUtils]: 9: Hoare triple {3075#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3075#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,623 INFO L273 TraceCheckUtils]: 10: Hoare triple {3075#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3075#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,623 INFO L273 TraceCheckUtils]: 11: Hoare triple {3075#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3085#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,624 INFO L273 TraceCheckUtils]: 12: Hoare triple {3085#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3085#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,624 INFO L273 TraceCheckUtils]: 13: Hoare triple {3085#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3085#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,624 INFO L273 TraceCheckUtils]: 14: Hoare triple {3085#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3095#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {3095#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3095#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,625 INFO L273 TraceCheckUtils]: 16: Hoare triple {3095#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3095#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,626 INFO L273 TraceCheckUtils]: 17: Hoare triple {3095#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3105#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,626 INFO L273 TraceCheckUtils]: 18: Hoare triple {3105#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3105#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,627 INFO L273 TraceCheckUtils]: 19: Hoare triple {3105#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3105#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,628 INFO L273 TraceCheckUtils]: 20: Hoare triple {3105#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3115#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,628 INFO L273 TraceCheckUtils]: 21: Hoare triple {3115#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3115#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,629 INFO L273 TraceCheckUtils]: 22: Hoare triple {3115#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3115#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,629 INFO L273 TraceCheckUtils]: 23: Hoare triple {3115#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3125#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,630 INFO L273 TraceCheckUtils]: 24: Hoare triple {3125#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3125#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,633 INFO L273 TraceCheckUtils]: 25: Hoare triple {3125#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3125#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,634 INFO L273 TraceCheckUtils]: 26: Hoare triple {3125#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3135#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,635 INFO L273 TraceCheckUtils]: 27: Hoare triple {3135#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3135#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,635 INFO L273 TraceCheckUtils]: 28: Hoare triple {3135#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3135#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,635 INFO L273 TraceCheckUtils]: 29: Hoare triple {3135#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3145#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 09:59:33,636 INFO L273 TraceCheckUtils]: 30: Hoare triple {3145#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3145#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 09:59:33,636 INFO L273 TraceCheckUtils]: 31: Hoare triple {3145#(= (_ bv8 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3145#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 09:59:33,640 INFO L273 TraceCheckUtils]: 32: Hoare triple {3145#(= (_ bv8 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3155#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,641 INFO L273 TraceCheckUtils]: 33: Hoare triple {3155#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3155#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,641 INFO L273 TraceCheckUtils]: 34: Hoare triple {3155#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3155#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,642 INFO L273 TraceCheckUtils]: 35: Hoare triple {3155#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3165#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,642 INFO L273 TraceCheckUtils]: 36: Hoare triple {3165#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3165#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,642 INFO L273 TraceCheckUtils]: 37: Hoare triple {3165#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3165#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,643 INFO L273 TraceCheckUtils]: 38: Hoare triple {3165#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3175#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,643 INFO L273 TraceCheckUtils]: 39: Hoare triple {3175#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3175#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,643 INFO L273 TraceCheckUtils]: 40: Hoare triple {3175#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3175#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,644 INFO L273 TraceCheckUtils]: 41: Hoare triple {3175#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3185#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 09:59:33,644 INFO L273 TraceCheckUtils]: 42: Hoare triple {3185#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3185#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 09:59:33,644 INFO L273 TraceCheckUtils]: 43: Hoare triple {3185#(= (_ bv12 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3185#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 09:59:33,645 INFO L273 TraceCheckUtils]: 44: Hoare triple {3185#(= (_ bv12 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3195#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,646 INFO L273 TraceCheckUtils]: 45: Hoare triple {3195#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3195#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,646 INFO L273 TraceCheckUtils]: 46: Hoare triple {3195#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3195#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,647 INFO L273 TraceCheckUtils]: 47: Hoare triple {3195#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3205#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,647 INFO L273 TraceCheckUtils]: 48: Hoare triple {3205#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3205#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,648 INFO L273 TraceCheckUtils]: 49: Hoare triple {3205#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3205#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,649 INFO L273 TraceCheckUtils]: 50: Hoare triple {3205#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3215#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 09:59:33,649 INFO L273 TraceCheckUtils]: 51: Hoare triple {3215#(= (_ bv15 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3215#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 09:59:33,650 INFO L273 TraceCheckUtils]: 52: Hoare triple {3215#(= (_ bv15 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3215#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 09:59:33,650 INFO L273 TraceCheckUtils]: 53: Hoare triple {3215#(= (_ bv15 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3225#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,651 INFO L273 TraceCheckUtils]: 54: Hoare triple {3225#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3225#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,651 INFO L273 TraceCheckUtils]: 55: Hoare triple {3225#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3225#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,652 INFO L273 TraceCheckUtils]: 56: Hoare triple {3225#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3235#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 09:59:33,653 INFO L273 TraceCheckUtils]: 57: Hoare triple {3235#(= (_ bv17 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3235#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 09:59:33,653 INFO L273 TraceCheckUtils]: 58: Hoare triple {3235#(= (_ bv17 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3235#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 09:59:33,654 INFO L273 TraceCheckUtils]: 59: Hoare triple {3235#(= (_ bv17 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3245#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,654 INFO L273 TraceCheckUtils]: 60: Hoare triple {3245#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3245#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,655 INFO L273 TraceCheckUtils]: 61: Hoare triple {3245#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3245#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,655 INFO L273 TraceCheckUtils]: 62: Hoare triple {3245#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3255#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,656 INFO L273 TraceCheckUtils]: 63: Hoare triple {3255#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3255#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,656 INFO L273 TraceCheckUtils]: 64: Hoare triple {3255#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3255#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,657 INFO L273 TraceCheckUtils]: 65: Hoare triple {3255#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3265#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 09:59:33,658 INFO L273 TraceCheckUtils]: 66: Hoare triple {3265#(= (_ bv20 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3265#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 09:59:33,658 INFO L273 TraceCheckUtils]: 67: Hoare triple {3265#(= (_ bv20 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3265#(= (_ bv20 32) main_~i~0)} is VALID [2018-11-23 09:59:33,659 INFO L273 TraceCheckUtils]: 68: Hoare triple {3265#(= (_ bv20 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3275#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,660 INFO L273 TraceCheckUtils]: 69: Hoare triple {3275#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3275#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,660 INFO L273 TraceCheckUtils]: 70: Hoare triple {3275#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3275#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,661 INFO L273 TraceCheckUtils]: 71: Hoare triple {3275#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3285#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,661 INFO L273 TraceCheckUtils]: 72: Hoare triple {3285#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3285#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,662 INFO L273 TraceCheckUtils]: 73: Hoare triple {3285#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3285#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,663 INFO L273 TraceCheckUtils]: 74: Hoare triple {3285#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3295#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,663 INFO L273 TraceCheckUtils]: 75: Hoare triple {3295#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3295#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,664 INFO L273 TraceCheckUtils]: 76: Hoare triple {3295#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3295#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,665 INFO L273 TraceCheckUtils]: 77: Hoare triple {3295#(= (bvadd main_~i~0 (_ bv4294967273 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3305#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,665 INFO L273 TraceCheckUtils]: 78: Hoare triple {3305#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3305#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,666 INFO L273 TraceCheckUtils]: 79: Hoare triple {3305#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3305#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,666 INFO L273 TraceCheckUtils]: 80: Hoare triple {3305#(= (bvadd main_~i~0 (_ bv4294967272 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3315#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,667 INFO L273 TraceCheckUtils]: 81: Hoare triple {3315#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3315#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,667 INFO L273 TraceCheckUtils]: 82: Hoare triple {3315#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3315#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,668 INFO L273 TraceCheckUtils]: 83: Hoare triple {3315#(= (bvadd main_~i~0 (_ bv4294967271 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3325#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,668 INFO L273 TraceCheckUtils]: 84: Hoare triple {3325#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3325#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,669 INFO L273 TraceCheckUtils]: 85: Hoare triple {3325#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3325#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,670 INFO L273 TraceCheckUtils]: 86: Hoare triple {3325#(= (bvadd main_~i~0 (_ bv4294967270 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3335#(= (_ bv27 32) main_~i~0)} is VALID [2018-11-23 09:59:33,670 INFO L273 TraceCheckUtils]: 87: Hoare triple {3335#(= (_ bv27 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3335#(= (_ bv27 32) main_~i~0)} is VALID [2018-11-23 09:59:33,671 INFO L273 TraceCheckUtils]: 88: Hoare triple {3335#(= (_ bv27 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3335#(= (_ bv27 32) main_~i~0)} is VALID [2018-11-23 09:59:33,671 INFO L273 TraceCheckUtils]: 89: Hoare triple {3335#(= (_ bv27 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3345#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,672 INFO L273 TraceCheckUtils]: 90: Hoare triple {3345#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3345#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,673 INFO L273 TraceCheckUtils]: 91: Hoare triple {3345#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3345#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,673 INFO L273 TraceCheckUtils]: 92: Hoare triple {3345#(= (bvadd main_~i~0 (_ bv4294967268 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3355#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 09:59:33,674 INFO L273 TraceCheckUtils]: 93: Hoare triple {3355#(= (_ bv29 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3355#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 09:59:33,674 INFO L273 TraceCheckUtils]: 94: Hoare triple {3355#(= (_ bv29 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3355#(= (_ bv29 32) main_~i~0)} is VALID [2018-11-23 09:59:33,675 INFO L273 TraceCheckUtils]: 95: Hoare triple {3355#(= (_ bv29 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3365#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,676 INFO L273 TraceCheckUtils]: 96: Hoare triple {3365#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3365#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,676 INFO L273 TraceCheckUtils]: 97: Hoare triple {3365#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3365#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,677 INFO L273 TraceCheckUtils]: 98: Hoare triple {3365#(= (bvadd main_~i~0 (_ bv4294967266 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3375#(= (_ bv31 32) main_~i~0)} is VALID [2018-11-23 09:59:33,677 INFO L273 TraceCheckUtils]: 99: Hoare triple {3375#(= (_ bv31 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3375#(= (_ bv31 32) main_~i~0)} is VALID [2018-11-23 09:59:33,678 INFO L273 TraceCheckUtils]: 100: Hoare triple {3375#(= (_ bv31 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3375#(= (_ bv31 32) main_~i~0)} is VALID [2018-11-23 09:59:33,678 INFO L273 TraceCheckUtils]: 101: Hoare triple {3375#(= (_ bv31 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3385#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,679 INFO L273 TraceCheckUtils]: 102: Hoare triple {3385#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3385#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,679 INFO L273 TraceCheckUtils]: 103: Hoare triple {3385#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3385#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,680 INFO L273 TraceCheckUtils]: 104: Hoare triple {3385#(= (bvadd main_~i~0 (_ bv4294967264 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3395#(= (_ bv33 32) main_~i~0)} is VALID [2018-11-23 09:59:33,681 INFO L273 TraceCheckUtils]: 105: Hoare triple {3395#(= (_ bv33 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3395#(= (_ bv33 32) main_~i~0)} is VALID [2018-11-23 09:59:33,681 INFO L273 TraceCheckUtils]: 106: Hoare triple {3395#(= (_ bv33 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3395#(= (_ bv33 32) main_~i~0)} is VALID [2018-11-23 09:59:33,682 INFO L273 TraceCheckUtils]: 107: Hoare triple {3395#(= (_ bv33 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3405#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,682 INFO L273 TraceCheckUtils]: 108: Hoare triple {3405#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3405#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,683 INFO L273 TraceCheckUtils]: 109: Hoare triple {3405#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3405#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,683 INFO L273 TraceCheckUtils]: 110: Hoare triple {3405#(= (bvadd main_~i~0 (_ bv4294967262 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3415#(= (bvadd main_~i~0 (_ bv4294967261 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,684 INFO L273 TraceCheckUtils]: 111: Hoare triple {3415#(= (bvadd main_~i~0 (_ bv4294967261 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3415#(= (bvadd main_~i~0 (_ bv4294967261 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,685 INFO L273 TraceCheckUtils]: 112: Hoare triple {3415#(= (bvadd main_~i~0 (_ bv4294967261 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3415#(= (bvadd main_~i~0 (_ bv4294967261 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,685 INFO L273 TraceCheckUtils]: 113: Hoare triple {3415#(= (bvadd main_~i~0 (_ bv4294967261 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3425#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,686 INFO L273 TraceCheckUtils]: 114: Hoare triple {3425#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3425#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,686 INFO L273 TraceCheckUtils]: 115: Hoare triple {3425#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3425#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,687 INFO L273 TraceCheckUtils]: 116: Hoare triple {3425#(= (bvadd main_~i~0 (_ bv4294967260 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3435#(= (_ bv37 32) main_~i~0)} is VALID [2018-11-23 09:59:33,687 INFO L273 TraceCheckUtils]: 117: Hoare triple {3435#(= (_ bv37 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3435#(= (_ bv37 32) main_~i~0)} is VALID [2018-11-23 09:59:33,688 INFO L273 TraceCheckUtils]: 118: Hoare triple {3435#(= (_ bv37 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3435#(= (_ bv37 32) main_~i~0)} is VALID [2018-11-23 09:59:33,689 INFO L273 TraceCheckUtils]: 119: Hoare triple {3435#(= (_ bv37 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3445#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,689 INFO L273 TraceCheckUtils]: 120: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3445#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,690 INFO L273 TraceCheckUtils]: 121: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3445#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,691 INFO L273 TraceCheckUtils]: 122: Hoare triple {3445#(= (bvadd main_~i~0 (_ bv4294967258 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3455#(= (bvadd main_~i~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,691 INFO L273 TraceCheckUtils]: 123: Hoare triple {3455#(= (bvadd main_~i~0 (_ bv4294967257 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3455#(= (bvadd main_~i~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,692 INFO L273 TraceCheckUtils]: 124: Hoare triple {3455#(= (bvadd main_~i~0 (_ bv4294967257 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3455#(= (bvadd main_~i~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,692 INFO L273 TraceCheckUtils]: 125: Hoare triple {3455#(= (bvadd main_~i~0 (_ bv4294967257 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3465#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,693 INFO L273 TraceCheckUtils]: 126: Hoare triple {3465#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3465#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,694 INFO L273 TraceCheckUtils]: 127: Hoare triple {3465#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3465#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,694 INFO L273 TraceCheckUtils]: 128: Hoare triple {3465#(= (bvadd main_~i~0 (_ bv4294967256 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3475#(= (_ bv41 32) main_~i~0)} is VALID [2018-11-23 09:59:33,695 INFO L273 TraceCheckUtils]: 129: Hoare triple {3475#(= (_ bv41 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3475#(= (_ bv41 32) main_~i~0)} is VALID [2018-11-23 09:59:33,695 INFO L273 TraceCheckUtils]: 130: Hoare triple {3475#(= (_ bv41 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3475#(= (_ bv41 32) main_~i~0)} is VALID [2018-11-23 09:59:33,696 INFO L273 TraceCheckUtils]: 131: Hoare triple {3475#(= (_ bv41 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3485#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,697 INFO L273 TraceCheckUtils]: 132: Hoare triple {3485#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3485#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,697 INFO L273 TraceCheckUtils]: 133: Hoare triple {3485#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3485#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,698 INFO L273 TraceCheckUtils]: 134: Hoare triple {3485#(= (bvadd main_~i~0 (_ bv4294967254 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3495#(= (_ bv43 32) main_~i~0)} is VALID [2018-11-23 09:59:33,699 INFO L273 TraceCheckUtils]: 135: Hoare triple {3495#(= (_ bv43 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3495#(= (_ bv43 32) main_~i~0)} is VALID [2018-11-23 09:59:33,699 INFO L273 TraceCheckUtils]: 136: Hoare triple {3495#(= (_ bv43 32) main_~i~0)} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3495#(= (_ bv43 32) main_~i~0)} is VALID [2018-11-23 09:59:33,700 INFO L273 TraceCheckUtils]: 137: Hoare triple {3495#(= (_ bv43 32) main_~i~0)} ~i~0 := ~bvadd32(1bv32, ~i~0); {3505#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,700 INFO L273 TraceCheckUtils]: 138: Hoare triple {3505#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3505#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,701 INFO L273 TraceCheckUtils]: 139: Hoare triple {3505#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3505#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,702 INFO L273 TraceCheckUtils]: 140: Hoare triple {3505#(= (bvadd main_~i~0 (_ bv4294967252 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3515#(= (bvadd main_~i~0 (_ bv4294967251 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,702 INFO L273 TraceCheckUtils]: 141: Hoare triple {3515#(= (bvadd main_~i~0 (_ bv4294967251 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3515#(= (bvadd main_~i~0 (_ bv4294967251 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,703 INFO L273 TraceCheckUtils]: 142: Hoare triple {3515#(= (bvadd main_~i~0 (_ bv4294967251 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3515#(= (bvadd main_~i~0 (_ bv4294967251 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,703 INFO L273 TraceCheckUtils]: 143: Hoare triple {3515#(= (bvadd main_~i~0 (_ bv4294967251 32)) (_ bv0 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3525#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:33,704 INFO L273 TraceCheckUtils]: 144: Hoare triple {3525#(= (bvadd main_~i~0 (_ bv4294967250 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3046#false} is VALID [2018-11-23 09:59:33,704 INFO L273 TraceCheckUtils]: 145: Hoare triple {3046#false} havoc ~x~0;~x~0 := 0bv32; {3046#false} is VALID [2018-11-23 09:59:33,705 INFO L273 TraceCheckUtils]: 146: Hoare triple {3046#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3046#false} is VALID [2018-11-23 09:59:33,705 INFO L256 TraceCheckUtils]: 147: Hoare triple {3046#false} call __VERIFIER_assert((if ~bvsgt32(#t~mem3, ~min~0) then 1bv32 else 0bv32)); {3046#false} is VALID [2018-11-23 09:59:33,705 INFO L273 TraceCheckUtils]: 148: Hoare triple {3046#false} ~cond := #in~cond; {3046#false} is VALID [2018-11-23 09:59:33,705 INFO L273 TraceCheckUtils]: 149: Hoare triple {3046#false} assume 0bv32 == ~cond; {3046#false} is VALID [2018-11-23 09:59:33,706 INFO L273 TraceCheckUtils]: 150: Hoare triple {3046#false} assume !false; {3046#false} is VALID [2018-11-23 09:59:33,743 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 09:59:33,743 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:59:40,952 INFO L273 TraceCheckUtils]: 150: Hoare triple {3046#false} assume !false; {3046#false} is VALID [2018-11-23 09:59:40,952 INFO L273 TraceCheckUtils]: 149: Hoare triple {3046#false} assume 0bv32 == ~cond; {3046#false} is VALID [2018-11-23 09:59:40,953 INFO L273 TraceCheckUtils]: 148: Hoare triple {3046#false} ~cond := #in~cond; {3046#false} is VALID [2018-11-23 09:59:40,953 INFO L256 TraceCheckUtils]: 147: Hoare triple {3046#false} call __VERIFIER_assert((if ~bvsgt32(#t~mem3, ~min~0) then 1bv32 else 0bv32)); {3046#false} is VALID [2018-11-23 09:59:40,953 INFO L273 TraceCheckUtils]: 146: Hoare triple {3046#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3046#false} is VALID [2018-11-23 09:59:40,953 INFO L273 TraceCheckUtils]: 145: Hoare triple {3046#false} havoc ~x~0;~x~0 := 0bv32; {3046#false} is VALID [2018-11-23 09:59:40,954 INFO L273 TraceCheckUtils]: 144: Hoare triple {3565#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3046#false} is VALID [2018-11-23 09:59:40,954 INFO L273 TraceCheckUtils]: 143: Hoare triple {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3565#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:59:40,954 INFO L273 TraceCheckUtils]: 142: Hoare triple {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:40,968 INFO L273 TraceCheckUtils]: 141: Hoare triple {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:40,972 INFO L273 TraceCheckUtils]: 140: Hoare triple {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3569#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:40,979 INFO L273 TraceCheckUtils]: 139: Hoare triple {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:40,979 INFO L273 TraceCheckUtils]: 138: Hoare triple {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:40,986 INFO L273 TraceCheckUtils]: 137: Hoare triple {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3579#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:40,987 INFO L273 TraceCheckUtils]: 136: Hoare triple {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:40,987 INFO L273 TraceCheckUtils]: 135: Hoare triple {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:40,993 INFO L273 TraceCheckUtils]: 134: Hoare triple {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3589#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:40,993 INFO L273 TraceCheckUtils]: 133: Hoare triple {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:40,993 INFO L273 TraceCheckUtils]: 132: Hoare triple {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:40,999 INFO L273 TraceCheckUtils]: 131: Hoare triple {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3599#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:40,999 INFO L273 TraceCheckUtils]: 130: Hoare triple {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:40,999 INFO L273 TraceCheckUtils]: 129: Hoare triple {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,006 INFO L273 TraceCheckUtils]: 128: Hoare triple {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3609#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,006 INFO L273 TraceCheckUtils]: 127: Hoare triple {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,010 INFO L273 TraceCheckUtils]: 126: Hoare triple {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,018 INFO L273 TraceCheckUtils]: 125: Hoare triple {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3619#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,019 INFO L273 TraceCheckUtils]: 124: Hoare triple {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,019 INFO L273 TraceCheckUtils]: 123: Hoare triple {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,024 INFO L273 TraceCheckUtils]: 122: Hoare triple {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3629#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,025 INFO L273 TraceCheckUtils]: 121: Hoare triple {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,025 INFO L273 TraceCheckUtils]: 120: Hoare triple {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,032 INFO L273 TraceCheckUtils]: 119: Hoare triple {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3639#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,032 INFO L273 TraceCheckUtils]: 118: Hoare triple {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,038 INFO L273 TraceCheckUtils]: 117: Hoare triple {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,044 INFO L273 TraceCheckUtils]: 116: Hoare triple {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3649#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,045 INFO L273 TraceCheckUtils]: 115: Hoare triple {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,045 INFO L273 TraceCheckUtils]: 114: Hoare triple {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,053 INFO L273 TraceCheckUtils]: 113: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3659#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,054 INFO L273 TraceCheckUtils]: 112: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,054 INFO L273 TraceCheckUtils]: 111: Hoare triple {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,059 INFO L273 TraceCheckUtils]: 110: Hoare triple {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3669#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,059 INFO L273 TraceCheckUtils]: 109: Hoare triple {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,060 INFO L273 TraceCheckUtils]: 108: Hoare triple {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,064 INFO L273 TraceCheckUtils]: 107: Hoare triple {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3679#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,065 INFO L273 TraceCheckUtils]: 106: Hoare triple {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,065 INFO L273 TraceCheckUtils]: 105: Hoare triple {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,069 INFO L273 TraceCheckUtils]: 104: Hoare triple {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3689#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,070 INFO L273 TraceCheckUtils]: 103: Hoare triple {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,070 INFO L273 TraceCheckUtils]: 102: Hoare triple {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,076 INFO L273 TraceCheckUtils]: 101: Hoare triple {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3699#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,076 INFO L273 TraceCheckUtils]: 100: Hoare triple {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,076 INFO L273 TraceCheckUtils]: 99: Hoare triple {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,081 INFO L273 TraceCheckUtils]: 98: Hoare triple {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3709#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,082 INFO L273 TraceCheckUtils]: 97: Hoare triple {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,082 INFO L273 TraceCheckUtils]: 96: Hoare triple {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,086 INFO L273 TraceCheckUtils]: 95: Hoare triple {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3719#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,086 INFO L273 TraceCheckUtils]: 94: Hoare triple {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,087 INFO L273 TraceCheckUtils]: 93: Hoare triple {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,094 INFO L273 TraceCheckUtils]: 92: Hoare triple {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3729#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,094 INFO L273 TraceCheckUtils]: 91: Hoare triple {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,094 INFO L273 TraceCheckUtils]: 90: Hoare triple {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,098 INFO L273 TraceCheckUtils]: 89: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3739#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,099 INFO L273 TraceCheckUtils]: 88: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,099 INFO L273 TraceCheckUtils]: 87: Hoare triple {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,103 INFO L273 TraceCheckUtils]: 86: Hoare triple {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3749#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,104 INFO L273 TraceCheckUtils]: 85: Hoare triple {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,104 INFO L273 TraceCheckUtils]: 84: Hoare triple {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,112 INFO L273 TraceCheckUtils]: 83: Hoare triple {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3759#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,113 INFO L273 TraceCheckUtils]: 82: Hoare triple {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,113 INFO L273 TraceCheckUtils]: 81: Hoare triple {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,118 INFO L273 TraceCheckUtils]: 80: Hoare triple {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3769#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,119 INFO L273 TraceCheckUtils]: 79: Hoare triple {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,119 INFO L273 TraceCheckUtils]: 78: Hoare triple {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,125 INFO L273 TraceCheckUtils]: 77: Hoare triple {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3779#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,126 INFO L273 TraceCheckUtils]: 76: Hoare triple {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,126 INFO L273 TraceCheckUtils]: 75: Hoare triple {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,132 INFO L273 TraceCheckUtils]: 74: Hoare triple {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3789#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,132 INFO L273 TraceCheckUtils]: 73: Hoare triple {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,132 INFO L273 TraceCheckUtils]: 72: Hoare triple {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,138 INFO L273 TraceCheckUtils]: 71: Hoare triple {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3799#(bvslt (bvadd main_~i~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,139 INFO L273 TraceCheckUtils]: 70: Hoare triple {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,139 INFO L273 TraceCheckUtils]: 69: Hoare triple {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,146 INFO L273 TraceCheckUtils]: 68: Hoare triple {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3809#(bvslt (bvadd main_~i~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,147 INFO L273 TraceCheckUtils]: 67: Hoare triple {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,147 INFO L273 TraceCheckUtils]: 66: Hoare triple {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,151 INFO L273 TraceCheckUtils]: 65: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3819#(bvslt (bvadd main_~i~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,152 INFO L273 TraceCheckUtils]: 64: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,152 INFO L273 TraceCheckUtils]: 63: Hoare triple {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,157 INFO L273 TraceCheckUtils]: 62: Hoare triple {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3829#(bvslt (bvadd main_~i~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,158 INFO L273 TraceCheckUtils]: 61: Hoare triple {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,158 INFO L273 TraceCheckUtils]: 60: Hoare triple {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,164 INFO L273 TraceCheckUtils]: 59: Hoare triple {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3839#(bvslt (bvadd main_~i~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,164 INFO L273 TraceCheckUtils]: 58: Hoare triple {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,165 INFO L273 TraceCheckUtils]: 57: Hoare triple {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,170 INFO L273 TraceCheckUtils]: 56: Hoare triple {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3849#(bvslt (bvadd main_~i~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,171 INFO L273 TraceCheckUtils]: 55: Hoare triple {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,171 INFO L273 TraceCheckUtils]: 54: Hoare triple {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,178 INFO L273 TraceCheckUtils]: 53: Hoare triple {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3859#(bvslt (bvadd main_~i~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,179 INFO L273 TraceCheckUtils]: 52: Hoare triple {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,179 INFO L273 TraceCheckUtils]: 51: Hoare triple {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,185 INFO L273 TraceCheckUtils]: 50: Hoare triple {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3869#(bvslt (bvadd main_~i~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,186 INFO L273 TraceCheckUtils]: 49: Hoare triple {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,186 INFO L273 TraceCheckUtils]: 48: Hoare triple {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,192 INFO L273 TraceCheckUtils]: 47: Hoare triple {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3879#(bvslt (bvadd main_~i~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,193 INFO L273 TraceCheckUtils]: 46: Hoare triple {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,193 INFO L273 TraceCheckUtils]: 45: Hoare triple {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,198 INFO L273 TraceCheckUtils]: 44: Hoare triple {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3889#(bvslt (bvadd main_~i~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,199 INFO L273 TraceCheckUtils]: 43: Hoare triple {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,199 INFO L273 TraceCheckUtils]: 42: Hoare triple {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,203 INFO L273 TraceCheckUtils]: 41: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3899#(bvslt (bvadd main_~i~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,204 INFO L273 TraceCheckUtils]: 40: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,204 INFO L273 TraceCheckUtils]: 39: Hoare triple {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,209 INFO L273 TraceCheckUtils]: 38: Hoare triple {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3909#(bvslt (bvadd main_~i~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,209 INFO L273 TraceCheckUtils]: 37: Hoare triple {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,210 INFO L273 TraceCheckUtils]: 36: Hoare triple {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,218 INFO L273 TraceCheckUtils]: 35: Hoare triple {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3919#(bvslt (bvadd main_~i~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,219 INFO L273 TraceCheckUtils]: 34: Hoare triple {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,219 INFO L273 TraceCheckUtils]: 33: Hoare triple {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,226 INFO L273 TraceCheckUtils]: 32: Hoare triple {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3929#(bvslt (bvadd main_~i~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,226 INFO L273 TraceCheckUtils]: 31: Hoare triple {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,227 INFO L273 TraceCheckUtils]: 30: Hoare triple {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,232 INFO L273 TraceCheckUtils]: 29: Hoare triple {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3939#(bvslt (bvadd main_~i~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,233 INFO L273 TraceCheckUtils]: 28: Hoare triple {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,233 INFO L273 TraceCheckUtils]: 27: Hoare triple {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3949#(bvslt (bvadd main_~i~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,239 INFO L273 TraceCheckUtils]: 25: Hoare triple {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,239 INFO L273 TraceCheckUtils]: 24: Hoare triple {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,245 INFO L273 TraceCheckUtils]: 23: Hoare triple {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3959#(bvslt (bvadd main_~i~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,246 INFO L273 TraceCheckUtils]: 22: Hoare triple {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,246 INFO L273 TraceCheckUtils]: 21: Hoare triple {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,253 INFO L273 TraceCheckUtils]: 20: Hoare triple {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3969#(bvslt (bvadd main_~i~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,254 INFO L273 TraceCheckUtils]: 19: Hoare triple {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,254 INFO L273 TraceCheckUtils]: 18: Hoare triple {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,260 INFO L273 TraceCheckUtils]: 17: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3979#(bvslt (bvadd main_~i~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,261 INFO L273 TraceCheckUtils]: 16: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,266 INFO L273 TraceCheckUtils]: 14: Hoare triple {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3989#(bvslt (bvadd main_~i~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,267 INFO L273 TraceCheckUtils]: 13: Hoare triple {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,267 INFO L273 TraceCheckUtils]: 12: Hoare triple {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,272 INFO L273 TraceCheckUtils]: 11: Hoare triple {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {3999#(bvslt (bvadd main_~i~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,272 INFO L273 TraceCheckUtils]: 10: Hoare triple {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,273 INFO L273 TraceCheckUtils]: 9: Hoare triple {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,279 INFO L273 TraceCheckUtils]: 8: Hoare triple {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} ~i~0 := ~bvadd32(1bv32, ~i~0); {4009#(bvslt (bvadd main_~i~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,279 INFO L273 TraceCheckUtils]: 7: Hoare triple {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, ~min~0);havoc #t~mem0;call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~min~0 := #t~mem1;havoc #t~mem1; {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,279 INFO L273 TraceCheckUtils]: 6: Hoare triple {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,280 INFO L273 TraceCheckUtils]: 5: Hoare triple {3045#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~min~0 := 0bv32;~i~0 := 0bv32; {4019#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:41,280 INFO L256 TraceCheckUtils]: 4: Hoare triple {3045#true} call #t~ret4 := main(); {3045#true} is VALID [2018-11-23 09:59:41,280 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3045#true} {3045#true} #55#return; {3045#true} is VALID [2018-11-23 09:59:41,280 INFO L273 TraceCheckUtils]: 2: Hoare triple {3045#true} assume true; {3045#true} is VALID [2018-11-23 09:59:41,281 INFO L273 TraceCheckUtils]: 1: Hoare triple {3045#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3045#true} is VALID [2018-11-23 09:59:41,281 INFO L256 TraceCheckUtils]: 0: Hoare triple {3045#true} call ULTIMATE.init(); {3045#true} is VALID [2018-11-23 09:59:41,310 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 09:59:41,313 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:59:41,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49] total 96 [2018-11-23 09:59:41,314 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 151 [2018-11-23 09:59:41,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:59:41,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states. [2018-11-23 09:59:42,079 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:59:42,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-11-23 09:59:42,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-11-23 09:59:42,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2398, Invalid=6722, Unknown=0, NotChecked=0, Total=9120 [2018-11-23 09:59:42,084 INFO L87 Difference]: Start difference. First operand 156 states and 203 transitions. Second operand 96 states. [2018-11-23 10:00:12,211 WARN L180 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 7 [2018-11-23 10:00:14,238 WARN L180 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 7 [2018-11-23 10:00:16,519 WARN L180 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 7 [2018-11-23 10:00:18,830 WARN L180 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 7 [2018-11-23 10:00:21,289 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 7 [2018-11-23 10:00:23,871 WARN L180 SmtUtils]: Spent 390.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 7 [2018-11-23 10:00:26,475 WARN L180 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 7 [2018-11-23 10:00:29,233 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 7 [2018-11-23 10:00:31,958 WARN L180 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 7 [2018-11-23 10:00:34,893 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 7 [2018-11-23 10:00:37,659 WARN L180 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 7 [2018-11-23 10:00:40,443 WARN L180 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 7 [2018-11-23 10:00:43,093 WARN L180 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 7 [2018-11-23 10:00:45,940 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 7 [2018-11-23 10:00:48,688 WARN L180 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 7 [2018-11-23 10:00:51,662 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 7 [2018-11-23 10:00:54,463 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 7 [2018-11-23 10:00:57,273 WARN L180 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 7 [2018-11-23 10:01:00,049 WARN L180 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 7 [2018-11-23 10:01:02,850 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 7 [2018-11-23 10:01:05,652 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 7 [2018-11-23 10:01:08,393 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 7 [2018-11-23 10:01:11,055 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 7 [2018-11-23 10:01:13,610 WARN L180 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 7 [2018-11-23 10:01:16,077 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:01:18,472 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:01:20,849 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:01:23,136 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:01:25,269 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:01:27,339 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:01:29,298 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:01:31,269 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-23 10:01:33,278 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 7 [2018-11-23 10:01:47,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:47,528 INFO L93 Difference]: Finished difference Result 311 states and 454 transitions. [2018-11-23 10:01:47,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-11-23 10:01:47,529 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 151 [2018-11-23 10:01:47,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:01:47,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 10:01:47,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 454 transitions. [2018-11-23 10:01:47,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 10:01:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 454 transitions. [2018-11-23 10:01:47,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states and 454 transitions. [2018-11-23 10:01:48,710 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 454 edges. 454 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:01:48,717 INFO L225 Difference]: With dead ends: 311 [2018-11-23 10:01:48,717 INFO L226 Difference]: Without dead ends: 300 [2018-11-23 10:01:48,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 100.3s TimeCoverageRelationStatistics Valid=6814, Invalid=13208, Unknown=0, NotChecked=0, Total=20022 [2018-11-23 10:01:48,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-11-23 10:01:48,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 300. [2018-11-23 10:01:48,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:01:48,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 300 states. Second operand 300 states. [2018-11-23 10:01:48,863 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand 300 states. [2018-11-23 10:01:48,863 INFO L87 Difference]: Start difference. First operand 300 states. Second operand 300 states. [2018-11-23 10:01:48,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:48,876 INFO L93 Difference]: Finished difference Result 300 states and 395 transitions. [2018-11-23 10:01:48,876 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2018-11-23 10:01:48,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:01:48,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:01:48,877 INFO L74 IsIncluded]: Start isIncluded. First operand 300 states. Second operand 300 states. [2018-11-23 10:01:48,877 INFO L87 Difference]: Start difference. First operand 300 states. Second operand 300 states. [2018-11-23 10:01:48,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:01:48,889 INFO L93 Difference]: Finished difference Result 300 states and 395 transitions. [2018-11-23 10:01:48,889 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2018-11-23 10:01:48,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:01:48,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:01:48,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:01:48,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:01:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-11-23 10:01:48,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 395 transitions. [2018-11-23 10:01:48,903 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 395 transitions. Word has length 151 [2018-11-23 10:01:48,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:01:48,903 INFO L480 AbstractCegarLoop]: Abstraction has 300 states and 395 transitions. [2018-11-23 10:01:48,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-11-23 10:01:48,903 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 395 transitions. [2018-11-23 10:01:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-11-23 10:01:48,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:01:48,908 INFO L402 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:01:48,909 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:01:48,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:01:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1624791289, now seen corresponding path program 6 times [2018-11-23 10:01:48,910 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:01:48,910 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:01:48,939 INFO L101 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE