java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy4_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 15:52:53,571 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 15:52:53,574 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 15:52:53,589 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 15:52:53,590 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 15:52:53,591 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 15:52:53,593 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 15:52:53,594 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 15:52:53,596 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 15:52:53,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 15:52:53,598 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 15:52:53,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 15:52:53,599 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 15:52:53,600 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 15:52:53,601 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 15:52:53,602 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 15:52:53,603 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 15:52:53,605 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 15:52:53,607 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 15:52:53,609 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 15:52:53,610 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 15:52:53,611 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 15:52:53,613 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 15:52:53,614 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 15:52:53,614 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 15:52:53,615 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 15:52:53,618 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 15:52:53,618 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 15:52:53,621 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 15:52:53,623 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 15:52:53,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 15:52:53,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 15:52:53,624 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 15:52:53,625 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 15:52:53,626 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 15:52:53,628 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 15:52:53,629 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-14 15:52:53,656 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 15:52:53,656 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 15:52:53,657 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 15:52:53,658 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 15:52:53,658 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 15:52:53,658 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 15:52:53,659 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 15:52:53,659 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 15:52:53,659 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 15:52:53,659 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 15:52:53,659 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 15:52:53,660 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 15:52:53,660 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 15:52:53,660 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 15:52:53,660 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 15:52:53,660 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 15:52:53,660 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 15:52:53,661 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 15:52:53,661 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 15:52:53,661 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 15:52:53,661 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 15:52:53,661 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 15:52:53,662 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 15:52:53,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 15:52:53,662 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 15:52:53,662 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 15:52:53,662 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 15:52:53,663 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 15:52:53,663 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 15:52:53,663 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 15:52:53,663 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 15:52:53,663 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 15:52:53,707 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 15:52:53,726 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 15:52:53,730 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 15:52:53,731 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 15:52:53,732 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 15:52:53,733 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy4_true-unreach-call_ground.i [2018-11-14 15:52:53,796 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e845e32d0/b10f5838f7824958b3e1c762250dbfa8/FLAG337b111ed [2018-11-14 15:52:54,217 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 15:52:54,218 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy4_true-unreach-call_ground.i [2018-11-14 15:52:54,224 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e845e32d0/b10f5838f7824958b3e1c762250dbfa8/FLAG337b111ed [2018-11-14 15:52:54,241 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e845e32d0/b10f5838f7824958b3e1c762250dbfa8 [2018-11-14 15:52:54,251 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 15:52:54,253 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 15:52:54,253 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 15:52:54,254 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 15:52:54,258 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 15:52:54,260 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:52:54" (1/1) ... [2018-11-14 15:52:54,263 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6101ebfb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:54, skipping insertion in model container [2018-11-14 15:52:54,263 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:52:54" (1/1) ... [2018-11-14 15:52:54,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 15:52:54,299 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 15:52:54,534 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:52:54,541 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 15:52:54,577 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:52:54,601 INFO L195 MainTranslator]: Completed translation [2018-11-14 15:52:54,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:54 WrapperNode [2018-11-14 15:52:54,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 15:52:54,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 15:52:54,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 15:52:54,603 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 15:52:54,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:54" (1/1) ... [2018-11-14 15:52:54,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:54" (1/1) ... [2018-11-14 15:52:54,631 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:54" (1/1) ... [2018-11-14 15:52:54,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:54" (1/1) ... [2018-11-14 15:52:54,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:54" (1/1) ... [2018-11-14 15:52:54,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:54" (1/1) ... [2018-11-14 15:52:54,676 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:54" (1/1) ... [2018-11-14 15:52:54,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 15:52:54,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 15:52:54,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 15:52:54,680 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 15:52:54,681 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:54" (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-14 15:52:54,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 15:52:54,810 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 15:52:54,810 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 15:52:54,810 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 15:52:54,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 15:52:54,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 15:52:54,811 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 15:52:54,811 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 15:52:54,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 15:52:54,811 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 15:52:54,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 15:52:54,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 15:52:54,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 15:52:54,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 15:52:54,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 15:52:55,594 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 15:52:55,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:52:55 BoogieIcfgContainer [2018-11-14 15:52:55,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 15:52:55,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 15:52:55,596 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 15:52:55,599 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 15:52:55,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:52:54" (1/3) ... [2018-11-14 15:52:55,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33499677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:52:55, skipping insertion in model container [2018-11-14 15:52:55,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:52:54" (2/3) ... [2018-11-14 15:52:55,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33499677 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:52:55, skipping insertion in model container [2018-11-14 15:52:55,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:52:55" (3/3) ... [2018-11-14 15:52:55,603 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy4_true-unreach-call_ground.i [2018-11-14 15:52:55,610 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 15:52:55,620 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 15:52:55,641 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 15:52:55,683 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 15:52:55,683 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 15:52:55,683 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 15:52:55,684 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 15:52:55,684 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 15:52:55,684 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 15:52:55,684 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 15:52:55,684 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 15:52:55,685 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 15:52:55,703 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-14 15:52:55,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-14 15:52:55,709 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:52:55,710 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:52:55,713 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:52:55,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:52:55,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1721942648, now seen corresponding path program 1 times [2018-11-14 15:52:55,723 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:52:55,723 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-14 15:52:55,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:52:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:55,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:55,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:52:55,927 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-14 15:52:55,931 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-14 15:52:55,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-14 15:52:55,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #111#return; {45#true} is VALID [2018-11-14 15:52:55,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret13 := main(); {45#true} is VALID [2018-11-14 15:52:55,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {45#true} is VALID [2018-11-14 15:52:55,934 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-14 15:52:55,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} havoc ~i~0;~i~0 := 0bv32; {46#false} is VALID [2018-11-14 15:52:55,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 15:52:55,935 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#false} ~i~0 := 0bv32; {46#false} is VALID [2018-11-14 15:52:55,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 15:52:55,936 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~i~0 := 0bv32; {46#false} is VALID [2018-11-14 15:52:55,936 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 15:52:55,937 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} ~i~0 := 0bv32; {46#false} is VALID [2018-11-14 15:52:55,937 INFO L273 TraceCheckUtils]: 14: Hoare triple {46#false} assume !true; {46#false} is VALID [2018-11-14 15:52:55,937 INFO L273 TraceCheckUtils]: 15: Hoare triple {46#false} havoc ~x~0;~x~0 := 0bv32; {46#false} is VALID [2018-11-14 15:52:55,938 INFO L273 TraceCheckUtils]: 16: Hoare triple {46#false} assume true; {46#false} is VALID [2018-11-14 15:52:55,938 INFO L273 TraceCheckUtils]: 17: Hoare triple {46#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {46#false} is VALID [2018-11-14 15:52:55,938 INFO L256 TraceCheckUtils]: 18: Hoare triple {46#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {46#false} is VALID [2018-11-14 15:52:55,939 INFO L273 TraceCheckUtils]: 19: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-14 15:52:55,939 INFO L273 TraceCheckUtils]: 20: Hoare triple {46#false} assume ~cond == 0bv32; {46#false} is VALID [2018-11-14 15:52:55,940 INFO L273 TraceCheckUtils]: 21: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-14 15:52:55,944 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-14 15:52:55,944 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:52:55,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:52:55,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 15:52:55,960 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 15:52:55,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:52:55,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 15:52:56,201 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:52:56,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 15:52:56,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 15:52:56,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 15:52:56,212 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-14 15:52:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:56,396 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2018-11-14 15:52:56,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 15:52:56,397 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-14 15:52:56,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:52:56,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:52:56,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-14 15:52:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:52:56,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 98 transitions. [2018-11-14 15:52:56,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 98 transitions. [2018-11-14 15:52:56,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:52:56,876 INFO L225 Difference]: With dead ends: 75 [2018-11-14 15:52:56,876 INFO L226 Difference]: Without dead ends: 37 [2018-11-14 15:52:56,880 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 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-14 15:52:56,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-14 15:52:57,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-14 15:52:57,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:52:57,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-14 15:52:57,074 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 15:52:57,074 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 15:52:57,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:57,080 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-14 15:52:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 15:52:57,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:57,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:57,082 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-14 15:52:57,082 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-14 15:52:57,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:57,087 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2018-11-14 15:52:57,087 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 15:52:57,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:57,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:57,088 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:52:57,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:52:57,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-14 15:52:57,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2018-11-14 15:52:57,094 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 22 [2018-11-14 15:52:57,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:52:57,095 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2018-11-14 15:52:57,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 15:52:57,095 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2018-11-14 15:52:57,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-14 15:52:57,097 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:52:57,097 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:52:57,097 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:52:57,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:52:57,098 INFO L82 PathProgramCache]: Analyzing trace with hash 20971825, now seen corresponding path program 1 times [2018-11-14 15:52:57,098 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:52:57,099 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-14 15:52:57,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:52:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:57,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:57,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:52:57,388 INFO L256 TraceCheckUtils]: 0: Hoare triple {329#true} call ULTIMATE.init(); {329#true} is VALID [2018-11-14 15:52:57,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {329#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {329#true} is VALID [2018-11-14 15:52:57,389 INFO L273 TraceCheckUtils]: 2: Hoare triple {329#true} assume true; {329#true} is VALID [2018-11-14 15:52:57,390 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {329#true} {329#true} #111#return; {329#true} is VALID [2018-11-14 15:52:57,390 INFO L256 TraceCheckUtils]: 4: Hoare triple {329#true} call #t~ret13 := main(); {329#true} is VALID [2018-11-14 15:52:57,403 INFO L273 TraceCheckUtils]: 5: Hoare triple {329#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {349#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:52:57,419 INFO L273 TraceCheckUtils]: 6: Hoare triple {349#(= main_~a~0 (_ bv0 32))} assume true; {349#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:52:57,433 INFO L273 TraceCheckUtils]: 7: Hoare triple {349#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {330#false} is VALID [2018-11-14 15:52:57,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {330#false} havoc ~i~0;~i~0 := 0bv32; {330#false} is VALID [2018-11-14 15:52:57,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {330#false} assume true; {330#false} is VALID [2018-11-14 15:52:57,434 INFO L273 TraceCheckUtils]: 10: Hoare triple {330#false} assume !~bvslt32(~i~0, 100000bv32); {330#false} is VALID [2018-11-14 15:52:57,435 INFO L273 TraceCheckUtils]: 11: Hoare triple {330#false} ~i~0 := 0bv32; {330#false} is VALID [2018-11-14 15:52:57,435 INFO L273 TraceCheckUtils]: 12: Hoare triple {330#false} assume true; {330#false} is VALID [2018-11-14 15:52:57,435 INFO L273 TraceCheckUtils]: 13: Hoare triple {330#false} assume !~bvslt32(~i~0, 100000bv32); {330#false} is VALID [2018-11-14 15:52:57,436 INFO L273 TraceCheckUtils]: 14: Hoare triple {330#false} ~i~0 := 0bv32; {330#false} is VALID [2018-11-14 15:52:57,436 INFO L273 TraceCheckUtils]: 15: Hoare triple {330#false} assume true; {330#false} is VALID [2018-11-14 15:52:57,436 INFO L273 TraceCheckUtils]: 16: Hoare triple {330#false} assume !~bvslt32(~i~0, 100000bv32); {330#false} is VALID [2018-11-14 15:52:57,437 INFO L273 TraceCheckUtils]: 17: Hoare triple {330#false} ~i~0 := 0bv32; {330#false} is VALID [2018-11-14 15:52:57,437 INFO L273 TraceCheckUtils]: 18: Hoare triple {330#false} assume true; {330#false} is VALID [2018-11-14 15:52:57,437 INFO L273 TraceCheckUtils]: 19: Hoare triple {330#false} assume !~bvslt32(~i~0, 100000bv32); {330#false} is VALID [2018-11-14 15:52:57,438 INFO L273 TraceCheckUtils]: 20: Hoare triple {330#false} havoc ~x~0;~x~0 := 0bv32; {330#false} is VALID [2018-11-14 15:52:57,438 INFO L273 TraceCheckUtils]: 21: Hoare triple {330#false} assume true; {330#false} is VALID [2018-11-14 15:52:57,438 INFO L273 TraceCheckUtils]: 22: Hoare triple {330#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {330#false} is VALID [2018-11-14 15:52:57,439 INFO L256 TraceCheckUtils]: 23: Hoare triple {330#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {330#false} is VALID [2018-11-14 15:52:57,439 INFO L273 TraceCheckUtils]: 24: Hoare triple {330#false} ~cond := #in~cond; {330#false} is VALID [2018-11-14 15:52:57,440 INFO L273 TraceCheckUtils]: 25: Hoare triple {330#false} assume ~cond == 0bv32; {330#false} is VALID [2018-11-14 15:52:57,440 INFO L273 TraceCheckUtils]: 26: Hoare triple {330#false} assume !false; {330#false} is VALID [2018-11-14 15:52:57,443 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-14 15:52:57,443 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:52:57,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:52:57,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 15:52:57,450 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 15:52:57,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:52:57,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 15:52:57,629 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:52:57,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 15:52:57,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 15:52:57,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 15:52:57,630 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 3 states. [2018-11-14 15:52:57,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:57,911 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2018-11-14 15:52:57,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 15:52:57,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-14 15:52:57,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:52:57,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:52:57,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-14 15:52:57,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:52:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 78 transitions. [2018-11-14 15:52:57,919 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 78 transitions. [2018-11-14 15:52:58,091 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:52:58,093 INFO L225 Difference]: With dead ends: 68 [2018-11-14 15:52:58,093 INFO L226 Difference]: Without dead ends: 40 [2018-11-14 15:52:58,095 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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-14 15:52:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-14 15:52:58,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-14 15:52:58,119 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:52:58,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2018-11-14 15:52:58,119 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2018-11-14 15:52:58,119 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2018-11-14 15:52:58,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:58,122 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-14 15:52:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-14 15:52:58,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:58,123 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:58,123 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2018-11-14 15:52:58,123 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2018-11-14 15:52:58,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:58,126 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-14 15:52:58,126 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2018-11-14 15:52:58,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:58,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:58,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:52:58,128 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:52:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-14 15:52:58,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2018-11-14 15:52:58,130 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 27 [2018-11-14 15:52:58,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:52:58,131 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2018-11-14 15:52:58,131 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 15:52:58,131 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2018-11-14 15:52:58,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-14 15:52:58,132 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:52:58,132 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:52:58,133 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:52:58,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:52:58,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1906612018, now seen corresponding path program 1 times [2018-11-14 15:52:58,137 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:52:58,137 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-14 15:52:58,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:52:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:58,215 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:52:58,389 INFO L256 TraceCheckUtils]: 0: Hoare triple {632#true} call ULTIMATE.init(); {632#true} is VALID [2018-11-14 15:52:58,389 INFO L273 TraceCheckUtils]: 1: Hoare triple {632#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {632#true} is VALID [2018-11-14 15:52:58,390 INFO L273 TraceCheckUtils]: 2: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-14 15:52:58,391 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {632#true} {632#true} #111#return; {632#true} is VALID [2018-11-14 15:52:58,391 INFO L256 TraceCheckUtils]: 4: Hoare triple {632#true} call #t~ret13 := main(); {632#true} is VALID [2018-11-14 15:52:58,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {632#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {652#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:52:58,395 INFO L273 TraceCheckUtils]: 6: Hoare triple {652#(= main_~a~0 (_ bv0 32))} assume true; {652#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:52:58,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {652#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {652#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:52:58,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {652#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {662#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:52:58,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {662#(= (_ bv1 32) main_~a~0)} assume true; {662#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:52:58,406 INFO L273 TraceCheckUtils]: 10: Hoare triple {662#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {633#false} is VALID [2018-11-14 15:52:58,406 INFO L273 TraceCheckUtils]: 11: Hoare triple {633#false} havoc ~i~0;~i~0 := 0bv32; {633#false} is VALID [2018-11-14 15:52:58,407 INFO L273 TraceCheckUtils]: 12: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-14 15:52:58,407 INFO L273 TraceCheckUtils]: 13: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-14 15:52:58,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {633#false} ~i~0 := 0bv32; {633#false} is VALID [2018-11-14 15:52:58,407 INFO L273 TraceCheckUtils]: 15: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-14 15:52:58,408 INFO L273 TraceCheckUtils]: 16: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-14 15:52:58,408 INFO L273 TraceCheckUtils]: 17: Hoare triple {633#false} ~i~0 := 0bv32; {633#false} is VALID [2018-11-14 15:52:58,408 INFO L273 TraceCheckUtils]: 18: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-14 15:52:58,409 INFO L273 TraceCheckUtils]: 19: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-14 15:52:58,409 INFO L273 TraceCheckUtils]: 20: Hoare triple {633#false} ~i~0 := 0bv32; {633#false} is VALID [2018-11-14 15:52:58,409 INFO L273 TraceCheckUtils]: 21: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-14 15:52:58,410 INFO L273 TraceCheckUtils]: 22: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-14 15:52:58,410 INFO L273 TraceCheckUtils]: 23: Hoare triple {633#false} havoc ~x~0;~x~0 := 0bv32; {633#false} is VALID [2018-11-14 15:52:58,410 INFO L273 TraceCheckUtils]: 24: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-14 15:52:58,410 INFO L273 TraceCheckUtils]: 25: Hoare triple {633#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {633#false} is VALID [2018-11-14 15:52:58,411 INFO L256 TraceCheckUtils]: 26: Hoare triple {633#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {633#false} is VALID [2018-11-14 15:52:58,411 INFO L273 TraceCheckUtils]: 27: Hoare triple {633#false} ~cond := #in~cond; {633#false} is VALID [2018-11-14 15:52:58,411 INFO L273 TraceCheckUtils]: 28: Hoare triple {633#false} assume ~cond == 0bv32; {633#false} is VALID [2018-11-14 15:52:58,412 INFO L273 TraceCheckUtils]: 29: Hoare triple {633#false} assume !false; {633#false} is VALID [2018-11-14 15:52:58,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:52:58,414 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:52:58,512 INFO L273 TraceCheckUtils]: 29: Hoare triple {633#false} assume !false; {633#false} is VALID [2018-11-14 15:52:58,513 INFO L273 TraceCheckUtils]: 28: Hoare triple {633#false} assume ~cond == 0bv32; {633#false} is VALID [2018-11-14 15:52:58,514 INFO L273 TraceCheckUtils]: 27: Hoare triple {633#false} ~cond := #in~cond; {633#false} is VALID [2018-11-14 15:52:58,514 INFO L256 TraceCheckUtils]: 26: Hoare triple {633#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {633#false} is VALID [2018-11-14 15:52:58,514 INFO L273 TraceCheckUtils]: 25: Hoare triple {633#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {633#false} is VALID [2018-11-14 15:52:58,515 INFO L273 TraceCheckUtils]: 24: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-14 15:52:58,515 INFO L273 TraceCheckUtils]: 23: Hoare triple {633#false} havoc ~x~0;~x~0 := 0bv32; {633#false} is VALID [2018-11-14 15:52:58,515 INFO L273 TraceCheckUtils]: 22: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-14 15:52:58,515 INFO L273 TraceCheckUtils]: 21: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-14 15:52:58,516 INFO L273 TraceCheckUtils]: 20: Hoare triple {633#false} ~i~0 := 0bv32; {633#false} is VALID [2018-11-14 15:52:58,516 INFO L273 TraceCheckUtils]: 19: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-14 15:52:58,516 INFO L273 TraceCheckUtils]: 18: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-14 15:52:58,516 INFO L273 TraceCheckUtils]: 17: Hoare triple {633#false} ~i~0 := 0bv32; {633#false} is VALID [2018-11-14 15:52:58,517 INFO L273 TraceCheckUtils]: 16: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-14 15:52:58,517 INFO L273 TraceCheckUtils]: 15: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-14 15:52:58,517 INFO L273 TraceCheckUtils]: 14: Hoare triple {633#false} ~i~0 := 0bv32; {633#false} is VALID [2018-11-14 15:52:58,518 INFO L273 TraceCheckUtils]: 13: Hoare triple {633#false} assume !~bvslt32(~i~0, 100000bv32); {633#false} is VALID [2018-11-14 15:52:58,518 INFO L273 TraceCheckUtils]: 12: Hoare triple {633#false} assume true; {633#false} is VALID [2018-11-14 15:52:58,518 INFO L273 TraceCheckUtils]: 11: Hoare triple {633#false} havoc ~i~0;~i~0 := 0bv32; {633#false} is VALID [2018-11-14 15:52:58,523 INFO L273 TraceCheckUtils]: 10: Hoare triple {783#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {633#false} is VALID [2018-11-14 15:52:58,524 INFO L273 TraceCheckUtils]: 9: Hoare triple {783#(bvslt main_~a~0 (_ bv100000 32))} assume true; {783#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:52:58,525 INFO L273 TraceCheckUtils]: 8: Hoare triple {790#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {783#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:52:58,526 INFO L273 TraceCheckUtils]: 7: Hoare triple {790#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {790#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:52:58,526 INFO L273 TraceCheckUtils]: 6: Hoare triple {790#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {790#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:52:58,529 INFO L273 TraceCheckUtils]: 5: Hoare triple {632#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {790#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:52:58,529 INFO L256 TraceCheckUtils]: 4: Hoare triple {632#true} call #t~ret13 := main(); {632#true} is VALID [2018-11-14 15:52:58,530 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {632#true} {632#true} #111#return; {632#true} is VALID [2018-11-14 15:52:58,530 INFO L273 TraceCheckUtils]: 2: Hoare triple {632#true} assume true; {632#true} is VALID [2018-11-14 15:52:58,531 INFO L273 TraceCheckUtils]: 1: Hoare triple {632#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {632#true} is VALID [2018-11-14 15:52:58,531 INFO L256 TraceCheckUtils]: 0: Hoare triple {632#true} call ULTIMATE.init(); {632#true} is VALID [2018-11-14 15:52:58,533 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:52:58,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:52:58,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 15:52:58,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-14 15:52:58,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:52:58,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 15:52:58,614 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:52:58,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 15:52:58,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 15:52:58,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 15:52:58,615 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand 6 states. [2018-11-14 15:52:59,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:59,025 INFO L93 Difference]: Finished difference Result 76 states and 88 transitions. [2018-11-14 15:52:59,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 15:52:59,025 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2018-11-14 15:52:59,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:52:59,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:52:59,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2018-11-14 15:52:59,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:52:59,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 88 transitions. [2018-11-14 15:52:59,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 88 transitions. [2018-11-14 15:52:59,163 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:52:59,166 INFO L225 Difference]: With dead ends: 76 [2018-11-14 15:52:59,167 INFO L226 Difference]: Without dead ends: 48 [2018-11-14 15:52:59,167 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 15:52:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-14 15:52:59,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-14 15:52:59,185 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:52:59,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 48 states. [2018-11-14 15:52:59,186 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 15:52:59,186 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 15:52:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:59,189 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-14 15:52:59,189 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-14 15:52:59,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:59,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:59,190 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 48 states. [2018-11-14 15:52:59,190 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 48 states. [2018-11-14 15:52:59,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:59,194 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2018-11-14 15:52:59,194 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-14 15:52:59,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:59,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:59,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:52:59,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:52:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:52:59,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2018-11-14 15:52:59,198 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 30 [2018-11-14 15:52:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:52:59,198 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2018-11-14 15:52:59,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 15:52:59,199 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2018-11-14 15:52:59,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-14 15:52:59,200 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:52:59,200 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:52:59,200 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:52:59,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:52:59,201 INFO L82 PathProgramCache]: Analyzing trace with hash 681615857, now seen corresponding path program 2 times [2018-11-14 15:52:59,201 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:52:59,202 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-14 15:52:59,225 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 15:52:59,263 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 15:52:59,263 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:52:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:52:59,297 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:52:59,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {1078#true} call ULTIMATE.init(); {1078#true} is VALID [2018-11-14 15:52:59,382 INFO L273 TraceCheckUtils]: 1: Hoare triple {1078#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1078#true} is VALID [2018-11-14 15:52:59,382 INFO L273 TraceCheckUtils]: 2: Hoare triple {1078#true} assume true; {1078#true} is VALID [2018-11-14 15:52:59,383 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1078#true} {1078#true} #111#return; {1078#true} is VALID [2018-11-14 15:52:59,383 INFO L256 TraceCheckUtils]: 4: Hoare triple {1078#true} call #t~ret13 := main(); {1078#true} is VALID [2018-11-14 15:52:59,384 INFO L273 TraceCheckUtils]: 5: Hoare triple {1078#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1078#true} is VALID [2018-11-14 15:52:59,384 INFO L273 TraceCheckUtils]: 6: Hoare triple {1078#true} assume true; {1078#true} is VALID [2018-11-14 15:52:59,384 INFO L273 TraceCheckUtils]: 7: Hoare triple {1078#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1078#true} is VALID [2018-11-14 15:52:59,385 INFO L273 TraceCheckUtils]: 8: Hoare triple {1078#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1078#true} is VALID [2018-11-14 15:52:59,385 INFO L273 TraceCheckUtils]: 9: Hoare triple {1078#true} assume true; {1078#true} is VALID [2018-11-14 15:52:59,385 INFO L273 TraceCheckUtils]: 10: Hoare triple {1078#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1078#true} is VALID [2018-11-14 15:52:59,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {1078#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1078#true} is VALID [2018-11-14 15:52:59,385 INFO L273 TraceCheckUtils]: 12: Hoare triple {1078#true} assume true; {1078#true} is VALID [2018-11-14 15:52:59,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {1078#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1078#true} is VALID [2018-11-14 15:52:59,386 INFO L273 TraceCheckUtils]: 14: Hoare triple {1078#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1078#true} is VALID [2018-11-14 15:52:59,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {1078#true} assume true; {1078#true} is VALID [2018-11-14 15:52:59,387 INFO L273 TraceCheckUtils]: 16: Hoare triple {1078#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1078#true} is VALID [2018-11-14 15:52:59,387 INFO L273 TraceCheckUtils]: 17: Hoare triple {1078#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1078#true} is VALID [2018-11-14 15:52:59,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {1078#true} assume true; {1078#true} is VALID [2018-11-14 15:52:59,388 INFO L273 TraceCheckUtils]: 19: Hoare triple {1078#true} assume !~bvslt32(~a~0, 100000bv32); {1078#true} is VALID [2018-11-14 15:52:59,402 INFO L273 TraceCheckUtils]: 20: Hoare triple {1078#true} havoc ~i~0;~i~0 := 0bv32; {1143#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:52:59,405 INFO L273 TraceCheckUtils]: 21: Hoare triple {1143#(= main_~i~0 (_ bv0 32))} assume true; {1143#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:52:59,405 INFO L273 TraceCheckUtils]: 22: Hoare triple {1143#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1079#false} is VALID [2018-11-14 15:52:59,406 INFO L273 TraceCheckUtils]: 23: Hoare triple {1079#false} ~i~0 := 0bv32; {1079#false} is VALID [2018-11-14 15:52:59,406 INFO L273 TraceCheckUtils]: 24: Hoare triple {1079#false} assume true; {1079#false} is VALID [2018-11-14 15:52:59,406 INFO L273 TraceCheckUtils]: 25: Hoare triple {1079#false} assume !~bvslt32(~i~0, 100000bv32); {1079#false} is VALID [2018-11-14 15:52:59,406 INFO L273 TraceCheckUtils]: 26: Hoare triple {1079#false} ~i~0 := 0bv32; {1079#false} is VALID [2018-11-14 15:52:59,407 INFO L273 TraceCheckUtils]: 27: Hoare triple {1079#false} assume true; {1079#false} is VALID [2018-11-14 15:52:59,407 INFO L273 TraceCheckUtils]: 28: Hoare triple {1079#false} assume !~bvslt32(~i~0, 100000bv32); {1079#false} is VALID [2018-11-14 15:52:59,407 INFO L273 TraceCheckUtils]: 29: Hoare triple {1079#false} ~i~0 := 0bv32; {1079#false} is VALID [2018-11-14 15:52:59,407 INFO L273 TraceCheckUtils]: 30: Hoare triple {1079#false} assume true; {1079#false} is VALID [2018-11-14 15:52:59,407 INFO L273 TraceCheckUtils]: 31: Hoare triple {1079#false} assume !~bvslt32(~i~0, 100000bv32); {1079#false} is VALID [2018-11-14 15:52:59,408 INFO L273 TraceCheckUtils]: 32: Hoare triple {1079#false} havoc ~x~0;~x~0 := 0bv32; {1079#false} is VALID [2018-11-14 15:52:59,408 INFO L273 TraceCheckUtils]: 33: Hoare triple {1079#false} assume true; {1079#false} is VALID [2018-11-14 15:52:59,408 INFO L273 TraceCheckUtils]: 34: Hoare triple {1079#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1079#false} is VALID [2018-11-14 15:52:59,408 INFO L256 TraceCheckUtils]: 35: Hoare triple {1079#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {1079#false} is VALID [2018-11-14 15:52:59,409 INFO L273 TraceCheckUtils]: 36: Hoare triple {1079#false} ~cond := #in~cond; {1079#false} is VALID [2018-11-14 15:52:59,409 INFO L273 TraceCheckUtils]: 37: Hoare triple {1079#false} assume ~cond == 0bv32; {1079#false} is VALID [2018-11-14 15:52:59,409 INFO L273 TraceCheckUtils]: 38: Hoare triple {1079#false} assume !false; {1079#false} is VALID [2018-11-14 15:52:59,412 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2018-11-14 15:52:59,412 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:52:59,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:52:59,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 15:52:59,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-14 15:52:59,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:52:59,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 15:52:59,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:52:59,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 15:52:59,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 15:52:59,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 15:52:59,466 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand 3 states. [2018-11-14 15:52:59,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:59,705 INFO L93 Difference]: Finished difference Result 84 states and 96 transitions. [2018-11-14 15:52:59,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 15:52:59,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-11-14 15:52:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:52:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:52:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-14 15:52:59,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:52:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 85 transitions. [2018-11-14 15:52:59,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 85 transitions. [2018-11-14 15:52:59,909 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:52:59,911 INFO L225 Difference]: With dead ends: 84 [2018-11-14 15:52:59,911 INFO L226 Difference]: Without dead ends: 60 [2018-11-14 15:52:59,912 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 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-14 15:52:59,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-14 15:52:59,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2018-11-14 15:52:59,972 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:52:59,972 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand 56 states. [2018-11-14 15:52:59,972 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand 56 states. [2018-11-14 15:52:59,972 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 56 states. [2018-11-14 15:52:59,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:59,975 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-14 15:52:59,975 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-14 15:52:59,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:59,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:59,977 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 60 states. [2018-11-14 15:52:59,977 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 60 states. [2018-11-14 15:52:59,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:52:59,980 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2018-11-14 15:52:59,980 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2018-11-14 15:52:59,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:52:59,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:52:59,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:52:59,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:52:59,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 15:52:59,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2018-11-14 15:52:59,984 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 39 [2018-11-14 15:52:59,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:52:59,985 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2018-11-14 15:52:59,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 15:52:59,985 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2018-11-14 15:52:59,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-11-14 15:52:59,986 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:52:59,987 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:52:59,987 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:52:59,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:52:59,987 INFO L82 PathProgramCache]: Analyzing trace with hash 737548907, now seen corresponding path program 1 times [2018-11-14 15:52:59,988 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:52:59,988 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-14 15:53:00,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 15:53:00,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:53:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:53:00,090 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:53:00,230 INFO L256 TraceCheckUtils]: 0: Hoare triple {1503#true} call ULTIMATE.init(); {1503#true} is VALID [2018-11-14 15:53:00,231 INFO L273 TraceCheckUtils]: 1: Hoare triple {1503#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1503#true} is VALID [2018-11-14 15:53:00,231 INFO L273 TraceCheckUtils]: 2: Hoare triple {1503#true} assume true; {1503#true} is VALID [2018-11-14 15:53:00,231 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} #111#return; {1503#true} is VALID [2018-11-14 15:53:00,231 INFO L256 TraceCheckUtils]: 4: Hoare triple {1503#true} call #t~ret13 := main(); {1503#true} is VALID [2018-11-14 15:53:00,232 INFO L273 TraceCheckUtils]: 5: Hoare triple {1503#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1523#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:53:00,232 INFO L273 TraceCheckUtils]: 6: Hoare triple {1523#(= main_~a~0 (_ bv0 32))} assume true; {1523#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:53:00,237 INFO L273 TraceCheckUtils]: 7: Hoare triple {1523#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1523#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:53:00,238 INFO L273 TraceCheckUtils]: 8: Hoare triple {1523#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1533#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:53:00,238 INFO L273 TraceCheckUtils]: 9: Hoare triple {1533#(= (_ bv1 32) main_~a~0)} assume true; {1533#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:53:00,240 INFO L273 TraceCheckUtils]: 10: Hoare triple {1533#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1533#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:53:00,241 INFO L273 TraceCheckUtils]: 11: Hoare triple {1533#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1543#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:53:00,241 INFO L273 TraceCheckUtils]: 12: Hoare triple {1543#(= (_ bv2 32) main_~a~0)} assume true; {1543#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:53:00,242 INFO L273 TraceCheckUtils]: 13: Hoare triple {1543#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1543#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:53:00,242 INFO L273 TraceCheckUtils]: 14: Hoare triple {1543#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1553#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:53:00,243 INFO L273 TraceCheckUtils]: 15: Hoare triple {1553#(= (_ bv3 32) main_~a~0)} assume true; {1553#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:53:00,244 INFO L273 TraceCheckUtils]: 16: Hoare triple {1553#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1553#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:53:00,244 INFO L273 TraceCheckUtils]: 17: Hoare triple {1553#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1563#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:53:00,245 INFO L273 TraceCheckUtils]: 18: Hoare triple {1563#(= (_ bv4 32) main_~a~0)} assume true; {1563#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:53:00,246 INFO L273 TraceCheckUtils]: 19: Hoare triple {1563#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1504#false} is VALID [2018-11-14 15:53:00,246 INFO L273 TraceCheckUtils]: 20: Hoare triple {1504#false} havoc ~i~0;~i~0 := 0bv32; {1504#false} is VALID [2018-11-14 15:53:00,247 INFO L273 TraceCheckUtils]: 21: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,247 INFO L273 TraceCheckUtils]: 22: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1504#false} is VALID [2018-11-14 15:53:00,247 INFO L273 TraceCheckUtils]: 23: Hoare triple {1504#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1504#false} is VALID [2018-11-14 15:53:00,248 INFO L273 TraceCheckUtils]: 24: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,248 INFO L273 TraceCheckUtils]: 25: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-14 15:53:00,248 INFO L273 TraceCheckUtils]: 26: Hoare triple {1504#false} ~i~0 := 0bv32; {1504#false} is VALID [2018-11-14 15:53:00,249 INFO L273 TraceCheckUtils]: 27: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,249 INFO L273 TraceCheckUtils]: 28: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1504#false} is VALID [2018-11-14 15:53:00,249 INFO L273 TraceCheckUtils]: 29: Hoare triple {1504#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1504#false} is VALID [2018-11-14 15:53:00,250 INFO L273 TraceCheckUtils]: 30: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,250 INFO L273 TraceCheckUtils]: 31: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-14 15:53:00,250 INFO L273 TraceCheckUtils]: 32: Hoare triple {1504#false} ~i~0 := 0bv32; {1504#false} is VALID [2018-11-14 15:53:00,250 INFO L273 TraceCheckUtils]: 33: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,250 INFO L273 TraceCheckUtils]: 34: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1504#false} is VALID [2018-11-14 15:53:00,251 INFO L273 TraceCheckUtils]: 35: Hoare triple {1504#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1504#false} is VALID [2018-11-14 15:53:00,251 INFO L273 TraceCheckUtils]: 36: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,251 INFO L273 TraceCheckUtils]: 37: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-14 15:53:00,251 INFO L273 TraceCheckUtils]: 38: Hoare triple {1504#false} ~i~0 := 0bv32; {1504#false} is VALID [2018-11-14 15:53:00,252 INFO L273 TraceCheckUtils]: 39: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,252 INFO L273 TraceCheckUtils]: 40: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1504#false} is VALID [2018-11-14 15:53:00,252 INFO L273 TraceCheckUtils]: 41: Hoare triple {1504#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1504#false} is VALID [2018-11-14 15:53:00,252 INFO L273 TraceCheckUtils]: 42: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,252 INFO L273 TraceCheckUtils]: 43: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-14 15:53:00,253 INFO L273 TraceCheckUtils]: 44: Hoare triple {1504#false} havoc ~x~0;~x~0 := 0bv32; {1504#false} is VALID [2018-11-14 15:53:00,253 INFO L273 TraceCheckUtils]: 45: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,253 INFO L273 TraceCheckUtils]: 46: Hoare triple {1504#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1504#false} is VALID [2018-11-14 15:53:00,253 INFO L256 TraceCheckUtils]: 47: Hoare triple {1504#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {1504#false} is VALID [2018-11-14 15:53:00,254 INFO L273 TraceCheckUtils]: 48: Hoare triple {1504#false} ~cond := #in~cond; {1504#false} is VALID [2018-11-14 15:53:00,254 INFO L273 TraceCheckUtils]: 49: Hoare triple {1504#false} assume ~cond == 0bv32; {1504#false} is VALID [2018-11-14 15:53:00,254 INFO L273 TraceCheckUtils]: 50: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2018-11-14 15:53:00,258 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 15:53:00,259 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:53:00,574 INFO L273 TraceCheckUtils]: 50: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2018-11-14 15:53:00,574 INFO L273 TraceCheckUtils]: 49: Hoare triple {1504#false} assume ~cond == 0bv32; {1504#false} is VALID [2018-11-14 15:53:00,575 INFO L273 TraceCheckUtils]: 48: Hoare triple {1504#false} ~cond := #in~cond; {1504#false} is VALID [2018-11-14 15:53:00,575 INFO L256 TraceCheckUtils]: 47: Hoare triple {1504#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {1504#false} is VALID [2018-11-14 15:53:00,576 INFO L273 TraceCheckUtils]: 46: Hoare triple {1504#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1504#false} is VALID [2018-11-14 15:53:00,576 INFO L273 TraceCheckUtils]: 45: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,576 INFO L273 TraceCheckUtils]: 44: Hoare triple {1504#false} havoc ~x~0;~x~0 := 0bv32; {1504#false} is VALID [2018-11-14 15:53:00,577 INFO L273 TraceCheckUtils]: 43: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-14 15:53:00,577 INFO L273 TraceCheckUtils]: 42: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,577 INFO L273 TraceCheckUtils]: 41: Hoare triple {1504#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1504#false} is VALID [2018-11-14 15:53:00,577 INFO L273 TraceCheckUtils]: 40: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1504#false} is VALID [2018-11-14 15:53:00,578 INFO L273 TraceCheckUtils]: 39: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,578 INFO L273 TraceCheckUtils]: 38: Hoare triple {1504#false} ~i~0 := 0bv32; {1504#false} is VALID [2018-11-14 15:53:00,578 INFO L273 TraceCheckUtils]: 37: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-14 15:53:00,579 INFO L273 TraceCheckUtils]: 36: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,579 INFO L273 TraceCheckUtils]: 35: Hoare triple {1504#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1504#false} is VALID [2018-11-14 15:53:00,579 INFO L273 TraceCheckUtils]: 34: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1504#false} is VALID [2018-11-14 15:53:00,579 INFO L273 TraceCheckUtils]: 33: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,580 INFO L273 TraceCheckUtils]: 32: Hoare triple {1504#false} ~i~0 := 0bv32; {1504#false} is VALID [2018-11-14 15:53:00,580 INFO L273 TraceCheckUtils]: 31: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-14 15:53:00,580 INFO L273 TraceCheckUtils]: 30: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,580 INFO L273 TraceCheckUtils]: 29: Hoare triple {1504#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1504#false} is VALID [2018-11-14 15:53:00,581 INFO L273 TraceCheckUtils]: 28: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1504#false} is VALID [2018-11-14 15:53:00,581 INFO L273 TraceCheckUtils]: 27: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,581 INFO L273 TraceCheckUtils]: 26: Hoare triple {1504#false} ~i~0 := 0bv32; {1504#false} is VALID [2018-11-14 15:53:00,581 INFO L273 TraceCheckUtils]: 25: Hoare triple {1504#false} assume !~bvslt32(~i~0, 100000bv32); {1504#false} is VALID [2018-11-14 15:53:00,582 INFO L273 TraceCheckUtils]: 24: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,582 INFO L273 TraceCheckUtils]: 23: Hoare triple {1504#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1504#false} is VALID [2018-11-14 15:53:00,582 INFO L273 TraceCheckUtils]: 22: Hoare triple {1504#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1504#false} is VALID [2018-11-14 15:53:00,582 INFO L273 TraceCheckUtils]: 21: Hoare triple {1504#false} assume true; {1504#false} is VALID [2018-11-14 15:53:00,583 INFO L273 TraceCheckUtils]: 20: Hoare triple {1504#false} havoc ~i~0;~i~0 := 0bv32; {1504#false} is VALID [2018-11-14 15:53:00,587 INFO L273 TraceCheckUtils]: 19: Hoare triple {1756#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1504#false} is VALID [2018-11-14 15:53:00,589 INFO L273 TraceCheckUtils]: 18: Hoare triple {1756#(bvslt main_~a~0 (_ bv100000 32))} assume true; {1756#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:53:00,590 INFO L273 TraceCheckUtils]: 17: Hoare triple {1763#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1756#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:53:00,590 INFO L273 TraceCheckUtils]: 16: Hoare triple {1763#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1763#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:00,591 INFO L273 TraceCheckUtils]: 15: Hoare triple {1763#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1763#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:00,596 INFO L273 TraceCheckUtils]: 14: Hoare triple {1773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1763#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:00,596 INFO L273 TraceCheckUtils]: 13: Hoare triple {1773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:00,597 INFO L273 TraceCheckUtils]: 12: Hoare triple {1773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume true; {1773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:00,601 INFO L273 TraceCheckUtils]: 11: Hoare triple {1783#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1773#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:00,602 INFO L273 TraceCheckUtils]: 10: Hoare triple {1783#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1783#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:00,602 INFO L273 TraceCheckUtils]: 9: Hoare triple {1783#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume true; {1783#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:00,606 INFO L273 TraceCheckUtils]: 8: Hoare triple {1793#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1783#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:00,606 INFO L273 TraceCheckUtils]: 7: Hoare triple {1793#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1793#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:00,607 INFO L273 TraceCheckUtils]: 6: Hoare triple {1793#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume true; {1793#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:00,608 INFO L273 TraceCheckUtils]: 5: Hoare triple {1503#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1793#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:00,608 INFO L256 TraceCheckUtils]: 4: Hoare triple {1503#true} call #t~ret13 := main(); {1503#true} is VALID [2018-11-14 15:53:00,608 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} #111#return; {1503#true} is VALID [2018-11-14 15:53:00,608 INFO L273 TraceCheckUtils]: 2: Hoare triple {1503#true} assume true; {1503#true} is VALID [2018-11-14 15:53:00,609 INFO L273 TraceCheckUtils]: 1: Hoare triple {1503#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1503#true} is VALID [2018-11-14 15:53:00,609 INFO L256 TraceCheckUtils]: 0: Hoare triple {1503#true} call ULTIMATE.init(); {1503#true} is VALID [2018-11-14 15:53:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 15:53:00,616 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:53:00,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 15:53:00,617 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-14 15:53:00,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:53:00,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 15:53:00,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:53:00,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 15:53:00,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 15:53:00,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-14 15:53:00,743 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand 12 states. [2018-11-14 15:53:01,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:01,752 INFO L93 Difference]: Finished difference Result 110 states and 125 transitions. [2018-11-14 15:53:01,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-14 15:53:01,753 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-11-14 15:53:01,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:53:01,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 15:53:01,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-14 15:53:01,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 15:53:01,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2018-11-14 15:53:01,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 109 transitions. [2018-11-14 15:53:01,953 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:53:01,956 INFO L225 Difference]: With dead ends: 110 [2018-11-14 15:53:01,956 INFO L226 Difference]: Without dead ends: 74 [2018-11-14 15:53:01,957 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 91 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-14 15:53:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-11-14 15:53:02,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-11-14 15:53:02,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:53:02,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand 74 states. [2018-11-14 15:53:02,019 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-14 15:53:02,019 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-14 15:53:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:02,023 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-14 15:53:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-11-14 15:53:02,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:53:02,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:53:02,024 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand 74 states. [2018-11-14 15:53:02,024 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 74 states. [2018-11-14 15:53:02,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:02,027 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-11-14 15:53:02,027 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-11-14 15:53:02,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:53:02,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:53:02,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:53:02,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:53:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-14 15:53:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2018-11-14 15:53:02,031 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 51 [2018-11-14 15:53:02,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:53:02,032 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2018-11-14 15:53:02,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 15:53:02,032 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2018-11-14 15:53:02,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-14 15:53:02,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:53:02,034 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:53:02,034 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:53:02,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:53:02,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1996062837, now seen corresponding path program 2 times [2018-11-14 15:53:02,035 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:53:02,035 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-14 15:53:02,058 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 15:53:02,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 15:53:02,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:53:02,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:53:02,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:53:02,486 INFO L256 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2018-11-14 15:53:02,486 INFO L273 TraceCheckUtils]: 1: Hoare triple {2223#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2223#true} is VALID [2018-11-14 15:53:02,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2018-11-14 15:53:02,487 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #111#return; {2223#true} is VALID [2018-11-14 15:53:02,488 INFO L256 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret13 := main(); {2223#true} is VALID [2018-11-14 15:53:02,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {2223#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2243#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:53:02,490 INFO L273 TraceCheckUtils]: 6: Hoare triple {2243#(= main_~a~0 (_ bv0 32))} assume true; {2243#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:53:02,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {2243#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2243#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:53:02,492 INFO L273 TraceCheckUtils]: 8: Hoare triple {2243#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2253#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:53:02,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {2253#(= (_ bv1 32) main_~a~0)} assume true; {2253#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:53:02,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {2253#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2253#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:53:02,493 INFO L273 TraceCheckUtils]: 11: Hoare triple {2253#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2263#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:53:02,494 INFO L273 TraceCheckUtils]: 12: Hoare triple {2263#(= (_ bv2 32) main_~a~0)} assume true; {2263#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:53:02,494 INFO L273 TraceCheckUtils]: 13: Hoare triple {2263#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2263#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:53:02,495 INFO L273 TraceCheckUtils]: 14: Hoare triple {2263#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2273#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:53:02,496 INFO L273 TraceCheckUtils]: 15: Hoare triple {2273#(= (_ bv3 32) main_~a~0)} assume true; {2273#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:53:02,497 INFO L273 TraceCheckUtils]: 16: Hoare triple {2273#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2273#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:53:02,497 INFO L273 TraceCheckUtils]: 17: Hoare triple {2273#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2283#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:53:02,498 INFO L273 TraceCheckUtils]: 18: Hoare triple {2283#(= (_ bv4 32) main_~a~0)} assume true; {2283#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:53:02,499 INFO L273 TraceCheckUtils]: 19: Hoare triple {2283#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2283#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:53:02,500 INFO L273 TraceCheckUtils]: 20: Hoare triple {2283#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2293#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 15:53:02,500 INFO L273 TraceCheckUtils]: 21: Hoare triple {2293#(= (_ bv5 32) main_~a~0)} assume true; {2293#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 15:53:02,501 INFO L273 TraceCheckUtils]: 22: Hoare triple {2293#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2293#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 15:53:02,502 INFO L273 TraceCheckUtils]: 23: Hoare triple {2293#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2303#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 15:53:02,503 INFO L273 TraceCheckUtils]: 24: Hoare triple {2303#(= (_ bv6 32) main_~a~0)} assume true; {2303#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 15:53:02,504 INFO L273 TraceCheckUtils]: 25: Hoare triple {2303#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2303#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 15:53:02,505 INFO L273 TraceCheckUtils]: 26: Hoare triple {2303#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2313#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 15:53:02,505 INFO L273 TraceCheckUtils]: 27: Hoare triple {2313#(= (_ bv7 32) main_~a~0)} assume true; {2313#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 15:53:02,506 INFO L273 TraceCheckUtils]: 28: Hoare triple {2313#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2313#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 15:53:02,507 INFO L273 TraceCheckUtils]: 29: Hoare triple {2313#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2323#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 15:53:02,508 INFO L273 TraceCheckUtils]: 30: Hoare triple {2323#(= (_ bv8 32) main_~a~0)} assume true; {2323#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 15:53:02,508 INFO L273 TraceCheckUtils]: 31: Hoare triple {2323#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2323#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 15:53:02,509 INFO L273 TraceCheckUtils]: 32: Hoare triple {2323#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2333#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 15:53:02,510 INFO L273 TraceCheckUtils]: 33: Hoare triple {2333#(= (_ bv9 32) main_~a~0)} assume true; {2333#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 15:53:02,511 INFO L273 TraceCheckUtils]: 34: Hoare triple {2333#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2333#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 15:53:02,512 INFO L273 TraceCheckUtils]: 35: Hoare triple {2333#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2343#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-14 15:53:02,512 INFO L273 TraceCheckUtils]: 36: Hoare triple {2343#(= (_ bv10 32) main_~a~0)} assume true; {2343#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-14 15:53:02,515 INFO L273 TraceCheckUtils]: 37: Hoare triple {2343#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {2224#false} is VALID [2018-11-14 15:53:02,515 INFO L273 TraceCheckUtils]: 38: Hoare triple {2224#false} havoc ~i~0;~i~0 := 0bv32; {2224#false} is VALID [2018-11-14 15:53:02,516 INFO L273 TraceCheckUtils]: 39: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:02,516 INFO L273 TraceCheckUtils]: 40: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2224#false} is VALID [2018-11-14 15:53:02,516 INFO L273 TraceCheckUtils]: 41: Hoare triple {2224#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2224#false} is VALID [2018-11-14 15:53:02,517 INFO L273 TraceCheckUtils]: 42: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:02,517 INFO L273 TraceCheckUtils]: 43: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-14 15:53:02,517 INFO L273 TraceCheckUtils]: 44: Hoare triple {2224#false} ~i~0 := 0bv32; {2224#false} is VALID [2018-11-14 15:53:02,518 INFO L273 TraceCheckUtils]: 45: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:02,518 INFO L273 TraceCheckUtils]: 46: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2224#false} is VALID [2018-11-14 15:53:02,518 INFO L273 TraceCheckUtils]: 47: Hoare triple {2224#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2224#false} is VALID [2018-11-14 15:53:02,518 INFO L273 TraceCheckUtils]: 48: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:02,519 INFO L273 TraceCheckUtils]: 49: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-14 15:53:02,519 INFO L273 TraceCheckUtils]: 50: Hoare triple {2224#false} ~i~0 := 0bv32; {2224#false} is VALID [2018-11-14 15:53:02,519 INFO L273 TraceCheckUtils]: 51: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:02,519 INFO L273 TraceCheckUtils]: 52: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2224#false} is VALID [2018-11-14 15:53:02,519 INFO L273 TraceCheckUtils]: 53: Hoare triple {2224#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2224#false} is VALID [2018-11-14 15:53:02,520 INFO L273 TraceCheckUtils]: 54: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:02,520 INFO L273 TraceCheckUtils]: 55: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-14 15:53:02,520 INFO L273 TraceCheckUtils]: 56: Hoare triple {2224#false} ~i~0 := 0bv32; {2224#false} is VALID [2018-11-14 15:53:02,520 INFO L273 TraceCheckUtils]: 57: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:02,520 INFO L273 TraceCheckUtils]: 58: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {2224#false} is VALID [2018-11-14 15:53:02,521 INFO L273 TraceCheckUtils]: 59: Hoare triple {2224#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2224#false} is VALID [2018-11-14 15:53:02,521 INFO L273 TraceCheckUtils]: 60: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:02,521 INFO L273 TraceCheckUtils]: 61: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-14 15:53:02,521 INFO L273 TraceCheckUtils]: 62: Hoare triple {2224#false} havoc ~x~0;~x~0 := 0bv32; {2224#false} is VALID [2018-11-14 15:53:02,522 INFO L273 TraceCheckUtils]: 63: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:02,522 INFO L273 TraceCheckUtils]: 64: Hoare triple {2224#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2224#false} is VALID [2018-11-14 15:53:02,522 INFO L256 TraceCheckUtils]: 65: Hoare triple {2224#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {2224#false} is VALID [2018-11-14 15:53:02,522 INFO L273 TraceCheckUtils]: 66: Hoare triple {2224#false} ~cond := #in~cond; {2224#false} is VALID [2018-11-14 15:53:02,522 INFO L273 TraceCheckUtils]: 67: Hoare triple {2224#false} assume ~cond == 0bv32; {2224#false} is VALID [2018-11-14 15:53:02,523 INFO L273 TraceCheckUtils]: 68: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2018-11-14 15:53:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 15:53:02,528 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:53:03,278 INFO L273 TraceCheckUtils]: 68: Hoare triple {2224#false} assume !false; {2224#false} is VALID [2018-11-14 15:53:03,278 INFO L273 TraceCheckUtils]: 67: Hoare triple {2224#false} assume ~cond == 0bv32; {2224#false} is VALID [2018-11-14 15:53:03,278 INFO L273 TraceCheckUtils]: 66: Hoare triple {2224#false} ~cond := #in~cond; {2224#false} is VALID [2018-11-14 15:53:03,278 INFO L256 TraceCheckUtils]: 65: Hoare triple {2224#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {2224#false} is VALID [2018-11-14 15:53:03,278 INFO L273 TraceCheckUtils]: 64: Hoare triple {2224#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2224#false} is VALID [2018-11-14 15:53:03,279 INFO L273 TraceCheckUtils]: 63: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:03,279 INFO L273 TraceCheckUtils]: 62: Hoare triple {2224#false} havoc ~x~0;~x~0 := 0bv32; {2224#false} is VALID [2018-11-14 15:53:03,279 INFO L273 TraceCheckUtils]: 61: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-14 15:53:03,279 INFO L273 TraceCheckUtils]: 60: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:03,280 INFO L273 TraceCheckUtils]: 59: Hoare triple {2224#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2224#false} is VALID [2018-11-14 15:53:03,280 INFO L273 TraceCheckUtils]: 58: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {2224#false} is VALID [2018-11-14 15:53:03,280 INFO L273 TraceCheckUtils]: 57: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:03,280 INFO L273 TraceCheckUtils]: 56: Hoare triple {2224#false} ~i~0 := 0bv32; {2224#false} is VALID [2018-11-14 15:53:03,280 INFO L273 TraceCheckUtils]: 55: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-14 15:53:03,280 INFO L273 TraceCheckUtils]: 54: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:03,281 INFO L273 TraceCheckUtils]: 53: Hoare triple {2224#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2224#false} is VALID [2018-11-14 15:53:03,281 INFO L273 TraceCheckUtils]: 52: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2224#false} is VALID [2018-11-14 15:53:03,281 INFO L273 TraceCheckUtils]: 51: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:03,281 INFO L273 TraceCheckUtils]: 50: Hoare triple {2224#false} ~i~0 := 0bv32; {2224#false} is VALID [2018-11-14 15:53:03,281 INFO L273 TraceCheckUtils]: 49: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-14 15:53:03,281 INFO L273 TraceCheckUtils]: 48: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:03,281 INFO L273 TraceCheckUtils]: 47: Hoare triple {2224#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2224#false} is VALID [2018-11-14 15:53:03,282 INFO L273 TraceCheckUtils]: 46: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2224#false} is VALID [2018-11-14 15:53:03,282 INFO L273 TraceCheckUtils]: 45: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:03,282 INFO L273 TraceCheckUtils]: 44: Hoare triple {2224#false} ~i~0 := 0bv32; {2224#false} is VALID [2018-11-14 15:53:03,282 INFO L273 TraceCheckUtils]: 43: Hoare triple {2224#false} assume !~bvslt32(~i~0, 100000bv32); {2224#false} is VALID [2018-11-14 15:53:03,282 INFO L273 TraceCheckUtils]: 42: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:03,282 INFO L273 TraceCheckUtils]: 41: Hoare triple {2224#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2224#false} is VALID [2018-11-14 15:53:03,282 INFO L273 TraceCheckUtils]: 40: Hoare triple {2224#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2224#false} is VALID [2018-11-14 15:53:03,283 INFO L273 TraceCheckUtils]: 39: Hoare triple {2224#false} assume true; {2224#false} is VALID [2018-11-14 15:53:03,283 INFO L273 TraceCheckUtils]: 38: Hoare triple {2224#false} havoc ~i~0;~i~0 := 0bv32; {2224#false} is VALID [2018-11-14 15:53:03,283 INFO L273 TraceCheckUtils]: 37: Hoare triple {2536#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {2224#false} is VALID [2018-11-14 15:53:03,285 INFO L273 TraceCheckUtils]: 36: Hoare triple {2536#(bvslt main_~a~0 (_ bv100000 32))} assume true; {2536#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:53:03,286 INFO L273 TraceCheckUtils]: 35: Hoare triple {2543#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2536#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:53:03,295 INFO L273 TraceCheckUtils]: 34: Hoare triple {2543#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2543#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,295 INFO L273 TraceCheckUtils]: 33: Hoare triple {2543#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {2543#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,299 INFO L273 TraceCheckUtils]: 32: Hoare triple {2553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2543#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,300 INFO L273 TraceCheckUtils]: 31: Hoare triple {2553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,300 INFO L273 TraceCheckUtils]: 30: Hoare triple {2553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume true; {2553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,305 INFO L273 TraceCheckUtils]: 29: Hoare triple {2563#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2553#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,306 INFO L273 TraceCheckUtils]: 28: Hoare triple {2563#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2563#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,306 INFO L273 TraceCheckUtils]: 27: Hoare triple {2563#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume true; {2563#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,310 INFO L273 TraceCheckUtils]: 26: Hoare triple {2573#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2563#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,310 INFO L273 TraceCheckUtils]: 25: Hoare triple {2573#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2573#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,311 INFO L273 TraceCheckUtils]: 24: Hoare triple {2573#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume true; {2573#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,319 INFO L273 TraceCheckUtils]: 23: Hoare triple {2583#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2573#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,320 INFO L273 TraceCheckUtils]: 22: Hoare triple {2583#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2583#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,320 INFO L273 TraceCheckUtils]: 21: Hoare triple {2583#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume true; {2583#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,326 INFO L273 TraceCheckUtils]: 20: Hoare triple {2593#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2583#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,326 INFO L273 TraceCheckUtils]: 19: Hoare triple {2593#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2593#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,326 INFO L273 TraceCheckUtils]: 18: Hoare triple {2593#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume true; {2593#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,331 INFO L273 TraceCheckUtils]: 17: Hoare triple {2603#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2593#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,332 INFO L273 TraceCheckUtils]: 16: Hoare triple {2603#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2603#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,332 INFO L273 TraceCheckUtils]: 15: Hoare triple {2603#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume true; {2603#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,337 INFO L273 TraceCheckUtils]: 14: Hoare triple {2613#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2603#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,338 INFO L273 TraceCheckUtils]: 13: Hoare triple {2613#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2613#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,338 INFO L273 TraceCheckUtils]: 12: Hoare triple {2613#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume true; {2613#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,342 INFO L273 TraceCheckUtils]: 11: Hoare triple {2623#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2613#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,343 INFO L273 TraceCheckUtils]: 10: Hoare triple {2623#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2623#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,344 INFO L273 TraceCheckUtils]: 9: Hoare triple {2623#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume true; {2623#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,351 INFO L273 TraceCheckUtils]: 8: Hoare triple {2633#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2623#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,352 INFO L273 TraceCheckUtils]: 7: Hoare triple {2633#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2633#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,352 INFO L273 TraceCheckUtils]: 6: Hoare triple {2633#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume true; {2633#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,356 INFO L273 TraceCheckUtils]: 5: Hoare triple {2223#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2633#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:03,356 INFO L256 TraceCheckUtils]: 4: Hoare triple {2223#true} call #t~ret13 := main(); {2223#true} is VALID [2018-11-14 15:53:03,357 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2223#true} {2223#true} #111#return; {2223#true} is VALID [2018-11-14 15:53:03,357 INFO L273 TraceCheckUtils]: 2: Hoare triple {2223#true} assume true; {2223#true} is VALID [2018-11-14 15:53:03,357 INFO L273 TraceCheckUtils]: 1: Hoare triple {2223#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2223#true} is VALID [2018-11-14 15:53:03,357 INFO L256 TraceCheckUtils]: 0: Hoare triple {2223#true} call ULTIMATE.init(); {2223#true} is VALID [2018-11-14 15:53:03,362 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-11-14 15:53:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:53:03,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-14 15:53:03,365 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 69 [2018-11-14 15:53:03,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:53:03,366 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-14 15:53:03,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:53:03,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-14 15:53:03,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-14 15:53:03,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-14 15:53:03,585 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand 24 states. [2018-11-14 15:53:07,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:07,467 INFO L93 Difference]: Finished difference Result 146 states and 167 transitions. [2018-11-14 15:53:07,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-14 15:53:07,467 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 69 [2018-11-14 15:53:07,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:53:07,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 15:53:07,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 151 transitions. [2018-11-14 15:53:07,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-14 15:53:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 151 transitions. [2018-11-14 15:53:07,479 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 151 transitions. [2018-11-14 15:53:07,742 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:53:07,745 INFO L225 Difference]: With dead ends: 146 [2018-11-14 15:53:07,746 INFO L226 Difference]: Without dead ends: 110 [2018-11-14 15:53:07,747 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 115 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-14 15:53:07,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-14 15:53:07,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-14 15:53:07,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:53:07,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 110 states. [2018-11-14 15:53:07,805 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 110 states. [2018-11-14 15:53:07,805 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 110 states. [2018-11-14 15:53:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:07,809 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-11-14 15:53:07,810 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-11-14 15:53:07,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:53:07,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:53:07,811 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 110 states. [2018-11-14 15:53:07,811 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 110 states. [2018-11-14 15:53:07,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:07,815 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2018-11-14 15:53:07,815 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-11-14 15:53:07,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:53:07,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:53:07,816 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:53:07,816 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:53:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-14 15:53:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2018-11-14 15:53:07,820 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 69 [2018-11-14 15:53:07,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:53:07,820 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2018-11-14 15:53:07,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-14 15:53:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2018-11-14 15:53:07,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-11-14 15:53:07,822 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:53:07,823 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:53:07,823 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:53:07,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:53:07,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1886400971, now seen corresponding path program 3 times [2018-11-14 15:53:07,824 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:53:07,824 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-14 15:53:07,841 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 15:53:07,925 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-14 15:53:07,925 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:53:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:53:07,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:53:08,063 INFO L256 TraceCheckUtils]: 0: Hoare triple {3243#true} call ULTIMATE.init(); {3243#true} is VALID [2018-11-14 15:53:08,063 INFO L273 TraceCheckUtils]: 1: Hoare triple {3243#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3243#true} is VALID [2018-11-14 15:53:08,063 INFO L273 TraceCheckUtils]: 2: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,064 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3243#true} {3243#true} #111#return; {3243#true} is VALID [2018-11-14 15:53:08,064 INFO L256 TraceCheckUtils]: 4: Hoare triple {3243#true} call #t~ret13 := main(); {3243#true} is VALID [2018-11-14 15:53:08,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {3243#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3243#true} is VALID [2018-11-14 15:53:08,065 INFO L273 TraceCheckUtils]: 6: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,065 INFO L273 TraceCheckUtils]: 7: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,065 INFO L273 TraceCheckUtils]: 8: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,065 INFO L273 TraceCheckUtils]: 9: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,065 INFO L273 TraceCheckUtils]: 11: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,065 INFO L273 TraceCheckUtils]: 12: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,065 INFO L273 TraceCheckUtils]: 13: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,066 INFO L273 TraceCheckUtils]: 14: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,066 INFO L273 TraceCheckUtils]: 15: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,066 INFO L273 TraceCheckUtils]: 16: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,066 INFO L273 TraceCheckUtils]: 17: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,066 INFO L273 TraceCheckUtils]: 19: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,066 INFO L273 TraceCheckUtils]: 20: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,067 INFO L273 TraceCheckUtils]: 21: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,067 INFO L273 TraceCheckUtils]: 22: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,067 INFO L273 TraceCheckUtils]: 23: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,067 INFO L273 TraceCheckUtils]: 24: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,067 INFO L273 TraceCheckUtils]: 25: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,067 INFO L273 TraceCheckUtils]: 26: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,067 INFO L273 TraceCheckUtils]: 27: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,067 INFO L273 TraceCheckUtils]: 28: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,068 INFO L273 TraceCheckUtils]: 29: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,068 INFO L273 TraceCheckUtils]: 30: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,068 INFO L273 TraceCheckUtils]: 31: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,068 INFO L273 TraceCheckUtils]: 32: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,068 INFO L273 TraceCheckUtils]: 33: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,068 INFO L273 TraceCheckUtils]: 34: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,068 INFO L273 TraceCheckUtils]: 35: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,069 INFO L273 TraceCheckUtils]: 36: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,069 INFO L273 TraceCheckUtils]: 37: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,069 INFO L273 TraceCheckUtils]: 38: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,069 INFO L273 TraceCheckUtils]: 39: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,069 INFO L273 TraceCheckUtils]: 40: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,069 INFO L273 TraceCheckUtils]: 41: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,069 INFO L273 TraceCheckUtils]: 42: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,070 INFO L273 TraceCheckUtils]: 43: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,070 INFO L273 TraceCheckUtils]: 44: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,070 INFO L273 TraceCheckUtils]: 45: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,070 INFO L273 TraceCheckUtils]: 46: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,070 INFO L273 TraceCheckUtils]: 47: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,070 INFO L273 TraceCheckUtils]: 48: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,070 INFO L273 TraceCheckUtils]: 49: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,071 INFO L273 TraceCheckUtils]: 50: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,071 INFO L273 TraceCheckUtils]: 51: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,071 INFO L273 TraceCheckUtils]: 52: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,071 INFO L273 TraceCheckUtils]: 53: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,071 INFO L273 TraceCheckUtils]: 54: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,071 INFO L273 TraceCheckUtils]: 55: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,071 INFO L273 TraceCheckUtils]: 56: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,072 INFO L273 TraceCheckUtils]: 57: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,072 INFO L273 TraceCheckUtils]: 58: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,072 INFO L273 TraceCheckUtils]: 59: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,072 INFO L273 TraceCheckUtils]: 60: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,072 INFO L273 TraceCheckUtils]: 61: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,072 INFO L273 TraceCheckUtils]: 62: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,072 INFO L273 TraceCheckUtils]: 63: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,072 INFO L273 TraceCheckUtils]: 64: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,073 INFO L273 TraceCheckUtils]: 65: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,073 INFO L273 TraceCheckUtils]: 66: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,073 INFO L273 TraceCheckUtils]: 67: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,073 INFO L273 TraceCheckUtils]: 68: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,073 INFO L273 TraceCheckUtils]: 69: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,074 INFO L273 TraceCheckUtils]: 70: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,074 INFO L273 TraceCheckUtils]: 71: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,074 INFO L273 TraceCheckUtils]: 72: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,074 INFO L273 TraceCheckUtils]: 73: Hoare triple {3243#true} assume !~bvslt32(~a~0, 100000bv32); {3243#true} is VALID [2018-11-14 15:53:08,078 INFO L273 TraceCheckUtils]: 74: Hoare triple {3243#true} havoc ~i~0;~i~0 := 0bv32; {3470#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:53:08,078 INFO L273 TraceCheckUtils]: 75: Hoare triple {3470#(= main_~i~0 (_ bv0 32))} assume true; {3470#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:53:08,084 INFO L273 TraceCheckUtils]: 76: Hoare triple {3470#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3470#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:53:08,084 INFO L273 TraceCheckUtils]: 77: Hoare triple {3470#(= main_~i~0 (_ bv0 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3480#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:53:08,084 INFO L273 TraceCheckUtils]: 78: Hoare triple {3480#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3480#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:53:08,085 INFO L273 TraceCheckUtils]: 79: Hoare triple {3480#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-14 15:53:08,085 INFO L273 TraceCheckUtils]: 80: Hoare triple {3244#false} ~i~0 := 0bv32; {3244#false} is VALID [2018-11-14 15:53:08,085 INFO L273 TraceCheckUtils]: 81: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,085 INFO L273 TraceCheckUtils]: 82: Hoare triple {3244#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3244#false} is VALID [2018-11-14 15:53:08,085 INFO L273 TraceCheckUtils]: 83: Hoare triple {3244#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3244#false} is VALID [2018-11-14 15:53:08,086 INFO L273 TraceCheckUtils]: 84: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,086 INFO L273 TraceCheckUtils]: 85: Hoare triple {3244#false} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-14 15:53:08,086 INFO L273 TraceCheckUtils]: 86: Hoare triple {3244#false} ~i~0 := 0bv32; {3244#false} is VALID [2018-11-14 15:53:08,086 INFO L273 TraceCheckUtils]: 87: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,086 INFO L273 TraceCheckUtils]: 88: Hoare triple {3244#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3244#false} is VALID [2018-11-14 15:53:08,086 INFO L273 TraceCheckUtils]: 89: Hoare triple {3244#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3244#false} is VALID [2018-11-14 15:53:08,086 INFO L273 TraceCheckUtils]: 90: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,087 INFO L273 TraceCheckUtils]: 91: Hoare triple {3244#false} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-14 15:53:08,087 INFO L273 TraceCheckUtils]: 92: Hoare triple {3244#false} ~i~0 := 0bv32; {3244#false} is VALID [2018-11-14 15:53:08,087 INFO L273 TraceCheckUtils]: 93: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,087 INFO L273 TraceCheckUtils]: 94: Hoare triple {3244#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3244#false} is VALID [2018-11-14 15:53:08,087 INFO L273 TraceCheckUtils]: 95: Hoare triple {3244#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3244#false} is VALID [2018-11-14 15:53:08,088 INFO L273 TraceCheckUtils]: 96: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,088 INFO L273 TraceCheckUtils]: 97: Hoare triple {3244#false} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-14 15:53:08,088 INFO L273 TraceCheckUtils]: 98: Hoare triple {3244#false} havoc ~x~0;~x~0 := 0bv32; {3244#false} is VALID [2018-11-14 15:53:08,088 INFO L273 TraceCheckUtils]: 99: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,088 INFO L273 TraceCheckUtils]: 100: Hoare triple {3244#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3244#false} is VALID [2018-11-14 15:53:08,088 INFO L256 TraceCheckUtils]: 101: Hoare triple {3244#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {3244#false} is VALID [2018-11-14 15:53:08,088 INFO L273 TraceCheckUtils]: 102: Hoare triple {3244#false} ~cond := #in~cond; {3244#false} is VALID [2018-11-14 15:53:08,089 INFO L273 TraceCheckUtils]: 103: Hoare triple {3244#false} assume ~cond == 0bv32; {3244#false} is VALID [2018-11-14 15:53:08,089 INFO L273 TraceCheckUtils]: 104: Hoare triple {3244#false} assume !false; {3244#false} is VALID [2018-11-14 15:53:08,093 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-11-14 15:53:08,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:53:08,217 INFO L273 TraceCheckUtils]: 104: Hoare triple {3244#false} assume !false; {3244#false} is VALID [2018-11-14 15:53:08,218 INFO L273 TraceCheckUtils]: 103: Hoare triple {3244#false} assume ~cond == 0bv32; {3244#false} is VALID [2018-11-14 15:53:08,218 INFO L273 TraceCheckUtils]: 102: Hoare triple {3244#false} ~cond := #in~cond; {3244#false} is VALID [2018-11-14 15:53:08,218 INFO L256 TraceCheckUtils]: 101: Hoare triple {3244#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {3244#false} is VALID [2018-11-14 15:53:08,218 INFO L273 TraceCheckUtils]: 100: Hoare triple {3244#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3244#false} is VALID [2018-11-14 15:53:08,219 INFO L273 TraceCheckUtils]: 99: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,219 INFO L273 TraceCheckUtils]: 98: Hoare triple {3244#false} havoc ~x~0;~x~0 := 0bv32; {3244#false} is VALID [2018-11-14 15:53:08,219 INFO L273 TraceCheckUtils]: 97: Hoare triple {3244#false} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-14 15:53:08,219 INFO L273 TraceCheckUtils]: 96: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,220 INFO L273 TraceCheckUtils]: 95: Hoare triple {3244#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3244#false} is VALID [2018-11-14 15:53:08,220 INFO L273 TraceCheckUtils]: 94: Hoare triple {3244#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3244#false} is VALID [2018-11-14 15:53:08,220 INFO L273 TraceCheckUtils]: 93: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,220 INFO L273 TraceCheckUtils]: 92: Hoare triple {3244#false} ~i~0 := 0bv32; {3244#false} is VALID [2018-11-14 15:53:08,220 INFO L273 TraceCheckUtils]: 91: Hoare triple {3244#false} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-14 15:53:08,220 INFO L273 TraceCheckUtils]: 90: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,220 INFO L273 TraceCheckUtils]: 89: Hoare triple {3244#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3244#false} is VALID [2018-11-14 15:53:08,221 INFO L273 TraceCheckUtils]: 88: Hoare triple {3244#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3244#false} is VALID [2018-11-14 15:53:08,221 INFO L273 TraceCheckUtils]: 87: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,221 INFO L273 TraceCheckUtils]: 86: Hoare triple {3244#false} ~i~0 := 0bv32; {3244#false} is VALID [2018-11-14 15:53:08,221 INFO L273 TraceCheckUtils]: 85: Hoare triple {3244#false} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-14 15:53:08,221 INFO L273 TraceCheckUtils]: 84: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,222 INFO L273 TraceCheckUtils]: 83: Hoare triple {3244#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3244#false} is VALID [2018-11-14 15:53:08,222 INFO L273 TraceCheckUtils]: 82: Hoare triple {3244#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3244#false} is VALID [2018-11-14 15:53:08,222 INFO L273 TraceCheckUtils]: 81: Hoare triple {3244#false} assume true; {3244#false} is VALID [2018-11-14 15:53:08,222 INFO L273 TraceCheckUtils]: 80: Hoare triple {3244#false} ~i~0 := 0bv32; {3244#false} is VALID [2018-11-14 15:53:08,237 INFO L273 TraceCheckUtils]: 79: Hoare triple {3637#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3244#false} is VALID [2018-11-14 15:53:08,238 INFO L273 TraceCheckUtils]: 78: Hoare triple {3637#(bvslt main_~i~0 (_ bv100000 32))} assume true; {3637#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:53:08,239 INFO L273 TraceCheckUtils]: 77: Hoare triple {3644#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3637#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-14 15:53:08,239 INFO L273 TraceCheckUtils]: 76: Hoare triple {3644#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3644#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:08,239 INFO L273 TraceCheckUtils]: 75: Hoare triple {3644#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {3644#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:08,240 INFO L273 TraceCheckUtils]: 74: Hoare triple {3243#true} havoc ~i~0;~i~0 := 0bv32; {3644#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:08,240 INFO L273 TraceCheckUtils]: 73: Hoare triple {3243#true} assume !~bvslt32(~a~0, 100000bv32); {3243#true} is VALID [2018-11-14 15:53:08,240 INFO L273 TraceCheckUtils]: 72: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,240 INFO L273 TraceCheckUtils]: 71: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,240 INFO L273 TraceCheckUtils]: 70: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,240 INFO L273 TraceCheckUtils]: 69: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,240 INFO L273 TraceCheckUtils]: 68: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,241 INFO L273 TraceCheckUtils]: 67: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,241 INFO L273 TraceCheckUtils]: 66: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,241 INFO L273 TraceCheckUtils]: 65: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,241 INFO L273 TraceCheckUtils]: 64: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,241 INFO L273 TraceCheckUtils]: 63: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,242 INFO L273 TraceCheckUtils]: 62: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,242 INFO L273 TraceCheckUtils]: 61: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,242 INFO L273 TraceCheckUtils]: 60: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,242 INFO L273 TraceCheckUtils]: 59: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,242 INFO L273 TraceCheckUtils]: 58: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,242 INFO L273 TraceCheckUtils]: 57: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,243 INFO L273 TraceCheckUtils]: 56: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,243 INFO L273 TraceCheckUtils]: 55: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,243 INFO L273 TraceCheckUtils]: 54: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,243 INFO L273 TraceCheckUtils]: 53: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,244 INFO L273 TraceCheckUtils]: 52: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,244 INFO L273 TraceCheckUtils]: 51: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,244 INFO L273 TraceCheckUtils]: 50: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,244 INFO L273 TraceCheckUtils]: 49: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,244 INFO L273 TraceCheckUtils]: 48: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,245 INFO L273 TraceCheckUtils]: 47: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,245 INFO L273 TraceCheckUtils]: 46: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,245 INFO L273 TraceCheckUtils]: 45: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,245 INFO L273 TraceCheckUtils]: 44: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,245 INFO L273 TraceCheckUtils]: 43: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,245 INFO L273 TraceCheckUtils]: 42: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,246 INFO L273 TraceCheckUtils]: 41: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,246 INFO L273 TraceCheckUtils]: 40: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,246 INFO L273 TraceCheckUtils]: 39: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,246 INFO L273 TraceCheckUtils]: 38: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,246 INFO L273 TraceCheckUtils]: 37: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,246 INFO L273 TraceCheckUtils]: 36: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,247 INFO L273 TraceCheckUtils]: 35: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,247 INFO L273 TraceCheckUtils]: 34: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,247 INFO L273 TraceCheckUtils]: 33: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,247 INFO L273 TraceCheckUtils]: 32: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,247 INFO L273 TraceCheckUtils]: 31: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,247 INFO L273 TraceCheckUtils]: 30: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,248 INFO L273 TraceCheckUtils]: 29: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,248 INFO L273 TraceCheckUtils]: 28: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,248 INFO L273 TraceCheckUtils]: 27: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,248 INFO L273 TraceCheckUtils]: 26: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,248 INFO L273 TraceCheckUtils]: 25: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,249 INFO L273 TraceCheckUtils]: 24: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,249 INFO L273 TraceCheckUtils]: 23: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,249 INFO L273 TraceCheckUtils]: 22: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,249 INFO L273 TraceCheckUtils]: 21: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,249 INFO L273 TraceCheckUtils]: 20: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,249 INFO L273 TraceCheckUtils]: 19: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,250 INFO L273 TraceCheckUtils]: 18: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,250 INFO L273 TraceCheckUtils]: 17: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,250 INFO L273 TraceCheckUtils]: 16: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,250 INFO L273 TraceCheckUtils]: 15: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,250 INFO L273 TraceCheckUtils]: 14: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,250 INFO L273 TraceCheckUtils]: 13: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,251 INFO L273 TraceCheckUtils]: 12: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,251 INFO L273 TraceCheckUtils]: 11: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,251 INFO L273 TraceCheckUtils]: 10: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,251 INFO L273 TraceCheckUtils]: 9: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,251 INFO L273 TraceCheckUtils]: 8: Hoare triple {3243#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3243#true} is VALID [2018-11-14 15:53:08,251 INFO L273 TraceCheckUtils]: 7: Hoare triple {3243#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3243#true} is VALID [2018-11-14 15:53:08,252 INFO L273 TraceCheckUtils]: 6: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,252 INFO L273 TraceCheckUtils]: 5: Hoare triple {3243#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3243#true} is VALID [2018-11-14 15:53:08,252 INFO L256 TraceCheckUtils]: 4: Hoare triple {3243#true} call #t~ret13 := main(); {3243#true} is VALID [2018-11-14 15:53:08,252 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3243#true} {3243#true} #111#return; {3243#true} is VALID [2018-11-14 15:53:08,252 INFO L273 TraceCheckUtils]: 2: Hoare triple {3243#true} assume true; {3243#true} is VALID [2018-11-14 15:53:08,253 INFO L273 TraceCheckUtils]: 1: Hoare triple {3243#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3243#true} is VALID [2018-11-14 15:53:08,253 INFO L256 TraceCheckUtils]: 0: Hoare triple {3243#true} call ULTIMATE.init(); {3243#true} is VALID [2018-11-14 15:53:08,259 INFO L134 CoverageAnalysis]: Checked inductivity of 745 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2018-11-14 15:53:08,263 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:53:08,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 15:53:08,264 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-14 15:53:08,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:53:08,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 15:53:08,324 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:53:08,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 15:53:08,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 15:53:08,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 15:53:08,325 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand 6 states. [2018-11-14 15:53:08,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:08,911 INFO L93 Difference]: Finished difference Result 176 states and 196 transitions. [2018-11-14 15:53:08,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 15:53:08,911 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 105 [2018-11-14 15:53:08,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:53:08,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:53:08,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2018-11-14 15:53:08,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 15:53:08,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 125 transitions. [2018-11-14 15:53:08,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 125 transitions. [2018-11-14 15:53:09,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:53:09,110 INFO L225 Difference]: With dead ends: 176 [2018-11-14 15:53:09,111 INFO L226 Difference]: Without dead ends: 146 [2018-11-14 15:53:09,111 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 205 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-14 15:53:09,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-11-14 15:53:09,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2018-11-14 15:53:09,160 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:53:09,160 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand 146 states. [2018-11-14 15:53:09,160 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 146 states. [2018-11-14 15:53:09,161 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 146 states. [2018-11-14 15:53:09,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:09,166 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2018-11-14 15:53:09,166 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 151 transitions. [2018-11-14 15:53:09,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:53:09,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:53:09,167 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand 146 states. [2018-11-14 15:53:09,167 INFO L87 Difference]: Start difference. First operand 146 states. Second operand 146 states. [2018-11-14 15:53:09,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:09,171 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2018-11-14 15:53:09,172 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 151 transitions. [2018-11-14 15:53:09,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:53:09,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:53:09,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:53:09,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:53:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-11-14 15:53:09,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 151 transitions. [2018-11-14 15:53:09,176 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 151 transitions. Word has length 105 [2018-11-14 15:53:09,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:53:09,176 INFO L480 AbstractCegarLoop]: Abstraction has 146 states and 151 transitions. [2018-11-14 15:53:09,176 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 15:53:09,177 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 151 transitions. [2018-11-14 15:53:09,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-11-14 15:53:09,178 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:53:09,178 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:53:09,179 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:53:09,179 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:53:09,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1873047343, now seen corresponding path program 4 times [2018-11-14 15:53:09,180 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:53:09,180 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-14 15:53:09,195 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-14 15:53:09,335 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-14 15:53:09,335 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:53:09,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:53:09,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:53:09,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {4603#true} call ULTIMATE.init(); {4603#true} is VALID [2018-11-14 15:53:09,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {4603#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4603#true} is VALID [2018-11-14 15:53:09,982 INFO L273 TraceCheckUtils]: 2: Hoare triple {4603#true} assume true; {4603#true} is VALID [2018-11-14 15:53:09,982 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4603#true} {4603#true} #111#return; {4603#true} is VALID [2018-11-14 15:53:09,983 INFO L256 TraceCheckUtils]: 4: Hoare triple {4603#true} call #t~ret13 := main(); {4603#true} is VALID [2018-11-14 15:53:09,983 INFO L273 TraceCheckUtils]: 5: Hoare triple {4603#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {4623#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:53:09,984 INFO L273 TraceCheckUtils]: 6: Hoare triple {4623#(= main_~a~0 (_ bv0 32))} assume true; {4623#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:53:09,984 INFO L273 TraceCheckUtils]: 7: Hoare triple {4623#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4623#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-14 15:53:09,984 INFO L273 TraceCheckUtils]: 8: Hoare triple {4623#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4633#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:53:09,985 INFO L273 TraceCheckUtils]: 9: Hoare triple {4633#(= (_ bv1 32) main_~a~0)} assume true; {4633#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:53:09,985 INFO L273 TraceCheckUtils]: 10: Hoare triple {4633#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4633#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-14 15:53:09,988 INFO L273 TraceCheckUtils]: 11: Hoare triple {4633#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4643#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:53:09,988 INFO L273 TraceCheckUtils]: 12: Hoare triple {4643#(= (_ bv2 32) main_~a~0)} assume true; {4643#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:53:09,989 INFO L273 TraceCheckUtils]: 13: Hoare triple {4643#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4643#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-14 15:53:09,989 INFO L273 TraceCheckUtils]: 14: Hoare triple {4643#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4653#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:53:09,990 INFO L273 TraceCheckUtils]: 15: Hoare triple {4653#(= (_ bv3 32) main_~a~0)} assume true; {4653#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:53:09,991 INFO L273 TraceCheckUtils]: 16: Hoare triple {4653#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4653#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-14 15:53:09,991 INFO L273 TraceCheckUtils]: 17: Hoare triple {4653#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4663#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:53:09,993 INFO L273 TraceCheckUtils]: 18: Hoare triple {4663#(= (_ bv4 32) main_~a~0)} assume true; {4663#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:53:09,993 INFO L273 TraceCheckUtils]: 19: Hoare triple {4663#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4663#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-14 15:53:09,995 INFO L273 TraceCheckUtils]: 20: Hoare triple {4663#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4673#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 15:53:09,995 INFO L273 TraceCheckUtils]: 21: Hoare triple {4673#(= (_ bv5 32) main_~a~0)} assume true; {4673#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 15:53:09,997 INFO L273 TraceCheckUtils]: 22: Hoare triple {4673#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4673#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-14 15:53:09,997 INFO L273 TraceCheckUtils]: 23: Hoare triple {4673#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4683#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 15:53:10,000 INFO L273 TraceCheckUtils]: 24: Hoare triple {4683#(= (_ bv6 32) main_~a~0)} assume true; {4683#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 15:53:10,000 INFO L273 TraceCheckUtils]: 25: Hoare triple {4683#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4683#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-14 15:53:10,003 INFO L273 TraceCheckUtils]: 26: Hoare triple {4683#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4693#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 15:53:10,003 INFO L273 TraceCheckUtils]: 27: Hoare triple {4693#(= (_ bv7 32) main_~a~0)} assume true; {4693#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 15:53:10,005 INFO L273 TraceCheckUtils]: 28: Hoare triple {4693#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4693#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-14 15:53:10,005 INFO L273 TraceCheckUtils]: 29: Hoare triple {4693#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4703#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 15:53:10,007 INFO L273 TraceCheckUtils]: 30: Hoare triple {4703#(= (_ bv8 32) main_~a~0)} assume true; {4703#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 15:53:10,007 INFO L273 TraceCheckUtils]: 31: Hoare triple {4703#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4703#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-14 15:53:10,010 INFO L273 TraceCheckUtils]: 32: Hoare triple {4703#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4713#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 15:53:10,010 INFO L273 TraceCheckUtils]: 33: Hoare triple {4713#(= (_ bv9 32) main_~a~0)} assume true; {4713#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 15:53:10,012 INFO L273 TraceCheckUtils]: 34: Hoare triple {4713#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4713#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-14 15:53:10,012 INFO L273 TraceCheckUtils]: 35: Hoare triple {4713#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4723#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-14 15:53:10,015 INFO L273 TraceCheckUtils]: 36: Hoare triple {4723#(= (_ bv10 32) main_~a~0)} assume true; {4723#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-14 15:53:10,015 INFO L273 TraceCheckUtils]: 37: Hoare triple {4723#(= (_ bv10 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4723#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-14 15:53:10,017 INFO L273 TraceCheckUtils]: 38: Hoare triple {4723#(= (_ bv10 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4733#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-14 15:53:10,017 INFO L273 TraceCheckUtils]: 39: Hoare triple {4733#(= (_ bv11 32) main_~a~0)} assume true; {4733#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-14 15:53:10,020 INFO L273 TraceCheckUtils]: 40: Hoare triple {4733#(= (_ bv11 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4733#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-14 15:53:10,020 INFO L273 TraceCheckUtils]: 41: Hoare triple {4733#(= (_ bv11 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4743#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-14 15:53:10,022 INFO L273 TraceCheckUtils]: 42: Hoare triple {4743#(= (_ bv12 32) main_~a~0)} assume true; {4743#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-14 15:53:10,025 INFO L273 TraceCheckUtils]: 43: Hoare triple {4743#(= (_ bv12 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4743#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-14 15:53:10,025 INFO L273 TraceCheckUtils]: 44: Hoare triple {4743#(= (_ bv12 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4753#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-14 15:53:10,028 INFO L273 TraceCheckUtils]: 45: Hoare triple {4753#(= (_ bv13 32) main_~a~0)} assume true; {4753#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-14 15:53:10,028 INFO L273 TraceCheckUtils]: 46: Hoare triple {4753#(= (_ bv13 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4753#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-14 15:53:10,031 INFO L273 TraceCheckUtils]: 47: Hoare triple {4753#(= (_ bv13 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4763#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-14 15:53:10,031 INFO L273 TraceCheckUtils]: 48: Hoare triple {4763#(= (_ bv14 32) main_~a~0)} assume true; {4763#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-14 15:53:10,034 INFO L273 TraceCheckUtils]: 49: Hoare triple {4763#(= (_ bv14 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4763#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-14 15:53:10,034 INFO L273 TraceCheckUtils]: 50: Hoare triple {4763#(= (_ bv14 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4773#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-14 15:53:10,037 INFO L273 TraceCheckUtils]: 51: Hoare triple {4773#(= (_ bv15 32) main_~a~0)} assume true; {4773#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-14 15:53:10,037 INFO L273 TraceCheckUtils]: 52: Hoare triple {4773#(= (_ bv15 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4773#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-14 15:53:10,040 INFO L273 TraceCheckUtils]: 53: Hoare triple {4773#(= (_ bv15 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4783#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-14 15:53:10,040 INFO L273 TraceCheckUtils]: 54: Hoare triple {4783#(= (_ bv16 32) main_~a~0)} assume true; {4783#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-14 15:53:10,043 INFO L273 TraceCheckUtils]: 55: Hoare triple {4783#(= (_ bv16 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4783#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-14 15:53:10,043 INFO L273 TraceCheckUtils]: 56: Hoare triple {4783#(= (_ bv16 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4793#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-14 15:53:10,046 INFO L273 TraceCheckUtils]: 57: Hoare triple {4793#(= (_ bv17 32) main_~a~0)} assume true; {4793#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-14 15:53:10,046 INFO L273 TraceCheckUtils]: 58: Hoare triple {4793#(= (_ bv17 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4793#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-14 15:53:10,048 INFO L273 TraceCheckUtils]: 59: Hoare triple {4793#(= (_ bv17 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4803#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-14 15:53:10,048 INFO L273 TraceCheckUtils]: 60: Hoare triple {4803#(= (_ bv18 32) main_~a~0)} assume true; {4803#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-14 15:53:10,050 INFO L273 TraceCheckUtils]: 61: Hoare triple {4803#(= (_ bv18 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4803#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-14 15:53:10,050 INFO L273 TraceCheckUtils]: 62: Hoare triple {4803#(= (_ bv18 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4813#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-14 15:53:10,053 INFO L273 TraceCheckUtils]: 63: Hoare triple {4813#(= (_ bv19 32) main_~a~0)} assume true; {4813#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-14 15:53:10,053 INFO L273 TraceCheckUtils]: 64: Hoare triple {4813#(= (_ bv19 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4813#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-14 15:53:10,055 INFO L273 TraceCheckUtils]: 65: Hoare triple {4813#(= (_ bv19 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4823#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-14 15:53:10,069 INFO L273 TraceCheckUtils]: 66: Hoare triple {4823#(= (_ bv20 32) main_~a~0)} assume true; {4823#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-14 15:53:10,078 INFO L273 TraceCheckUtils]: 67: Hoare triple {4823#(= (_ bv20 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4823#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-14 15:53:10,080 INFO L273 TraceCheckUtils]: 68: Hoare triple {4823#(= (_ bv20 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4833#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-14 15:53:10,080 INFO L273 TraceCheckUtils]: 69: Hoare triple {4833#(= (_ bv21 32) main_~a~0)} assume true; {4833#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-14 15:53:10,082 INFO L273 TraceCheckUtils]: 70: Hoare triple {4833#(= (_ bv21 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4833#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-14 15:53:10,082 INFO L273 TraceCheckUtils]: 71: Hoare triple {4833#(= (_ bv21 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4843#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-14 15:53:10,084 INFO L273 TraceCheckUtils]: 72: Hoare triple {4843#(= (_ bv22 32) main_~a~0)} assume true; {4843#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-14 15:53:10,084 INFO L273 TraceCheckUtils]: 73: Hoare triple {4843#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {4604#false} is VALID [2018-11-14 15:53:10,084 INFO L273 TraceCheckUtils]: 74: Hoare triple {4604#false} havoc ~i~0;~i~0 := 0bv32; {4604#false} is VALID [2018-11-14 15:53:10,084 INFO L273 TraceCheckUtils]: 75: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,084 INFO L273 TraceCheckUtils]: 76: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4604#false} is VALID [2018-11-14 15:53:10,085 INFO L273 TraceCheckUtils]: 77: Hoare triple {4604#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4604#false} is VALID [2018-11-14 15:53:10,085 INFO L273 TraceCheckUtils]: 78: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,085 INFO L273 TraceCheckUtils]: 79: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4604#false} is VALID [2018-11-14 15:53:10,085 INFO L273 TraceCheckUtils]: 80: Hoare triple {4604#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4604#false} is VALID [2018-11-14 15:53:10,085 INFO L273 TraceCheckUtils]: 81: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,086 INFO L273 TraceCheckUtils]: 82: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4604#false} is VALID [2018-11-14 15:53:10,086 INFO L273 TraceCheckUtils]: 83: Hoare triple {4604#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4604#false} is VALID [2018-11-14 15:53:10,086 INFO L273 TraceCheckUtils]: 84: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,087 INFO L273 TraceCheckUtils]: 85: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4604#false} is VALID [2018-11-14 15:53:10,087 INFO L273 TraceCheckUtils]: 86: Hoare triple {4604#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4604#false} is VALID [2018-11-14 15:53:10,087 INFO L273 TraceCheckUtils]: 87: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,087 INFO L273 TraceCheckUtils]: 88: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-14 15:53:10,088 INFO L273 TraceCheckUtils]: 89: Hoare triple {4604#false} ~i~0 := 0bv32; {4604#false} is VALID [2018-11-14 15:53:10,088 INFO L273 TraceCheckUtils]: 90: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,088 INFO L273 TraceCheckUtils]: 91: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4604#false} is VALID [2018-11-14 15:53:10,088 INFO L273 TraceCheckUtils]: 92: Hoare triple {4604#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4604#false} is VALID [2018-11-14 15:53:10,088 INFO L273 TraceCheckUtils]: 93: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,088 INFO L273 TraceCheckUtils]: 94: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4604#false} is VALID [2018-11-14 15:53:10,089 INFO L273 TraceCheckUtils]: 95: Hoare triple {4604#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4604#false} is VALID [2018-11-14 15:53:10,089 INFO L273 TraceCheckUtils]: 96: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,089 INFO L273 TraceCheckUtils]: 97: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4604#false} is VALID [2018-11-14 15:53:10,089 INFO L273 TraceCheckUtils]: 98: Hoare triple {4604#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4604#false} is VALID [2018-11-14 15:53:10,089 INFO L273 TraceCheckUtils]: 99: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,089 INFO L273 TraceCheckUtils]: 100: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4604#false} is VALID [2018-11-14 15:53:10,090 INFO L273 TraceCheckUtils]: 101: Hoare triple {4604#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4604#false} is VALID [2018-11-14 15:53:10,090 INFO L273 TraceCheckUtils]: 102: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,090 INFO L273 TraceCheckUtils]: 103: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-14 15:53:10,090 INFO L273 TraceCheckUtils]: 104: Hoare triple {4604#false} ~i~0 := 0bv32; {4604#false} is VALID [2018-11-14 15:53:10,090 INFO L273 TraceCheckUtils]: 105: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,090 INFO L273 TraceCheckUtils]: 106: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4604#false} is VALID [2018-11-14 15:53:10,091 INFO L273 TraceCheckUtils]: 107: Hoare triple {4604#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4604#false} is VALID [2018-11-14 15:53:10,091 INFO L273 TraceCheckUtils]: 108: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,091 INFO L273 TraceCheckUtils]: 109: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4604#false} is VALID [2018-11-14 15:53:10,091 INFO L273 TraceCheckUtils]: 110: Hoare triple {4604#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4604#false} is VALID [2018-11-14 15:53:10,091 INFO L273 TraceCheckUtils]: 111: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,091 INFO L273 TraceCheckUtils]: 112: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4604#false} is VALID [2018-11-14 15:53:10,092 INFO L273 TraceCheckUtils]: 113: Hoare triple {4604#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4604#false} is VALID [2018-11-14 15:53:10,092 INFO L273 TraceCheckUtils]: 114: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,092 INFO L273 TraceCheckUtils]: 115: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4604#false} is VALID [2018-11-14 15:53:10,092 INFO L273 TraceCheckUtils]: 116: Hoare triple {4604#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4604#false} is VALID [2018-11-14 15:53:10,092 INFO L273 TraceCheckUtils]: 117: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,093 INFO L273 TraceCheckUtils]: 118: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-14 15:53:10,093 INFO L273 TraceCheckUtils]: 119: Hoare triple {4604#false} ~i~0 := 0bv32; {4604#false} is VALID [2018-11-14 15:53:10,093 INFO L273 TraceCheckUtils]: 120: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,093 INFO L273 TraceCheckUtils]: 121: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4604#false} is VALID [2018-11-14 15:53:10,093 INFO L273 TraceCheckUtils]: 122: Hoare triple {4604#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4604#false} is VALID [2018-11-14 15:53:10,093 INFO L273 TraceCheckUtils]: 123: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,094 INFO L273 TraceCheckUtils]: 124: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4604#false} is VALID [2018-11-14 15:53:10,094 INFO L273 TraceCheckUtils]: 125: Hoare triple {4604#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4604#false} is VALID [2018-11-14 15:53:10,094 INFO L273 TraceCheckUtils]: 126: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,094 INFO L273 TraceCheckUtils]: 127: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4604#false} is VALID [2018-11-14 15:53:10,094 INFO L273 TraceCheckUtils]: 128: Hoare triple {4604#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4604#false} is VALID [2018-11-14 15:53:10,094 INFO L273 TraceCheckUtils]: 129: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,095 INFO L273 TraceCheckUtils]: 130: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4604#false} is VALID [2018-11-14 15:53:10,095 INFO L273 TraceCheckUtils]: 131: Hoare triple {4604#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4604#false} is VALID [2018-11-14 15:53:10,095 INFO L273 TraceCheckUtils]: 132: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,095 INFO L273 TraceCheckUtils]: 133: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-14 15:53:10,095 INFO L273 TraceCheckUtils]: 134: Hoare triple {4604#false} havoc ~x~0;~x~0 := 0bv32; {4604#false} is VALID [2018-11-14 15:53:10,095 INFO L273 TraceCheckUtils]: 135: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:10,096 INFO L273 TraceCheckUtils]: 136: Hoare triple {4604#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {4604#false} is VALID [2018-11-14 15:53:10,096 INFO L256 TraceCheckUtils]: 137: Hoare triple {4604#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {4604#false} is VALID [2018-11-14 15:53:10,096 INFO L273 TraceCheckUtils]: 138: Hoare triple {4604#false} ~cond := #in~cond; {4604#false} is VALID [2018-11-14 15:53:10,096 INFO L273 TraceCheckUtils]: 139: Hoare triple {4604#false} assume ~cond == 0bv32; {4604#false} is VALID [2018-11-14 15:53:10,096 INFO L273 TraceCheckUtils]: 140: Hoare triple {4604#false} assume !false; {4604#false} is VALID [2018-11-14 15:53:10,112 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 15:53:10,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:53:12,483 INFO L273 TraceCheckUtils]: 140: Hoare triple {4604#false} assume !false; {4604#false} is VALID [2018-11-14 15:53:12,483 INFO L273 TraceCheckUtils]: 139: Hoare triple {4604#false} assume ~cond == 0bv32; {4604#false} is VALID [2018-11-14 15:53:12,484 INFO L273 TraceCheckUtils]: 138: Hoare triple {4604#false} ~cond := #in~cond; {4604#false} is VALID [2018-11-14 15:53:12,484 INFO L256 TraceCheckUtils]: 137: Hoare triple {4604#false} call __VERIFIER_assert((if #t~mem11 == #t~mem12 then 1bv32 else 0bv32)); {4604#false} is VALID [2018-11-14 15:53:12,484 INFO L273 TraceCheckUtils]: 136: Hoare triple {4604#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem12 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {4604#false} is VALID [2018-11-14 15:53:12,484 INFO L273 TraceCheckUtils]: 135: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,484 INFO L273 TraceCheckUtils]: 134: Hoare triple {4604#false} havoc ~x~0;~x~0 := 0bv32; {4604#false} is VALID [2018-11-14 15:53:12,484 INFO L273 TraceCheckUtils]: 133: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-14 15:53:12,484 INFO L273 TraceCheckUtils]: 132: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,485 INFO L273 TraceCheckUtils]: 131: Hoare triple {4604#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4604#false} is VALID [2018-11-14 15:53:12,485 INFO L273 TraceCheckUtils]: 130: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4604#false} is VALID [2018-11-14 15:53:12,485 INFO L273 TraceCheckUtils]: 129: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,485 INFO L273 TraceCheckUtils]: 128: Hoare triple {4604#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4604#false} is VALID [2018-11-14 15:53:12,485 INFO L273 TraceCheckUtils]: 127: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4604#false} is VALID [2018-11-14 15:53:12,485 INFO L273 TraceCheckUtils]: 126: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,485 INFO L273 TraceCheckUtils]: 125: Hoare triple {4604#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4604#false} is VALID [2018-11-14 15:53:12,485 INFO L273 TraceCheckUtils]: 124: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4604#false} is VALID [2018-11-14 15:53:12,486 INFO L273 TraceCheckUtils]: 123: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,486 INFO L273 TraceCheckUtils]: 122: Hoare triple {4604#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4604#false} is VALID [2018-11-14 15:53:12,486 INFO L273 TraceCheckUtils]: 121: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4604#false} is VALID [2018-11-14 15:53:12,486 INFO L273 TraceCheckUtils]: 120: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,486 INFO L273 TraceCheckUtils]: 119: Hoare triple {4604#false} ~i~0 := 0bv32; {4604#false} is VALID [2018-11-14 15:53:12,486 INFO L273 TraceCheckUtils]: 118: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-14 15:53:12,486 INFO L273 TraceCheckUtils]: 117: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,486 INFO L273 TraceCheckUtils]: 116: Hoare triple {4604#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4604#false} is VALID [2018-11-14 15:53:12,487 INFO L273 TraceCheckUtils]: 115: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4604#false} is VALID [2018-11-14 15:53:12,487 INFO L273 TraceCheckUtils]: 114: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,487 INFO L273 TraceCheckUtils]: 113: Hoare triple {4604#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4604#false} is VALID [2018-11-14 15:53:12,487 INFO L273 TraceCheckUtils]: 112: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4604#false} is VALID [2018-11-14 15:53:12,487 INFO L273 TraceCheckUtils]: 111: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,487 INFO L273 TraceCheckUtils]: 110: Hoare triple {4604#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4604#false} is VALID [2018-11-14 15:53:12,487 INFO L273 TraceCheckUtils]: 109: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4604#false} is VALID [2018-11-14 15:53:12,487 INFO L273 TraceCheckUtils]: 108: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,487 INFO L273 TraceCheckUtils]: 107: Hoare triple {4604#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4604#false} is VALID [2018-11-14 15:53:12,488 INFO L273 TraceCheckUtils]: 106: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4604#false} is VALID [2018-11-14 15:53:12,488 INFO L273 TraceCheckUtils]: 105: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,488 INFO L273 TraceCheckUtils]: 104: Hoare triple {4604#false} ~i~0 := 0bv32; {4604#false} is VALID [2018-11-14 15:53:12,488 INFO L273 TraceCheckUtils]: 103: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-14 15:53:12,488 INFO L273 TraceCheckUtils]: 102: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,488 INFO L273 TraceCheckUtils]: 101: Hoare triple {4604#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4604#false} is VALID [2018-11-14 15:53:12,488 INFO L273 TraceCheckUtils]: 100: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4604#false} is VALID [2018-11-14 15:53:12,489 INFO L273 TraceCheckUtils]: 99: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,489 INFO L273 TraceCheckUtils]: 98: Hoare triple {4604#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4604#false} is VALID [2018-11-14 15:53:12,489 INFO L273 TraceCheckUtils]: 97: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4604#false} is VALID [2018-11-14 15:53:12,489 INFO L273 TraceCheckUtils]: 96: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,489 INFO L273 TraceCheckUtils]: 95: Hoare triple {4604#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4604#false} is VALID [2018-11-14 15:53:12,490 INFO L273 TraceCheckUtils]: 94: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4604#false} is VALID [2018-11-14 15:53:12,490 INFO L273 TraceCheckUtils]: 93: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,490 INFO L273 TraceCheckUtils]: 92: Hoare triple {4604#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4604#false} is VALID [2018-11-14 15:53:12,490 INFO L273 TraceCheckUtils]: 91: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4604#false} is VALID [2018-11-14 15:53:12,490 INFO L273 TraceCheckUtils]: 90: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,490 INFO L273 TraceCheckUtils]: 89: Hoare triple {4604#false} ~i~0 := 0bv32; {4604#false} is VALID [2018-11-14 15:53:12,491 INFO L273 TraceCheckUtils]: 88: Hoare triple {4604#false} assume !~bvslt32(~i~0, 100000bv32); {4604#false} is VALID [2018-11-14 15:53:12,491 INFO L273 TraceCheckUtils]: 87: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,491 INFO L273 TraceCheckUtils]: 86: Hoare triple {4604#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4604#false} is VALID [2018-11-14 15:53:12,491 INFO L273 TraceCheckUtils]: 85: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4604#false} is VALID [2018-11-14 15:53:12,491 INFO L273 TraceCheckUtils]: 84: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,492 INFO L273 TraceCheckUtils]: 83: Hoare triple {4604#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4604#false} is VALID [2018-11-14 15:53:12,492 INFO L273 TraceCheckUtils]: 82: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4604#false} is VALID [2018-11-14 15:53:12,492 INFO L273 TraceCheckUtils]: 81: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,492 INFO L273 TraceCheckUtils]: 80: Hoare triple {4604#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4604#false} is VALID [2018-11-14 15:53:12,492 INFO L273 TraceCheckUtils]: 79: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4604#false} is VALID [2018-11-14 15:53:12,492 INFO L273 TraceCheckUtils]: 78: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,493 INFO L273 TraceCheckUtils]: 77: Hoare triple {4604#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4604#false} is VALID [2018-11-14 15:53:12,493 INFO L273 TraceCheckUtils]: 76: Hoare triple {4604#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4604#false} is VALID [2018-11-14 15:53:12,493 INFO L273 TraceCheckUtils]: 75: Hoare triple {4604#false} assume true; {4604#false} is VALID [2018-11-14 15:53:12,493 INFO L273 TraceCheckUtils]: 74: Hoare triple {4604#false} havoc ~i~0;~i~0 := 0bv32; {4604#false} is VALID [2018-11-14 15:53:12,514 INFO L273 TraceCheckUtils]: 73: Hoare triple {5252#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {4604#false} is VALID [2018-11-14 15:53:12,529 INFO L273 TraceCheckUtils]: 72: Hoare triple {5252#(bvslt main_~a~0 (_ bv100000 32))} assume true; {5252#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:53:12,538 INFO L273 TraceCheckUtils]: 71: Hoare triple {5259#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5252#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-14 15:53:12,552 INFO L273 TraceCheckUtils]: 70: Hoare triple {5259#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5259#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,560 INFO L273 TraceCheckUtils]: 69: Hoare triple {5259#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume true; {5259#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,574 INFO L273 TraceCheckUtils]: 68: Hoare triple {5269#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5259#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,583 INFO L273 TraceCheckUtils]: 67: Hoare triple {5269#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5269#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,595 INFO L273 TraceCheckUtils]: 66: Hoare triple {5269#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume true; {5269#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,600 INFO L273 TraceCheckUtils]: 65: Hoare triple {5279#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5269#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,600 INFO L273 TraceCheckUtils]: 64: Hoare triple {5279#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5279#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,601 INFO L273 TraceCheckUtils]: 63: Hoare triple {5279#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume true; {5279#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,604 INFO L273 TraceCheckUtils]: 62: Hoare triple {5289#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5279#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,605 INFO L273 TraceCheckUtils]: 61: Hoare triple {5289#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5289#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,605 INFO L273 TraceCheckUtils]: 60: Hoare triple {5289#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume true; {5289#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,611 INFO L273 TraceCheckUtils]: 59: Hoare triple {5299#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5289#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,611 INFO L273 TraceCheckUtils]: 58: Hoare triple {5299#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5299#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,612 INFO L273 TraceCheckUtils]: 57: Hoare triple {5299#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume true; {5299#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,615 INFO L273 TraceCheckUtils]: 56: Hoare triple {5309#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5299#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,616 INFO L273 TraceCheckUtils]: 55: Hoare triple {5309#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5309#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,617 INFO L273 TraceCheckUtils]: 54: Hoare triple {5309#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume true; {5309#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,622 INFO L273 TraceCheckUtils]: 53: Hoare triple {5319#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5309#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,623 INFO L273 TraceCheckUtils]: 52: Hoare triple {5319#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5319#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,623 INFO L273 TraceCheckUtils]: 51: Hoare triple {5319#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume true; {5319#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,629 INFO L273 TraceCheckUtils]: 50: Hoare triple {5329#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5319#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,629 INFO L273 TraceCheckUtils]: 49: Hoare triple {5329#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5329#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,630 INFO L273 TraceCheckUtils]: 48: Hoare triple {5329#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume true; {5329#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,636 INFO L273 TraceCheckUtils]: 47: Hoare triple {5339#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5329#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,637 INFO L273 TraceCheckUtils]: 46: Hoare triple {5339#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5339#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,637 INFO L273 TraceCheckUtils]: 45: Hoare triple {5339#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume true; {5339#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,644 INFO L273 TraceCheckUtils]: 44: Hoare triple {5349#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5339#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,644 INFO L273 TraceCheckUtils]: 43: Hoare triple {5349#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5349#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,645 INFO L273 TraceCheckUtils]: 42: Hoare triple {5349#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume true; {5349#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,652 INFO L273 TraceCheckUtils]: 41: Hoare triple {5359#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5349#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,652 INFO L273 TraceCheckUtils]: 40: Hoare triple {5359#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5359#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,652 INFO L273 TraceCheckUtils]: 39: Hoare triple {5359#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume true; {5359#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,660 INFO L273 TraceCheckUtils]: 38: Hoare triple {5369#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5359#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,661 INFO L273 TraceCheckUtils]: 37: Hoare triple {5369#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5369#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,661 INFO L273 TraceCheckUtils]: 36: Hoare triple {5369#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume true; {5369#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,666 INFO L273 TraceCheckUtils]: 35: Hoare triple {5379#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5369#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,667 INFO L273 TraceCheckUtils]: 34: Hoare triple {5379#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5379#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,667 INFO L273 TraceCheckUtils]: 33: Hoare triple {5379#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume true; {5379#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,673 INFO L273 TraceCheckUtils]: 32: Hoare triple {5389#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5379#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,673 INFO L273 TraceCheckUtils]: 31: Hoare triple {5389#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5389#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,674 INFO L273 TraceCheckUtils]: 30: Hoare triple {5389#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume true; {5389#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,679 INFO L273 TraceCheckUtils]: 29: Hoare triple {5399#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5389#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,679 INFO L273 TraceCheckUtils]: 28: Hoare triple {5399#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5399#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,680 INFO L273 TraceCheckUtils]: 27: Hoare triple {5399#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume true; {5399#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,697 INFO L273 TraceCheckUtils]: 26: Hoare triple {5409#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5399#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,698 INFO L273 TraceCheckUtils]: 25: Hoare triple {5409#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5409#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,698 INFO L273 TraceCheckUtils]: 24: Hoare triple {5409#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume true; {5409#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,702 INFO L273 TraceCheckUtils]: 23: Hoare triple {5419#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5409#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,703 INFO L273 TraceCheckUtils]: 22: Hoare triple {5419#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5419#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,703 INFO L273 TraceCheckUtils]: 21: Hoare triple {5419#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume true; {5419#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,711 INFO L273 TraceCheckUtils]: 20: Hoare triple {5429#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5419#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,712 INFO L273 TraceCheckUtils]: 19: Hoare triple {5429#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5429#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,712 INFO L273 TraceCheckUtils]: 18: Hoare triple {5429#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume true; {5429#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,717 INFO L273 TraceCheckUtils]: 17: Hoare triple {5439#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5429#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,718 INFO L273 TraceCheckUtils]: 16: Hoare triple {5439#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5439#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,718 INFO L273 TraceCheckUtils]: 15: Hoare triple {5439#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume true; {5439#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {5449#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5439#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {5449#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5449#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,725 INFO L273 TraceCheckUtils]: 12: Hoare triple {5449#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume true; {5449#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,732 INFO L273 TraceCheckUtils]: 11: Hoare triple {5459#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5449#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,733 INFO L273 TraceCheckUtils]: 10: Hoare triple {5459#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5459#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,733 INFO L273 TraceCheckUtils]: 9: Hoare triple {5459#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume true; {5459#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,740 INFO L273 TraceCheckUtils]: 8: Hoare triple {5469#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5459#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,740 INFO L273 TraceCheckUtils]: 7: Hoare triple {5469#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5469#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,740 INFO L273 TraceCheckUtils]: 6: Hoare triple {5469#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume true; {5469#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,741 INFO L273 TraceCheckUtils]: 5: Hoare triple {4603#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {5469#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:53:12,741 INFO L256 TraceCheckUtils]: 4: Hoare triple {4603#true} call #t~ret13 := main(); {4603#true} is VALID [2018-11-14 15:53:12,742 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4603#true} {4603#true} #111#return; {4603#true} is VALID [2018-11-14 15:53:12,742 INFO L273 TraceCheckUtils]: 2: Hoare triple {4603#true} assume true; {4603#true} is VALID [2018-11-14 15:53:12,742 INFO L273 TraceCheckUtils]: 1: Hoare triple {4603#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4603#true} is VALID [2018-11-14 15:53:12,742 INFO L256 TraceCheckUtils]: 0: Hoare triple {4603#true} call ULTIMATE.init(); {4603#true} is VALID [2018-11-14 15:53:12,759 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 737 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2018-11-14 15:53:12,761 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:53:12,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-14 15:53:12,762 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 141 [2018-11-14 15:53:12,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:53:12,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-14 15:53:13,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:53:13,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-14 15:53:13,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-14 15:53:13,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-14 15:53:13,118 INFO L87 Difference]: Start difference. First operand 146 states and 151 transitions. Second operand 48 states. [2018-11-14 15:53:18,532 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-14 15:53:18,995 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-14 15:53:19,493 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-14 15:53:20,020 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-14 15:53:20,601 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-14 15:53:21,449 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-14 15:53:22,617 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 7 [2018-11-14 15:53:29,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:29,825 INFO L93 Difference]: Finished difference Result 290 states and 323 transitions. [2018-11-14 15:53:29,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-14 15:53:29,825 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 141 [2018-11-14 15:53:29,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:53:29,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:53:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 235 transitions. [2018-11-14 15:53:29,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 15:53:29,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 235 transitions. [2018-11-14 15:53:29,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 235 transitions. [2018-11-14 15:53:30,244 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:53:30,248 INFO L225 Difference]: With dead ends: 290 [2018-11-14 15:53:30,248 INFO L226 Difference]: Without dead ends: 218 [2018-11-14 15:53:30,250 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-14 15:53:30,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-11-14 15:53:30,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 218. [2018-11-14 15:53:30,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:53:30,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 218 states. Second operand 218 states. [2018-11-14 15:53:30,861 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 218 states. [2018-11-14 15:53:30,862 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 218 states. [2018-11-14 15:53:30,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:30,869 INFO L93 Difference]: Finished difference Result 218 states and 223 transitions. [2018-11-14 15:53:30,870 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 223 transitions. [2018-11-14 15:53:30,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:53:30,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:53:30,870 INFO L74 IsIncluded]: Start isIncluded. First operand 218 states. Second operand 218 states. [2018-11-14 15:53:30,871 INFO L87 Difference]: Start difference. First operand 218 states. Second operand 218 states. [2018-11-14 15:53:30,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:53:30,878 INFO L93 Difference]: Finished difference Result 218 states and 223 transitions. [2018-11-14 15:53:30,878 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 223 transitions. [2018-11-14 15:53:30,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:53:30,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:53:30,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:53:30,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:53:30,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-11-14 15:53:30,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 223 transitions. [2018-11-14 15:53:30,886 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 223 transitions. Word has length 141 [2018-11-14 15:53:30,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:53:30,887 INFO L480 AbstractCegarLoop]: Abstraction has 218 states and 223 transitions. [2018-11-14 15:53:30,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-14 15:53:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 223 transitions. [2018-11-14 15:53:30,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-11-14 15:53:30,890 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:53:30,890 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:53:30,890 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:53:30,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:53:30,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1778537809, now seen corresponding path program 5 times [2018-11-14 15:53:30,891 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:53:30,891 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 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 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:53:30,921 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1