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-Const.epf -i ../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call2_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:40:20,772 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:40:20,774 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:40:20,787 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:40:20,788 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:40:20,789 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:40:20,790 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:40:20,792 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:40:20,794 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:40:20,795 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:40:20,796 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:40:20,797 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:40:20,798 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:40:20,799 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:40:20,800 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:40:20,801 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:40:20,802 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:40:20,804 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:40:20,806 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:40:20,808 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:40:20,809 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:40:20,810 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:40:20,813 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:40:20,813 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:40:20,814 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:40:20,815 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:40:20,816 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:40:20,817 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:40:20,817 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:40:20,819 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:40:20,819 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:40:20,820 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:40:20,820 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:40:20,820 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:40:20,822 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:40:20,823 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:40:20,823 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector-Const.epf [2018-11-14 17:40:20,855 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:40:20,855 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:40:20,856 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:40:20,856 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:40:20,857 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:40:20,857 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:40:20,857 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:40:20,858 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:40:20,858 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:40:20,858 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:40:20,858 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:40:20,858 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:40:20,859 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:40:20,859 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:40:20,859 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 17:40:20,859 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 17:40:20,859 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:40:20,860 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:40:20,861 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-14 17:40:20,861 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:40:20,861 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:40:20,861 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:40:20,862 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:40:20,862 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:40:20,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:40:20,862 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:40:20,862 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:40:20,863 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:40:20,863 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 17:40:20,864 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:40:20,864 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 17:40:20,864 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 17:40:20,864 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:40:20,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:40:20,952 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:40:20,955 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:40:20,957 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:40:20,957 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:40:20,958 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call2_ground.i [2018-11-14 17:40:21,025 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/575602353/920267da2bc24cbb921372cd6db51b13/FLAGe95a7d983 [2018-11-14 17:40:21,541 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:40:21,542 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call2_ground.i [2018-11-14 17:40:21,548 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/575602353/920267da2bc24cbb921372cd6db51b13/FLAGe95a7d983 [2018-11-14 17:40:21,563 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/575602353/920267da2bc24cbb921372cd6db51b13 [2018-11-14 17:40:21,575 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:40:21,576 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:40:21,577 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:40:21,578 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:40:21,582 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:40:21,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:40:21" (1/1) ... [2018-11-14 17:40:21,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44816825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:40:21, skipping insertion in model container [2018-11-14 17:40:21,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:40:21" (1/1) ... [2018-11-14 17:40:21,597 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:40:21,618 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:40:21,875 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:40:21,880 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:40:21,914 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:40:21,940 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:40:21,941 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:40:21 WrapperNode [2018-11-14 17:40:21,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:40:21,942 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:40:21,942 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:40:21,942 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:40:21,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:40:21" (1/1) ... [2018-11-14 17:40:21,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:40:21" (1/1) ... [2018-11-14 17:40:21,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:40:21" (1/1) ... [2018-11-14 17:40:21,973 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:40:21" (1/1) ... [2018-11-14 17:40:21,992 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:40:21" (1/1) ... [2018-11-14 17:40:22,003 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:40:21" (1/1) ... [2018-11-14 17:40:22,005 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:40:21" (1/1) ... [2018-11-14 17:40:22,008 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:40:22,009 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:40:22,009 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:40:22,010 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:40:22,011 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:40:21" (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 17:40:22,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:40:22,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:40:22,165 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 17:40:22,166 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:40:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:40:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 17:40:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:40:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:40:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 17:40:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 17:40:22,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:40:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:40:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:40:22,167 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 17:40:23,172 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:40:23,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:40:23 BoogieIcfgContainer [2018-11-14 17:40:23,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:40:23,174 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:40:23,174 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:40:23,177 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:40:23,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:40:21" (1/3) ... [2018-11-14 17:40:23,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a5cfd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:40:23, skipping insertion in model container [2018-11-14 17:40:23,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:40:21" (2/3) ... [2018-11-14 17:40:23,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a5cfd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:40:23, skipping insertion in model container [2018-11-14 17:40:23,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:40:23" (3/3) ... [2018-11-14 17:40:23,181 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_false-unreach-call2_ground.i [2018-11-14 17:40:23,191 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:40:23,198 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:40:23,216 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:40:23,250 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:40:23,251 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:40:23,251 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:40:23,251 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:40:23,251 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:40:23,252 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:40:23,252 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:40:23,252 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:40:23,252 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:40:23,271 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-14 17:40:23,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:40:23,279 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:40:23,280 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:40:23,282 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:40:23,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:40:23,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1734015145, now seen corresponding path program 1 times [2018-11-14 17:40:23,294 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:40:23,295 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 17:40:23,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:40:23,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:23,392 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:40:23,458 INFO L256 TraceCheckUtils]: 0: Hoare triple {52#true} call ULTIMATE.init(); {52#true} is VALID [2018-11-14 17:40:23,462 INFO L273 TraceCheckUtils]: 1: Hoare triple {52#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {52#true} is VALID [2018-11-14 17:40:23,462 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#true} assume true; {52#true} is VALID [2018-11-14 17:40:23,463 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52#true} {52#true} #137#return; {52#true} is VALID [2018-11-14 17:40:23,463 INFO L256 TraceCheckUtils]: 4: Hoare triple {52#true} call #t~ret15 := main(); {52#true} is VALID [2018-11-14 17:40:23,463 INFO L273 TraceCheckUtils]: 5: Hoare triple {52#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {52#true} is VALID [2018-11-14 17:40:23,465 INFO L273 TraceCheckUtils]: 6: Hoare triple {52#true} assume !true; {53#false} is VALID [2018-11-14 17:40:23,465 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#false} ~x~0 := 0bv32; {53#false} is VALID [2018-11-14 17:40:23,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {53#false} assume true; {53#false} is VALID [2018-11-14 17:40:23,466 INFO L273 TraceCheckUtils]: 9: Hoare triple {53#false} assume !!~bvslt32(~x~0, 100000bv32);~y~0 := ~bvadd32(1bv32, ~x~0); {53#false} is VALID [2018-11-14 17:40:23,466 INFO L273 TraceCheckUtils]: 10: Hoare triple {53#false} assume true; {53#false} is VALID [2018-11-14 17:40:23,466 INFO L273 TraceCheckUtils]: 11: Hoare triple {53#false} assume !!~bvslt32(~y~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {53#false} is VALID [2018-11-14 17:40:23,466 INFO L256 TraceCheckUtils]: 12: Hoare triple {53#false} call __VERIFIER_assert((if ~bvsle32(#t~mem13, #t~mem14) then 1bv32 else 0bv32)); {53#false} is VALID [2018-11-14 17:40:23,467 INFO L273 TraceCheckUtils]: 13: Hoare triple {53#false} ~cond := #in~cond; {53#false} is VALID [2018-11-14 17:40:23,467 INFO L273 TraceCheckUtils]: 14: Hoare triple {53#false} assume ~cond == 0bv32; {53#false} is VALID [2018-11-14 17:40:23,467 INFO L273 TraceCheckUtils]: 15: Hoare triple {53#false} assume !false; {53#false} is VALID [2018-11-14 17:40:23,470 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 17:40:23,470 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:40:23,474 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:40:23,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:40:23,480 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:40:23,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:40:23,487 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:40:23,540 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:23,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:40:23,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:40:23,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:40:23,555 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-11-14 17:40:23,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:23,889 INFO L93 Difference]: Finished difference Result 92 states and 131 transitions. [2018-11-14 17:40:23,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:40:23,890 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 17:40:23,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:40:23,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:40:23,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 131 transitions. [2018-11-14 17:40:23,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:40:23,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 131 transitions. [2018-11-14 17:40:23,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 131 transitions. [2018-11-14 17:40:24,714 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:24,729 INFO L225 Difference]: With dead ends: 92 [2018-11-14 17:40:24,729 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 17:40:24,734 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 15 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 17:40:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 17:40:24,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 17:40:24,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:40:24,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 17:40:24,805 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:40:24,805 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:40:24,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:24,812 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-14 17:40:24,812 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-14 17:40:24,813 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:24,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:24,814 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 17:40:24,814 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 17:40:24,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:24,820 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-14 17:40:24,820 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-14 17:40:24,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:24,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:24,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:40:24,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:40:24,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 17:40:24,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-14 17:40:24,828 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 16 [2018-11-14 17:40:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:40:24,829 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-14 17:40:24,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:40:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-14 17:40:24,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 17:40:24,831 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:40:24,831 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:40:24,831 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:40:24,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:40:24,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1030099958, now seen corresponding path program 1 times [2018-11-14 17:40:24,832 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:40:24,832 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 17:40:24,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:40:24,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:24,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:40:24,958 INFO L256 TraceCheckUtils]: 0: Hoare triple {366#true} call ULTIMATE.init(); {366#true} is VALID [2018-11-14 17:40:24,959 INFO L273 TraceCheckUtils]: 1: Hoare triple {366#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {366#true} is VALID [2018-11-14 17:40:24,960 INFO L273 TraceCheckUtils]: 2: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-14 17:40:24,960 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} #137#return; {366#true} is VALID [2018-11-14 17:40:24,961 INFO L256 TraceCheckUtils]: 4: Hoare triple {366#true} call #t~ret15 := main(); {366#true} is VALID [2018-11-14 17:40:24,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {366#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {386#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:24,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {386#(= main_~i~0 (_ bv0 32))} assume true; {386#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:24,966 INFO L273 TraceCheckUtils]: 7: Hoare triple {386#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {367#false} is VALID [2018-11-14 17:40:24,967 INFO L273 TraceCheckUtils]: 8: Hoare triple {367#false} ~x~0 := 0bv32; {367#false} is VALID [2018-11-14 17:40:24,967 INFO L273 TraceCheckUtils]: 9: Hoare triple {367#false} assume true; {367#false} is VALID [2018-11-14 17:40:24,967 INFO L273 TraceCheckUtils]: 10: Hoare triple {367#false} assume !!~bvslt32(~x~0, 100000bv32);~y~0 := ~bvadd32(1bv32, ~x~0); {367#false} is VALID [2018-11-14 17:40:24,968 INFO L273 TraceCheckUtils]: 11: Hoare triple {367#false} assume true; {367#false} is VALID [2018-11-14 17:40:24,968 INFO L273 TraceCheckUtils]: 12: Hoare triple {367#false} assume !!~bvslt32(~y~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem14 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {367#false} is VALID [2018-11-14 17:40:24,969 INFO L256 TraceCheckUtils]: 13: Hoare triple {367#false} call __VERIFIER_assert((if ~bvsle32(#t~mem13, #t~mem14) then 1bv32 else 0bv32)); {367#false} is VALID [2018-11-14 17:40:24,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {367#false} ~cond := #in~cond; {367#false} is VALID [2018-11-14 17:40:24,970 INFO L273 TraceCheckUtils]: 15: Hoare triple {367#false} assume ~cond == 0bv32; {367#false} is VALID [2018-11-14 17:40:24,970 INFO L273 TraceCheckUtils]: 16: Hoare triple {367#false} assume !false; {367#false} is VALID [2018-11-14 17:40:24,972 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 17:40:24,972 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-14 17:40:24,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:40:24,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 17:40:24,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 17:40:24,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:40:24,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 17:40:25,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:25,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 17:40:25,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 17:40:25,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 17:40:25,049 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2018-11-14 17:40:25,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:25,524 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-11-14 17:40:25,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 17:40:25,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 17:40:25,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:40:25,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:40:25,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-14 17:40:25,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 17:40:25,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-14 17:40:25,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-14 17:40:25,892 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:25,897 INFO L225 Difference]: With dead ends: 82 [2018-11-14 17:40:25,897 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 17:40:25,898 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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 17:40:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 17:40:25,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2018-11-14 17:40:25,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:40:25,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 46 states. [2018-11-14 17:40:25,924 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 46 states. [2018-11-14 17:40:25,924 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 46 states. [2018-11-14 17:40:25,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:25,930 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-11-14 17:40:25,930 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-14 17:40:25,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:25,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:25,932 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 67 states. [2018-11-14 17:40:25,932 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 67 states. [2018-11-14 17:40:25,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:25,937 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-11-14 17:40:25,937 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-14 17:40:25,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:25,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:25,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:40:25,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:40:25,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 17:40:25,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-11-14 17:40:25,944 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 17 [2018-11-14 17:40:25,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:40:25,945 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-14 17:40:25,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 17:40:25,945 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-14 17:40:25,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:40:25,946 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:40:25,946 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] [2018-11-14 17:40:25,946 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:40:25,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:40:25,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1829402631, now seen corresponding path program 1 times [2018-11-14 17:40:25,947 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:40:25,948 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 17:40:25,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:40:26,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:26,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:26,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:40:26,145 INFO L256 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {723#true} is VALID [2018-11-14 17:40:26,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {723#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {723#true} is VALID [2018-11-14 17:40:26,146 INFO L273 TraceCheckUtils]: 2: Hoare triple {723#true} assume true; {723#true} is VALID [2018-11-14 17:40:26,146 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} #137#return; {723#true} is VALID [2018-11-14 17:40:26,146 INFO L256 TraceCheckUtils]: 4: Hoare triple {723#true} call #t~ret15 := main(); {723#true} is VALID [2018-11-14 17:40:26,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {723#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {743#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:26,152 INFO L273 TraceCheckUtils]: 6: Hoare triple {743#(= main_~i~0 (_ bv0 32))} assume true; {743#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:26,152 INFO L273 TraceCheckUtils]: 7: Hoare triple {743#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {750#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:26,154 INFO L273 TraceCheckUtils]: 8: Hoare triple {750#(= main_~k~0 (_ bv0 32))} assume true; {750#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:26,154 INFO L273 TraceCheckUtils]: 9: Hoare triple {750#(= main_~k~0 (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {724#false} is VALID [2018-11-14 17:40:26,155 INFO L273 TraceCheckUtils]: 10: Hoare triple {724#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {724#false} is VALID [2018-11-14 17:40:26,155 INFO L273 TraceCheckUtils]: 11: Hoare triple {724#false} ~x~0 := 0bv32; {724#false} is VALID [2018-11-14 17:40:26,156 INFO L273 TraceCheckUtils]: 12: Hoare triple {724#false} assume true; {724#false} is VALID [2018-11-14 17:40:26,156 INFO L273 TraceCheckUtils]: 13: Hoare triple {724#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {724#false} is VALID [2018-11-14 17:40:26,157 INFO L273 TraceCheckUtils]: 14: Hoare triple {724#false} assume true; {724#false} is VALID [2018-11-14 17:40:26,157 INFO L273 TraceCheckUtils]: 15: Hoare triple {724#false} assume !!~bvslt32(~y~0, ~i~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {724#false} is VALID [2018-11-14 17:40:26,158 INFO L256 TraceCheckUtils]: 16: Hoare triple {724#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {724#false} is VALID [2018-11-14 17:40:26,158 INFO L273 TraceCheckUtils]: 17: Hoare triple {724#false} ~cond := #in~cond; {724#false} is VALID [2018-11-14 17:40:26,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {724#false} assume ~cond == 0bv32; {724#false} is VALID [2018-11-14 17:40:26,159 INFO L273 TraceCheckUtils]: 19: Hoare triple {724#false} assume !false; {724#false} is VALID [2018-11-14 17:40:26,160 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 17:40:26,160 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:40:26,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:40:26,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:40:26,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-14 17:40:26,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:40:26,165 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:40:26,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:26,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:40:26,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:40:26,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:40:26,231 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 4 states. [2018-11-14 17:40:26,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:26,659 INFO L93 Difference]: Finished difference Result 109 states and 139 transitions. [2018-11-14 17:40:26,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:40:26,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-14 17:40:26,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:40:26,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:40:26,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2018-11-14 17:40:26,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:40:26,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2018-11-14 17:40:26,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2018-11-14 17:40:26,937 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:26,941 INFO L225 Difference]: With dead ends: 109 [2018-11-14 17:40:26,942 INFO L226 Difference]: Without dead ends: 71 [2018-11-14 17:40:26,944 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:40:26,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-14 17:40:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 48. [2018-11-14 17:40:26,990 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:40:26,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand 48 states. [2018-11-14 17:40:26,991 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand 48 states. [2018-11-14 17:40:26,991 INFO L87 Difference]: Start difference. First operand 71 states. Second operand 48 states. [2018-11-14 17:40:26,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:26,996 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-14 17:40:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-14 17:40:26,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:26,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:26,997 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 71 states. [2018-11-14 17:40:26,998 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 71 states. [2018-11-14 17:40:27,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:27,003 INFO L93 Difference]: Finished difference Result 71 states and 90 transitions. [2018-11-14 17:40:27,003 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 90 transitions. [2018-11-14 17:40:27,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:27,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:27,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:40:27,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:40:27,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-14 17:40:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-14 17:40:27,008 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 20 [2018-11-14 17:40:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:40:27,008 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-14 17:40:27,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:40:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-14 17:40:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 17:40:27,009 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:40:27,009 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] [2018-11-14 17:40:27,010 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:40:27,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:40:27,010 INFO L82 PathProgramCache]: Analyzing trace with hash 1435057265, now seen corresponding path program 1 times [2018-11-14 17:40:27,011 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:40:27,011 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 17:40:27,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:40:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:27,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:27,099 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:40:27,189 INFO L256 TraceCheckUtils]: 0: Hoare triple {1138#true} call ULTIMATE.init(); {1138#true} is VALID [2018-11-14 17:40:27,190 INFO L273 TraceCheckUtils]: 1: Hoare triple {1138#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1138#true} is VALID [2018-11-14 17:40:27,190 INFO L273 TraceCheckUtils]: 2: Hoare triple {1138#true} assume true; {1138#true} is VALID [2018-11-14 17:40:27,190 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1138#true} {1138#true} #137#return; {1138#true} is VALID [2018-11-14 17:40:27,191 INFO L256 TraceCheckUtils]: 4: Hoare triple {1138#true} call #t~ret15 := main(); {1138#true} is VALID [2018-11-14 17:40:27,191 INFO L273 TraceCheckUtils]: 5: Hoare triple {1138#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {1138#true} is VALID [2018-11-14 17:40:27,191 INFO L273 TraceCheckUtils]: 6: Hoare triple {1138#true} assume true; {1138#true} is VALID [2018-11-14 17:40:27,193 INFO L273 TraceCheckUtils]: 7: Hoare triple {1138#true} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {1164#(= main_~k~0 main_~i~0)} is VALID [2018-11-14 17:40:27,193 INFO L273 TraceCheckUtils]: 8: Hoare triple {1164#(= main_~k~0 main_~i~0)} assume true; {1164#(= main_~k~0 main_~i~0)} is VALID [2018-11-14 17:40:27,196 INFO L273 TraceCheckUtils]: 9: Hoare triple {1164#(= main_~k~0 main_~i~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {1164#(= main_~k~0 main_~i~0)} is VALID [2018-11-14 17:40:27,197 INFO L273 TraceCheckUtils]: 10: Hoare triple {1164#(= main_~k~0 main_~i~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {1174#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 17:40:27,198 INFO L273 TraceCheckUtils]: 11: Hoare triple {1174#(= main_~s~0 main_~i~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {1174#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 17:40:27,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {1174#(= main_~s~0 main_~i~0)} assume true; {1174#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 17:40:27,200 INFO L273 TraceCheckUtils]: 13: Hoare triple {1174#(= main_~s~0 main_~i~0)} assume !~bvslt32(~k~0, 100000bv32); {1174#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 17:40:27,201 INFO L273 TraceCheckUtils]: 14: Hoare triple {1174#(= main_~s~0 main_~i~0)} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1139#false} is VALID [2018-11-14 17:40:27,201 INFO L273 TraceCheckUtils]: 15: Hoare triple {1139#false} ~x~0 := 0bv32; {1139#false} is VALID [2018-11-14 17:40:27,201 INFO L273 TraceCheckUtils]: 16: Hoare triple {1139#false} assume true; {1139#false} is VALID [2018-11-14 17:40:27,201 INFO L273 TraceCheckUtils]: 17: Hoare triple {1139#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {1139#false} is VALID [2018-11-14 17:40:27,202 INFO L273 TraceCheckUtils]: 18: Hoare triple {1139#false} assume true; {1139#false} is VALID [2018-11-14 17:40:27,202 INFO L273 TraceCheckUtils]: 19: Hoare triple {1139#false} assume !!~bvslt32(~y~0, ~i~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {1139#false} is VALID [2018-11-14 17:40:27,202 INFO L256 TraceCheckUtils]: 20: Hoare triple {1139#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {1139#false} is VALID [2018-11-14 17:40:27,203 INFO L273 TraceCheckUtils]: 21: Hoare triple {1139#false} ~cond := #in~cond; {1139#false} is VALID [2018-11-14 17:40:27,203 INFO L273 TraceCheckUtils]: 22: Hoare triple {1139#false} assume ~cond == 0bv32; {1139#false} is VALID [2018-11-14 17:40:27,203 INFO L273 TraceCheckUtils]: 23: Hoare triple {1139#false} assume !false; {1139#false} is VALID [2018-11-14 17:40:27,205 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 17:40:27,205 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:40:27,308 INFO L273 TraceCheckUtils]: 23: Hoare triple {1139#false} assume !false; {1139#false} is VALID [2018-11-14 17:40:27,308 INFO L273 TraceCheckUtils]: 22: Hoare triple {1139#false} assume ~cond == 0bv32; {1139#false} is VALID [2018-11-14 17:40:27,309 INFO L273 TraceCheckUtils]: 21: Hoare triple {1139#false} ~cond := #in~cond; {1139#false} is VALID [2018-11-14 17:40:27,309 INFO L256 TraceCheckUtils]: 20: Hoare triple {1139#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {1139#false} is VALID [2018-11-14 17:40:27,309 INFO L273 TraceCheckUtils]: 19: Hoare triple {1139#false} assume !!~bvslt32(~y~0, ~i~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {1139#false} is VALID [2018-11-14 17:40:27,309 INFO L273 TraceCheckUtils]: 18: Hoare triple {1139#false} assume true; {1139#false} is VALID [2018-11-14 17:40:27,310 INFO L273 TraceCheckUtils]: 17: Hoare triple {1139#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {1139#false} is VALID [2018-11-14 17:40:27,310 INFO L273 TraceCheckUtils]: 16: Hoare triple {1139#false} assume true; {1139#false} is VALID [2018-11-14 17:40:27,310 INFO L273 TraceCheckUtils]: 15: Hoare triple {1139#false} ~x~0 := 0bv32; {1139#false} is VALID [2018-11-14 17:40:27,311 INFO L273 TraceCheckUtils]: 14: Hoare triple {1174#(= main_~s~0 main_~i~0)} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {1139#false} is VALID [2018-11-14 17:40:27,312 INFO L273 TraceCheckUtils]: 13: Hoare triple {1174#(= main_~s~0 main_~i~0)} assume !~bvslt32(~k~0, 100000bv32); {1174#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 17:40:27,312 INFO L273 TraceCheckUtils]: 12: Hoare triple {1174#(= main_~s~0 main_~i~0)} assume true; {1174#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 17:40:27,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {1174#(= main_~s~0 main_~i~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {1174#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 17:40:27,313 INFO L273 TraceCheckUtils]: 10: Hoare triple {1164#(= main_~k~0 main_~i~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {1174#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 17:40:27,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {1164#(= main_~k~0 main_~i~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {1164#(= main_~k~0 main_~i~0)} is VALID [2018-11-14 17:40:27,315 INFO L273 TraceCheckUtils]: 8: Hoare triple {1164#(= main_~k~0 main_~i~0)} assume true; {1164#(= main_~k~0 main_~i~0)} is VALID [2018-11-14 17:40:27,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {1138#true} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {1164#(= main_~k~0 main_~i~0)} is VALID [2018-11-14 17:40:27,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {1138#true} assume true; {1138#true} is VALID [2018-11-14 17:40:27,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {1138#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {1138#true} is VALID [2018-11-14 17:40:27,317 INFO L256 TraceCheckUtils]: 4: Hoare triple {1138#true} call #t~ret15 := main(); {1138#true} is VALID [2018-11-14 17:40:27,317 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1138#true} {1138#true} #137#return; {1138#true} is VALID [2018-11-14 17:40:27,318 INFO L273 TraceCheckUtils]: 2: Hoare triple {1138#true} assume true; {1138#true} is VALID [2018-11-14 17:40:27,318 INFO L273 TraceCheckUtils]: 1: Hoare triple {1138#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1138#true} is VALID [2018-11-14 17:40:27,319 INFO L256 TraceCheckUtils]: 0: Hoare triple {1138#true} call ULTIMATE.init(); {1138#true} is VALID [2018-11-14 17:40:27,320 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 17:40:27,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:40:27,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-14 17:40:27,322 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-14 17:40:27,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:40:27,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:40:27,381 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:27,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:40:27,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:40:27,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:40:27,382 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 4 states. [2018-11-14 17:40:28,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:28,118 INFO L93 Difference]: Finished difference Result 145 states and 186 transitions. [2018-11-14 17:40:28,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-14 17:40:28,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-14 17:40:28,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:40:28,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:40:28,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2018-11-14 17:40:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:40:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2018-11-14 17:40:28,128 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 182 transitions. [2018-11-14 17:40:28,418 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:28,423 INFO L225 Difference]: With dead ends: 145 [2018-11-14 17:40:28,423 INFO L226 Difference]: Without dead ends: 107 [2018-11-14 17:40:28,424 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:40:28,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-14 17:40:28,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 56. [2018-11-14 17:40:28,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:40:28,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand 56 states. [2018-11-14 17:40:28,503 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand 56 states. [2018-11-14 17:40:28,503 INFO L87 Difference]: Start difference. First operand 107 states. Second operand 56 states. [2018-11-14 17:40:28,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:28,509 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2018-11-14 17:40:28,509 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 137 transitions. [2018-11-14 17:40:28,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:28,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:28,511 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand 107 states. [2018-11-14 17:40:28,511 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 107 states. [2018-11-14 17:40:28,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:28,516 INFO L93 Difference]: Finished difference Result 107 states and 137 transitions. [2018-11-14 17:40:28,517 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 137 transitions. [2018-11-14 17:40:28,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:28,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:28,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:40:28,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:40:28,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-14 17:40:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 70 transitions. [2018-11-14 17:40:28,521 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 70 transitions. Word has length 24 [2018-11-14 17:40:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:40:28,522 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 70 transitions. [2018-11-14 17:40:28,522 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:40:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 70 transitions. [2018-11-14 17:40:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 17:40:28,523 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:40:28,523 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] [2018-11-14 17:40:28,523 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:40:28,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:40:28,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1042030255, now seen corresponding path program 1 times [2018-11-14 17:40:28,524 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:40:28,525 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 17:40:28,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:40:28,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:28,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:28,593 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:40:28,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {1766#true} call ULTIMATE.init(); {1766#true} is VALID [2018-11-14 17:40:28,671 INFO L273 TraceCheckUtils]: 1: Hoare triple {1766#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1766#true} is VALID [2018-11-14 17:40:28,671 INFO L273 TraceCheckUtils]: 2: Hoare triple {1766#true} assume true; {1766#true} is VALID [2018-11-14 17:40:28,672 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1766#true} {1766#true} #137#return; {1766#true} is VALID [2018-11-14 17:40:28,672 INFO L256 TraceCheckUtils]: 4: Hoare triple {1766#true} call #t~ret15 := main(); {1766#true} is VALID [2018-11-14 17:40:28,678 INFO L273 TraceCheckUtils]: 5: Hoare triple {1766#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {1786#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:28,680 INFO L273 TraceCheckUtils]: 6: Hoare triple {1786#(= main_~i~0 (_ bv0 32))} assume true; {1786#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:28,680 INFO L273 TraceCheckUtils]: 7: Hoare triple {1786#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {1793#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:28,684 INFO L273 TraceCheckUtils]: 8: Hoare triple {1793#(= main_~k~0 (_ bv0 32))} assume true; {1793#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:28,684 INFO L273 TraceCheckUtils]: 9: Hoare triple {1793#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {1793#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:28,686 INFO L273 TraceCheckUtils]: 10: Hoare triple {1793#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {1793#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:28,690 INFO L273 TraceCheckUtils]: 11: Hoare triple {1793#(= main_~k~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {1806#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:28,690 INFO L273 TraceCheckUtils]: 12: Hoare triple {1806#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1806#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:28,691 INFO L273 TraceCheckUtils]: 13: Hoare triple {1806#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {1767#false} is VALID [2018-11-14 17:40:28,691 INFO L273 TraceCheckUtils]: 14: Hoare triple {1767#false} assume !(~s~0 != ~i~0); {1767#false} is VALID [2018-11-14 17:40:28,691 INFO L273 TraceCheckUtils]: 15: Hoare triple {1767#false} ~x~0 := 0bv32; {1767#false} is VALID [2018-11-14 17:40:28,692 INFO L273 TraceCheckUtils]: 16: Hoare triple {1767#false} assume true; {1767#false} is VALID [2018-11-14 17:40:28,692 INFO L273 TraceCheckUtils]: 17: Hoare triple {1767#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {1767#false} is VALID [2018-11-14 17:40:28,692 INFO L273 TraceCheckUtils]: 18: Hoare triple {1767#false} assume true; {1767#false} is VALID [2018-11-14 17:40:28,692 INFO L273 TraceCheckUtils]: 19: Hoare triple {1767#false} assume !!~bvslt32(~y~0, ~i~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {1767#false} is VALID [2018-11-14 17:40:28,693 INFO L256 TraceCheckUtils]: 20: Hoare triple {1767#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {1767#false} is VALID [2018-11-14 17:40:28,693 INFO L273 TraceCheckUtils]: 21: Hoare triple {1767#false} ~cond := #in~cond; {1767#false} is VALID [2018-11-14 17:40:28,693 INFO L273 TraceCheckUtils]: 22: Hoare triple {1767#false} assume ~cond == 0bv32; {1767#false} is VALID [2018-11-14 17:40:28,693 INFO L273 TraceCheckUtils]: 23: Hoare triple {1767#false} assume !false; {1767#false} is VALID [2018-11-14 17:40:28,695 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 17:40:28,695 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:40:28,813 INFO L273 TraceCheckUtils]: 23: Hoare triple {1767#false} assume !false; {1767#false} is VALID [2018-11-14 17:40:28,814 INFO L273 TraceCheckUtils]: 22: Hoare triple {1767#false} assume ~cond == 0bv32; {1767#false} is VALID [2018-11-14 17:40:28,814 INFO L273 TraceCheckUtils]: 21: Hoare triple {1767#false} ~cond := #in~cond; {1767#false} is VALID [2018-11-14 17:40:28,815 INFO L256 TraceCheckUtils]: 20: Hoare triple {1767#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {1767#false} is VALID [2018-11-14 17:40:28,815 INFO L273 TraceCheckUtils]: 19: Hoare triple {1767#false} assume !!~bvslt32(~y~0, ~i~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {1767#false} is VALID [2018-11-14 17:40:28,815 INFO L273 TraceCheckUtils]: 18: Hoare triple {1767#false} assume true; {1767#false} is VALID [2018-11-14 17:40:28,816 INFO L273 TraceCheckUtils]: 17: Hoare triple {1767#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {1767#false} is VALID [2018-11-14 17:40:28,816 INFO L273 TraceCheckUtils]: 16: Hoare triple {1767#false} assume true; {1767#false} is VALID [2018-11-14 17:40:28,816 INFO L273 TraceCheckUtils]: 15: Hoare triple {1767#false} ~x~0 := 0bv32; {1767#false} is VALID [2018-11-14 17:40:28,816 INFO L273 TraceCheckUtils]: 14: Hoare triple {1767#false} assume !(~s~0 != ~i~0); {1767#false} is VALID [2018-11-14 17:40:28,819 INFO L273 TraceCheckUtils]: 13: Hoare triple {1873#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {1767#false} is VALID [2018-11-14 17:40:28,819 INFO L273 TraceCheckUtils]: 12: Hoare triple {1873#(bvslt main_~k~0 (_ bv100000 32))} assume true; {1873#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 17:40:28,821 INFO L273 TraceCheckUtils]: 11: Hoare triple {1880#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {1873#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 17:40:28,821 INFO L273 TraceCheckUtils]: 10: Hoare triple {1880#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {1880#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:28,824 INFO L273 TraceCheckUtils]: 9: Hoare triple {1880#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {1880#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:28,824 INFO L273 TraceCheckUtils]: 8: Hoare triple {1880#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1880#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:28,827 INFO L273 TraceCheckUtils]: 7: Hoare triple {1893#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {1880#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:28,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {1893#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1893#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:28,828 INFO L273 TraceCheckUtils]: 5: Hoare triple {1766#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {1893#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:28,828 INFO L256 TraceCheckUtils]: 4: Hoare triple {1766#true} call #t~ret15 := main(); {1766#true} is VALID [2018-11-14 17:40:28,828 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1766#true} {1766#true} #137#return; {1766#true} is VALID [2018-11-14 17:40:28,829 INFO L273 TraceCheckUtils]: 2: Hoare triple {1766#true} assume true; {1766#true} is VALID [2018-11-14 17:40:28,829 INFO L273 TraceCheckUtils]: 1: Hoare triple {1766#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1766#true} is VALID [2018-11-14 17:40:28,829 INFO L256 TraceCheckUtils]: 0: Hoare triple {1766#true} call ULTIMATE.init(); {1766#true} is VALID [2018-11-14 17:40:28,830 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 17:40:28,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:40:28,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 17:40:28,833 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 17:40:28,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:40:28,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 17:40:28,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:28,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 17:40:28,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 17:40:28,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:40:28,941 INFO L87 Difference]: Start difference. First operand 56 states and 70 transitions. Second operand 8 states. [2018-11-14 17:40:30,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:30,213 INFO L93 Difference]: Finished difference Result 197 states and 263 transitions. [2018-11-14 17:40:30,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 17:40:30,214 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 17:40:30,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:40:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:40:30,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2018-11-14 17:40:30,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 17:40:30,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 208 transitions. [2018-11-14 17:40:30,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 208 transitions. [2018-11-14 17:40:30,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:30,609 INFO L225 Difference]: With dead ends: 197 [2018-11-14 17:40:30,609 INFO L226 Difference]: Without dead ends: 151 [2018-11-14 17:40:30,610 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:40:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-11-14 17:40:30,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 116. [2018-11-14 17:40:30,675 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:40:30,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states. Second operand 116 states. [2018-11-14 17:40:30,675 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 116 states. [2018-11-14 17:40:30,675 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 116 states. [2018-11-14 17:40:30,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:30,682 INFO L93 Difference]: Finished difference Result 151 states and 193 transitions. [2018-11-14 17:40:30,682 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 193 transitions. [2018-11-14 17:40:30,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:30,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:30,683 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand 151 states. [2018-11-14 17:40:30,683 INFO L87 Difference]: Start difference. First operand 116 states. Second operand 151 states. [2018-11-14 17:40:30,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:30,690 INFO L93 Difference]: Finished difference Result 151 states and 193 transitions. [2018-11-14 17:40:30,691 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 193 transitions. [2018-11-14 17:40:30,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:30,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:30,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:40:30,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:40:30,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-11-14 17:40:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 146 transitions. [2018-11-14 17:40:30,697 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 146 transitions. Word has length 24 [2018-11-14 17:40:30,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:40:30,697 INFO L480 AbstractCegarLoop]: Abstraction has 116 states and 146 transitions. [2018-11-14 17:40:30,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 17:40:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 146 transitions. [2018-11-14 17:40:30,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 17:40:30,699 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:40:30,699 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:40:30,699 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:40:30,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:40:30,700 INFO L82 PathProgramCache]: Analyzing trace with hash 560327599, now seen corresponding path program 2 times [2018-11-14 17:40:30,700 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:40:30,700 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 17:40:30,718 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:40:30,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 17:40:30,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:40:30,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:30,773 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:40:30,847 INFO L256 TraceCheckUtils]: 0: Hoare triple {2639#true} call ULTIMATE.init(); {2639#true} is VALID [2018-11-14 17:40:30,848 INFO L273 TraceCheckUtils]: 1: Hoare triple {2639#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2639#true} is VALID [2018-11-14 17:40:30,848 INFO L273 TraceCheckUtils]: 2: Hoare triple {2639#true} assume true; {2639#true} is VALID [2018-11-14 17:40:30,848 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2639#true} {2639#true} #137#return; {2639#true} is VALID [2018-11-14 17:40:30,849 INFO L256 TraceCheckUtils]: 4: Hoare triple {2639#true} call #t~ret15 := main(); {2639#true} is VALID [2018-11-14 17:40:30,850 INFO L273 TraceCheckUtils]: 5: Hoare triple {2639#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,850 INFO L273 TraceCheckUtils]: 6: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume true; {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,851 INFO L273 TraceCheckUtils]: 7: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,851 INFO L273 TraceCheckUtils]: 8: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume true; {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,852 INFO L273 TraceCheckUtils]: 9: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,852 INFO L273 TraceCheckUtils]: 10: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,853 INFO L273 TraceCheckUtils]: 11: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,853 INFO L273 TraceCheckUtils]: 12: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume true; {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,855 INFO L273 TraceCheckUtils]: 13: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,856 INFO L273 TraceCheckUtils]: 14: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,857 INFO L273 TraceCheckUtils]: 15: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,857 INFO L273 TraceCheckUtils]: 16: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume true; {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,857 INFO L273 TraceCheckUtils]: 17: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,859 INFO L273 TraceCheckUtils]: 20: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume true; {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,859 INFO L273 TraceCheckUtils]: 21: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,860 INFO L273 TraceCheckUtils]: 22: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,860 INFO L273 TraceCheckUtils]: 23: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,860 INFO L273 TraceCheckUtils]: 24: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume true; {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,861 INFO L273 TraceCheckUtils]: 25: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,861 INFO L273 TraceCheckUtils]: 26: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {2659#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:30,862 INFO L273 TraceCheckUtils]: 27: Hoare triple {2659#(= main_~i~0 (_ bv0 32))} ~x~0 := 0bv32; {2726#(and (= main_~x~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:40:30,863 INFO L273 TraceCheckUtils]: 28: Hoare triple {2726#(and (= main_~x~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {2726#(and (= main_~x~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:40:30,864 INFO L273 TraceCheckUtils]: 29: Hoare triple {2726#(and (= main_~x~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {2640#false} is VALID [2018-11-14 17:40:30,864 INFO L273 TraceCheckUtils]: 30: Hoare triple {2640#false} assume true; {2640#false} is VALID [2018-11-14 17:40:30,865 INFO L273 TraceCheckUtils]: 31: Hoare triple {2640#false} assume !!~bvslt32(~y~0, ~i~0);call #t~mem6 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem7 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~y~0)), 4bv32); {2640#false} is VALID [2018-11-14 17:40:30,865 INFO L256 TraceCheckUtils]: 32: Hoare triple {2640#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {2640#false} is VALID [2018-11-14 17:40:30,865 INFO L273 TraceCheckUtils]: 33: Hoare triple {2640#false} ~cond := #in~cond; {2640#false} is VALID [2018-11-14 17:40:30,866 INFO L273 TraceCheckUtils]: 34: Hoare triple {2640#false} assume ~cond == 0bv32; {2640#false} is VALID [2018-11-14 17:40:30,866 INFO L273 TraceCheckUtils]: 35: Hoare triple {2640#false} assume !false; {2640#false} is VALID [2018-11-14 17:40:30,870 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-14 17:40:30,870 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 17:40:30,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:40:30,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 17:40:30,884 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 17:40:30,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:40:30,884 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 17:40:30,928 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:30,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 17:40:30,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 17:40:30,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:40:30,929 INFO L87 Difference]: Start difference. First operand 116 states and 146 transitions. Second operand 4 states. [2018-11-14 17:40:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:31,476 INFO L93 Difference]: Finished difference Result 182 states and 230 transitions. [2018-11-14 17:40:31,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 17:40:31,476 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 17:40:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:40:31,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:40:31,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2018-11-14 17:40:31,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 17:40:31,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 125 transitions. [2018-11-14 17:40:31,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 125 transitions. [2018-11-14 17:40:31,785 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 17:40:31,787 INFO L225 Difference]: With dead ends: 182 [2018-11-14 17:40:31,788 INFO L226 Difference]: Without dead ends: 110 [2018-11-14 17:40:31,790 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 17:40:31,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-14 17:40:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2018-11-14 17:40:31,958 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:40:31,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand 110 states. [2018-11-14 17:40:31,958 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 110 states. [2018-11-14 17:40:31,958 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 110 states. [2018-11-14 17:40:31,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:31,963 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2018-11-14 17:40:31,963 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2018-11-14 17:40:31,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:31,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:31,964 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand 110 states. [2018-11-14 17:40:31,964 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 110 states. [2018-11-14 17:40:31,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:31,969 INFO L93 Difference]: Finished difference Result 110 states and 137 transitions. [2018-11-14 17:40:31,969 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2018-11-14 17:40:31,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:31,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:31,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:40:31,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:40:31,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-11-14 17:40:31,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 137 transitions. [2018-11-14 17:40:31,974 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 137 transitions. Word has length 36 [2018-11-14 17:40:31,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:40:31,974 INFO L480 AbstractCegarLoop]: Abstraction has 110 states and 137 transitions. [2018-11-14 17:40:31,974 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 17:40:31,975 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 137 transitions. [2018-11-14 17:40:31,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 17:40:31,975 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:40:31,976 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:40:31,976 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:40:31,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:40:31,976 INFO L82 PathProgramCache]: Analyzing trace with hash -688591287, now seen corresponding path program 1 times [2018-11-14 17:40:31,977 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:40:31,977 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 17:40:32,003 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:40:32,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:32,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:32,084 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:40:32,244 INFO L256 TraceCheckUtils]: 0: Hoare triple {3352#true} call ULTIMATE.init(); {3352#true} is VALID [2018-11-14 17:40:32,244 INFO L273 TraceCheckUtils]: 1: Hoare triple {3352#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3352#true} is VALID [2018-11-14 17:40:32,245 INFO L273 TraceCheckUtils]: 2: Hoare triple {3352#true} assume true; {3352#true} is VALID [2018-11-14 17:40:32,245 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3352#true} {3352#true} #137#return; {3352#true} is VALID [2018-11-14 17:40:32,245 INFO L256 TraceCheckUtils]: 4: Hoare triple {3352#true} call #t~ret15 := main(); {3352#true} is VALID [2018-11-14 17:40:32,246 INFO L273 TraceCheckUtils]: 5: Hoare triple {3352#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {3372#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:32,246 INFO L273 TraceCheckUtils]: 6: Hoare triple {3372#(= main_~i~0 (_ bv0 32))} assume true; {3372#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:32,248 INFO L273 TraceCheckUtils]: 7: Hoare triple {3372#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {3379#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:32,248 INFO L273 TraceCheckUtils]: 8: Hoare triple {3379#(= main_~k~0 (_ bv0 32))} assume true; {3379#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:32,248 INFO L273 TraceCheckUtils]: 9: Hoare triple {3379#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3379#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:32,249 INFO L273 TraceCheckUtils]: 10: Hoare triple {3379#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3379#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:32,254 INFO L273 TraceCheckUtils]: 11: Hoare triple {3379#(= main_~k~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3392#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:32,254 INFO L273 TraceCheckUtils]: 12: Hoare triple {3392#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3392#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:32,255 INFO L273 TraceCheckUtils]: 13: Hoare triple {3392#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3392#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:32,255 INFO L273 TraceCheckUtils]: 14: Hoare triple {3392#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3392#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:32,256 INFO L273 TraceCheckUtils]: 15: Hoare triple {3392#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3405#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 17:40:32,256 INFO L273 TraceCheckUtils]: 16: Hoare triple {3405#(= (_ bv2 32) main_~k~0)} assume true; {3405#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 17:40:32,256 INFO L273 TraceCheckUtils]: 17: Hoare triple {3405#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3405#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 17:40:32,265 INFO L273 TraceCheckUtils]: 18: Hoare triple {3405#(= (_ bv2 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3405#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 17:40:32,266 INFO L273 TraceCheckUtils]: 19: Hoare triple {3405#(= (_ bv2 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {3418#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:32,266 INFO L273 TraceCheckUtils]: 20: Hoare triple {3418#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3418#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:32,266 INFO L273 TraceCheckUtils]: 21: Hoare triple {3418#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3418#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:32,267 INFO L273 TraceCheckUtils]: 22: Hoare triple {3418#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3418#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:32,268 INFO L273 TraceCheckUtils]: 23: Hoare triple {3418#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3431#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:32,268 INFO L273 TraceCheckUtils]: 24: Hoare triple {3431#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {3431#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:32,269 INFO L273 TraceCheckUtils]: 25: Hoare triple {3431#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {3353#false} is VALID [2018-11-14 17:40:32,269 INFO L273 TraceCheckUtils]: 26: Hoare triple {3353#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3353#false} is VALID [2018-11-14 17:40:32,270 INFO L273 TraceCheckUtils]: 27: Hoare triple {3353#false} ~x~0 := 0bv32; {3353#false} is VALID [2018-11-14 17:40:32,270 INFO L273 TraceCheckUtils]: 28: Hoare triple {3353#false} assume true; {3353#false} is VALID [2018-11-14 17:40:32,271 INFO L273 TraceCheckUtils]: 29: Hoare triple {3353#false} assume !~bvslt32(~x~0, ~i~0); {3353#false} is VALID [2018-11-14 17:40:32,271 INFO L273 TraceCheckUtils]: 30: Hoare triple {3353#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {3353#false} is VALID [2018-11-14 17:40:32,271 INFO L273 TraceCheckUtils]: 31: Hoare triple {3353#false} assume true; {3353#false} is VALID [2018-11-14 17:40:32,272 INFO L273 TraceCheckUtils]: 32: Hoare triple {3353#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3353#false} is VALID [2018-11-14 17:40:32,272 INFO L256 TraceCheckUtils]: 33: Hoare triple {3353#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {3353#false} is VALID [2018-11-14 17:40:32,272 INFO L273 TraceCheckUtils]: 34: Hoare triple {3353#false} ~cond := #in~cond; {3353#false} is VALID [2018-11-14 17:40:32,272 INFO L273 TraceCheckUtils]: 35: Hoare triple {3353#false} assume ~cond == 0bv32; {3353#false} is VALID [2018-11-14 17:40:32,272 INFO L273 TraceCheckUtils]: 36: Hoare triple {3353#false} assume !false; {3353#false} is VALID [2018-11-14 17:40:32,275 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:40:32,275 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:40:32,455 INFO L273 TraceCheckUtils]: 36: Hoare triple {3353#false} assume !false; {3353#false} is VALID [2018-11-14 17:40:32,455 INFO L273 TraceCheckUtils]: 35: Hoare triple {3353#false} assume ~cond == 0bv32; {3353#false} is VALID [2018-11-14 17:40:32,456 INFO L273 TraceCheckUtils]: 34: Hoare triple {3353#false} ~cond := #in~cond; {3353#false} is VALID [2018-11-14 17:40:32,456 INFO L256 TraceCheckUtils]: 33: Hoare triple {3353#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {3353#false} is VALID [2018-11-14 17:40:32,456 INFO L273 TraceCheckUtils]: 32: Hoare triple {3353#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3353#false} is VALID [2018-11-14 17:40:32,457 INFO L273 TraceCheckUtils]: 31: Hoare triple {3353#false} assume true; {3353#false} is VALID [2018-11-14 17:40:32,457 INFO L273 TraceCheckUtils]: 30: Hoare triple {3353#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {3353#false} is VALID [2018-11-14 17:40:32,457 INFO L273 TraceCheckUtils]: 29: Hoare triple {3353#false} assume !~bvslt32(~x~0, ~i~0); {3353#false} is VALID [2018-11-14 17:40:32,457 INFO L273 TraceCheckUtils]: 28: Hoare triple {3353#false} assume true; {3353#false} is VALID [2018-11-14 17:40:32,458 INFO L273 TraceCheckUtils]: 27: Hoare triple {3353#false} ~x~0 := 0bv32; {3353#false} is VALID [2018-11-14 17:40:32,458 INFO L273 TraceCheckUtils]: 26: Hoare triple {3353#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {3353#false} is VALID [2018-11-14 17:40:32,459 INFO L273 TraceCheckUtils]: 25: Hoare triple {3504#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {3353#false} is VALID [2018-11-14 17:40:32,459 INFO L273 TraceCheckUtils]: 24: Hoare triple {3504#(bvslt main_~k~0 (_ bv100000 32))} assume true; {3504#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 17:40:32,477 INFO L273 TraceCheckUtils]: 23: Hoare triple {3511#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3504#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 17:40:32,484 INFO L273 TraceCheckUtils]: 22: Hoare triple {3511#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3511#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,485 INFO L273 TraceCheckUtils]: 21: Hoare triple {3511#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3511#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,485 INFO L273 TraceCheckUtils]: 20: Hoare triple {3511#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume true; {3511#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,490 INFO L273 TraceCheckUtils]: 19: Hoare triple {3524#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3511#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,491 INFO L273 TraceCheckUtils]: 18: Hoare triple {3524#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3524#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,491 INFO L273 TraceCheckUtils]: 17: Hoare triple {3524#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3524#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,491 INFO L273 TraceCheckUtils]: 16: Hoare triple {3524#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume true; {3524#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,497 INFO L273 TraceCheckUtils]: 15: Hoare triple {3537#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3524#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {3537#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3537#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,498 INFO L273 TraceCheckUtils]: 13: Hoare triple {3537#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3537#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,498 INFO L273 TraceCheckUtils]: 12: Hoare triple {3537#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume true; {3537#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,503 INFO L273 TraceCheckUtils]: 11: Hoare triple {3550#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3537#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,503 INFO L273 TraceCheckUtils]: 10: Hoare triple {3550#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3550#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,504 INFO L273 TraceCheckUtils]: 9: Hoare triple {3550#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3550#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,504 INFO L273 TraceCheckUtils]: 8: Hoare triple {3550#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume true; {3550#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,505 INFO L273 TraceCheckUtils]: 7: Hoare triple {3563#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {3550#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,505 INFO L273 TraceCheckUtils]: 6: Hoare triple {3563#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume true; {3563#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,507 INFO L273 TraceCheckUtils]: 5: Hoare triple {3352#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {3563#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:32,508 INFO L256 TraceCheckUtils]: 4: Hoare triple {3352#true} call #t~ret15 := main(); {3352#true} is VALID [2018-11-14 17:40:32,508 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3352#true} {3352#true} #137#return; {3352#true} is VALID [2018-11-14 17:40:32,509 INFO L273 TraceCheckUtils]: 2: Hoare triple {3352#true} assume true; {3352#true} is VALID [2018-11-14 17:40:32,509 INFO L273 TraceCheckUtils]: 1: Hoare triple {3352#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3352#true} is VALID [2018-11-14 17:40:32,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {3352#true} call ULTIMATE.init(); {3352#true} is VALID [2018-11-14 17:40:32,511 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:40:32,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:40:32,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 17:40:32,516 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-14 17:40:32,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:40:32,516 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 17:40:32,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:32,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 17:40:32,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 17:40:32,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-14 17:40:32,629 INFO L87 Difference]: Start difference. First operand 110 states and 137 transitions. Second operand 14 states. [2018-11-14 17:40:35,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:35,533 INFO L93 Difference]: Finished difference Result 286 states and 379 transitions. [2018-11-14 17:40:35,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 17:40:35,534 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-14 17:40:35,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:40:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:40:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 247 transitions. [2018-11-14 17:40:35,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 17:40:35,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 247 transitions. [2018-11-14 17:40:35,543 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 247 transitions. [2018-11-14 17:40:35,947 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 247 edges. 247 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:35,952 INFO L225 Difference]: With dead ends: 286 [2018-11-14 17:40:35,952 INFO L226 Difference]: Without dead ends: 217 [2018-11-14 17:40:35,953 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2018-11-14 17:40:35,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-11-14 17:40:36,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 182. [2018-11-14 17:40:36,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:40:36,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 217 states. Second operand 182 states. [2018-11-14 17:40:36,717 INFO L74 IsIncluded]: Start isIncluded. First operand 217 states. Second operand 182 states. [2018-11-14 17:40:36,717 INFO L87 Difference]: Start difference. First operand 217 states. Second operand 182 states. [2018-11-14 17:40:36,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:36,725 INFO L93 Difference]: Finished difference Result 217 states and 274 transitions. [2018-11-14 17:40:36,725 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 274 transitions. [2018-11-14 17:40:36,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:36,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:36,727 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand 217 states. [2018-11-14 17:40:36,727 INFO L87 Difference]: Start difference. First operand 182 states. Second operand 217 states. [2018-11-14 17:40:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:36,735 INFO L93 Difference]: Finished difference Result 217 states and 274 transitions. [2018-11-14 17:40:36,735 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 274 transitions. [2018-11-14 17:40:36,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:36,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:36,737 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:40:36,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:40:36,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-11-14 17:40:36,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 227 transitions. [2018-11-14 17:40:36,743 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 227 transitions. Word has length 37 [2018-11-14 17:40:36,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:40:36,744 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 227 transitions. [2018-11-14 17:40:36,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 17:40:36,744 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 227 transitions. [2018-11-14 17:40:36,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-14 17:40:36,746 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:40:36,746 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:40:36,746 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:40:36,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:40:36,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2026125747, now seen corresponding path program 2 times [2018-11-14 17:40:36,747 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:40:36,747 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 17:40:36,770 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 17:40:36,933 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 17:40:36,933 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:40:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:36,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:40:37,555 INFO L256 TraceCheckUtils]: 0: Hoare triple {4653#true} call ULTIMATE.init(); {4653#true} is VALID [2018-11-14 17:40:37,555 INFO L273 TraceCheckUtils]: 1: Hoare triple {4653#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4653#true} is VALID [2018-11-14 17:40:37,556 INFO L273 TraceCheckUtils]: 2: Hoare triple {4653#true} assume true; {4653#true} is VALID [2018-11-14 17:40:37,556 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4653#true} {4653#true} #137#return; {4653#true} is VALID [2018-11-14 17:40:37,556 INFO L256 TraceCheckUtils]: 4: Hoare triple {4653#true} call #t~ret15 := main(); {4653#true} is VALID [2018-11-14 17:40:37,556 INFO L273 TraceCheckUtils]: 5: Hoare triple {4653#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {4673#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:37,557 INFO L273 TraceCheckUtils]: 6: Hoare triple {4673#(= main_~i~0 (_ bv0 32))} assume true; {4673#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:40:37,557 INFO L273 TraceCheckUtils]: 7: Hoare triple {4673#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {4680#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:37,557 INFO L273 TraceCheckUtils]: 8: Hoare triple {4680#(= main_~k~0 (_ bv0 32))} assume true; {4680#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:37,558 INFO L273 TraceCheckUtils]: 9: Hoare triple {4680#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4680#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:37,558 INFO L273 TraceCheckUtils]: 10: Hoare triple {4680#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4680#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:40:37,559 INFO L273 TraceCheckUtils]: 11: Hoare triple {4680#(= main_~k~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4693#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,560 INFO L273 TraceCheckUtils]: 12: Hoare triple {4693#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {4693#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,560 INFO L273 TraceCheckUtils]: 13: Hoare triple {4693#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4693#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,561 INFO L273 TraceCheckUtils]: 14: Hoare triple {4693#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4693#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,562 INFO L273 TraceCheckUtils]: 15: Hoare triple {4693#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4706#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 17:40:37,562 INFO L273 TraceCheckUtils]: 16: Hoare triple {4706#(= (_ bv2 32) main_~k~0)} assume true; {4706#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 17:40:37,563 INFO L273 TraceCheckUtils]: 17: Hoare triple {4706#(= (_ bv2 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4706#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 17:40:37,564 INFO L273 TraceCheckUtils]: 18: Hoare triple {4706#(= (_ bv2 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4706#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 17:40:37,564 INFO L273 TraceCheckUtils]: 19: Hoare triple {4706#(= (_ bv2 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {4719#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,565 INFO L273 TraceCheckUtils]: 20: Hoare triple {4719#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {4719#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,573 INFO L273 TraceCheckUtils]: 21: Hoare triple {4719#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4719#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,574 INFO L273 TraceCheckUtils]: 22: Hoare triple {4719#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4719#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,574 INFO L273 TraceCheckUtils]: 23: Hoare triple {4719#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4732#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,575 INFO L273 TraceCheckUtils]: 24: Hoare triple {4732#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {4732#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,575 INFO L273 TraceCheckUtils]: 25: Hoare triple {4732#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4732#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,575 INFO L273 TraceCheckUtils]: 26: Hoare triple {4732#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4732#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,576 INFO L273 TraceCheckUtils]: 27: Hoare triple {4732#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4745#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,576 INFO L273 TraceCheckUtils]: 28: Hoare triple {4745#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {4745#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,577 INFO L273 TraceCheckUtils]: 29: Hoare triple {4745#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4745#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,578 INFO L273 TraceCheckUtils]: 30: Hoare triple {4745#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4745#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,578 INFO L273 TraceCheckUtils]: 31: Hoare triple {4745#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4758#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 17:40:37,579 INFO L273 TraceCheckUtils]: 32: Hoare triple {4758#(= (_ bv6 32) main_~k~0)} assume true; {4758#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 17:40:37,579 INFO L273 TraceCheckUtils]: 33: Hoare triple {4758#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4758#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 17:40:37,580 INFO L273 TraceCheckUtils]: 34: Hoare triple {4758#(= (_ bv6 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4758#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 17:40:37,580 INFO L273 TraceCheckUtils]: 35: Hoare triple {4758#(= (_ bv6 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {4771#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,580 INFO L273 TraceCheckUtils]: 36: Hoare triple {4771#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {4771#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,581 INFO L273 TraceCheckUtils]: 37: Hoare triple {4771#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4771#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,581 INFO L273 TraceCheckUtils]: 38: Hoare triple {4771#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4771#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,582 INFO L273 TraceCheckUtils]: 39: Hoare triple {4771#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4784#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,585 INFO L273 TraceCheckUtils]: 40: Hoare triple {4784#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {4784#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,586 INFO L273 TraceCheckUtils]: 41: Hoare triple {4784#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4784#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,586 INFO L273 TraceCheckUtils]: 42: Hoare triple {4784#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4784#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,603 INFO L273 TraceCheckUtils]: 43: Hoare triple {4784#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4797#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 17:40:37,612 INFO L273 TraceCheckUtils]: 44: Hoare triple {4797#(= (_ bv9 32) main_~k~0)} assume true; {4797#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 17:40:37,625 INFO L273 TraceCheckUtils]: 45: Hoare triple {4797#(= (_ bv9 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4797#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 17:40:37,627 INFO L273 TraceCheckUtils]: 46: Hoare triple {4797#(= (_ bv9 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4797#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 17:40:37,627 INFO L273 TraceCheckUtils]: 47: Hoare triple {4797#(= (_ bv9 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {4810#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,628 INFO L273 TraceCheckUtils]: 48: Hoare triple {4810#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {4810#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:40:37,629 INFO L273 TraceCheckUtils]: 49: Hoare triple {4810#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {4654#false} is VALID [2018-11-14 17:40:37,629 INFO L273 TraceCheckUtils]: 50: Hoare triple {4654#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4654#false} is VALID [2018-11-14 17:40:37,629 INFO L273 TraceCheckUtils]: 51: Hoare triple {4654#false} ~x~0 := 0bv32; {4654#false} is VALID [2018-11-14 17:40:37,629 INFO L273 TraceCheckUtils]: 52: Hoare triple {4654#false} assume true; {4654#false} is VALID [2018-11-14 17:40:37,630 INFO L273 TraceCheckUtils]: 53: Hoare triple {4654#false} assume !~bvslt32(~x~0, ~i~0); {4654#false} is VALID [2018-11-14 17:40:37,630 INFO L273 TraceCheckUtils]: 54: Hoare triple {4654#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {4654#false} is VALID [2018-11-14 17:40:37,630 INFO L273 TraceCheckUtils]: 55: Hoare triple {4654#false} assume true; {4654#false} is VALID [2018-11-14 17:40:37,630 INFO L273 TraceCheckUtils]: 56: Hoare triple {4654#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4654#false} is VALID [2018-11-14 17:40:37,630 INFO L256 TraceCheckUtils]: 57: Hoare triple {4654#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {4654#false} is VALID [2018-11-14 17:40:37,630 INFO L273 TraceCheckUtils]: 58: Hoare triple {4654#false} ~cond := #in~cond; {4654#false} is VALID [2018-11-14 17:40:37,631 INFO L273 TraceCheckUtils]: 59: Hoare triple {4654#false} assume ~cond == 0bv32; {4654#false} is VALID [2018-11-14 17:40:37,631 INFO L273 TraceCheckUtils]: 60: Hoare triple {4654#false} assume !false; {4654#false} is VALID [2018-11-14 17:40:37,634 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:40:37,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:40:38,186 INFO L273 TraceCheckUtils]: 60: Hoare triple {4654#false} assume !false; {4654#false} is VALID [2018-11-14 17:40:38,186 INFO L273 TraceCheckUtils]: 59: Hoare triple {4654#false} assume ~cond == 0bv32; {4654#false} is VALID [2018-11-14 17:40:38,187 INFO L273 TraceCheckUtils]: 58: Hoare triple {4654#false} ~cond := #in~cond; {4654#false} is VALID [2018-11-14 17:40:38,187 INFO L256 TraceCheckUtils]: 57: Hoare triple {4654#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {4654#false} is VALID [2018-11-14 17:40:38,187 INFO L273 TraceCheckUtils]: 56: Hoare triple {4654#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4654#false} is VALID [2018-11-14 17:40:38,187 INFO L273 TraceCheckUtils]: 55: Hoare triple {4654#false} assume true; {4654#false} is VALID [2018-11-14 17:40:38,188 INFO L273 TraceCheckUtils]: 54: Hoare triple {4654#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {4654#false} is VALID [2018-11-14 17:40:38,188 INFO L273 TraceCheckUtils]: 53: Hoare triple {4654#false} assume !~bvslt32(~x~0, ~i~0); {4654#false} is VALID [2018-11-14 17:40:38,188 INFO L273 TraceCheckUtils]: 52: Hoare triple {4654#false} assume true; {4654#false} is VALID [2018-11-14 17:40:38,189 INFO L273 TraceCheckUtils]: 51: Hoare triple {4654#false} ~x~0 := 0bv32; {4654#false} is VALID [2018-11-14 17:40:38,189 INFO L273 TraceCheckUtils]: 50: Hoare triple {4654#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {4654#false} is VALID [2018-11-14 17:40:38,189 INFO L273 TraceCheckUtils]: 49: Hoare triple {4883#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {4654#false} is VALID [2018-11-14 17:40:38,190 INFO L273 TraceCheckUtils]: 48: Hoare triple {4883#(bvslt main_~k~0 (_ bv100000 32))} assume true; {4883#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 17:40:38,191 INFO L273 TraceCheckUtils]: 47: Hoare triple {4890#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4883#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 17:40:38,191 INFO L273 TraceCheckUtils]: 46: Hoare triple {4890#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4890#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,192 INFO L273 TraceCheckUtils]: 45: Hoare triple {4890#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4890#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,192 INFO L273 TraceCheckUtils]: 44: Hoare triple {4890#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume true; {4890#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,197 INFO L273 TraceCheckUtils]: 43: Hoare triple {4903#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4890#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,197 INFO L273 TraceCheckUtils]: 42: Hoare triple {4903#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4903#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,197 INFO L273 TraceCheckUtils]: 41: Hoare triple {4903#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4903#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,198 INFO L273 TraceCheckUtils]: 40: Hoare triple {4903#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume true; {4903#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,205 INFO L273 TraceCheckUtils]: 39: Hoare triple {4916#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4903#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,205 INFO L273 TraceCheckUtils]: 38: Hoare triple {4916#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4916#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,205 INFO L273 TraceCheckUtils]: 37: Hoare triple {4916#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4916#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,206 INFO L273 TraceCheckUtils]: 36: Hoare triple {4916#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume true; {4916#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,215 INFO L273 TraceCheckUtils]: 35: Hoare triple {4929#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4916#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,217 INFO L273 TraceCheckUtils]: 34: Hoare triple {4929#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4929#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,218 INFO L273 TraceCheckUtils]: 33: Hoare triple {4929#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4929#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,218 INFO L273 TraceCheckUtils]: 32: Hoare triple {4929#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume true; {4929#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,224 INFO L273 TraceCheckUtils]: 31: Hoare triple {4942#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4929#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,224 INFO L273 TraceCheckUtils]: 30: Hoare triple {4942#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4942#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,224 INFO L273 TraceCheckUtils]: 29: Hoare triple {4942#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4942#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,225 INFO L273 TraceCheckUtils]: 28: Hoare triple {4942#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume true; {4942#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,230 INFO L273 TraceCheckUtils]: 27: Hoare triple {4955#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4942#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,230 INFO L273 TraceCheckUtils]: 26: Hoare triple {4955#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4955#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,231 INFO L273 TraceCheckUtils]: 25: Hoare triple {4955#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4955#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,231 INFO L273 TraceCheckUtils]: 24: Hoare triple {4955#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume true; {4955#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,237 INFO L273 TraceCheckUtils]: 23: Hoare triple {4968#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4955#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,237 INFO L273 TraceCheckUtils]: 22: Hoare triple {4968#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4968#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,238 INFO L273 TraceCheckUtils]: 21: Hoare triple {4968#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4968#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,238 INFO L273 TraceCheckUtils]: 20: Hoare triple {4968#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume true; {4968#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,243 INFO L273 TraceCheckUtils]: 19: Hoare triple {4981#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4968#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,244 INFO L273 TraceCheckUtils]: 18: Hoare triple {4981#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4981#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,244 INFO L273 TraceCheckUtils]: 17: Hoare triple {4981#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4981#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,253 INFO L273 TraceCheckUtils]: 16: Hoare triple {4981#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume true; {4981#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,261 INFO L273 TraceCheckUtils]: 15: Hoare triple {4994#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4981#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {4994#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4994#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,262 INFO L273 TraceCheckUtils]: 13: Hoare triple {4994#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {4994#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,262 INFO L273 TraceCheckUtils]: 12: Hoare triple {4994#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume true; {4994#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,267 INFO L273 TraceCheckUtils]: 11: Hoare triple {5007#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4994#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,268 INFO L273 TraceCheckUtils]: 10: Hoare triple {5007#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5007#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,269 INFO L273 TraceCheckUtils]: 9: Hoare triple {5007#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5007#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,269 INFO L273 TraceCheckUtils]: 8: Hoare triple {5007#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume true; {5007#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,271 INFO L273 TraceCheckUtils]: 7: Hoare triple {5020#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {5007#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,271 INFO L273 TraceCheckUtils]: 6: Hoare triple {5020#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume true; {5020#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,272 INFO L273 TraceCheckUtils]: 5: Hoare triple {4653#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {5020#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:40:38,273 INFO L256 TraceCheckUtils]: 4: Hoare triple {4653#true} call #t~ret15 := main(); {4653#true} is VALID [2018-11-14 17:40:38,273 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4653#true} {4653#true} #137#return; {4653#true} is VALID [2018-11-14 17:40:38,273 INFO L273 TraceCheckUtils]: 2: Hoare triple {4653#true} assume true; {4653#true} is VALID [2018-11-14 17:40:38,273 INFO L273 TraceCheckUtils]: 1: Hoare triple {4653#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4653#true} is VALID [2018-11-14 17:40:38,274 INFO L256 TraceCheckUtils]: 0: Hoare triple {4653#true} call ULTIMATE.init(); {4653#true} is VALID [2018-11-14 17:40:38,279 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:40:38,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:40:38,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-14 17:40:38,283 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-11-14 17:40:38,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:40:38,283 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 17:40:38,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:38,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 17:40:38,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 17:40:38,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2018-11-14 17:40:38,486 INFO L87 Difference]: Start difference. First operand 182 states and 227 transitions. Second operand 26 states. [2018-11-14 17:40:47,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:47,542 INFO L93 Difference]: Finished difference Result 454 states and 607 transitions. [2018-11-14 17:40:47,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-14 17:40:47,542 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 61 [2018-11-14 17:40:47,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:40:47,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:40:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 346 transitions. [2018-11-14 17:40:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:40:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 346 transitions. [2018-11-14 17:40:47,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 346 transitions. [2018-11-14 17:40:48,190 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:40:48,202 INFO L225 Difference]: With dead ends: 454 [2018-11-14 17:40:48,202 INFO L226 Difference]: Without dead ends: 361 [2018-11-14 17:40:48,204 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=974, Invalid=2448, Unknown=0, NotChecked=0, Total=3422 [2018-11-14 17:40:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-11-14 17:40:48,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 326. [2018-11-14 17:40:48,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:40:48,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 361 states. Second operand 326 states. [2018-11-14 17:40:48,372 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand 326 states. [2018-11-14 17:40:48,372 INFO L87 Difference]: Start difference. First operand 361 states. Second operand 326 states. [2018-11-14 17:40:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:48,389 INFO L93 Difference]: Finished difference Result 361 states and 454 transitions. [2018-11-14 17:40:48,389 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 454 transitions. [2018-11-14 17:40:48,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:48,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:48,390 INFO L74 IsIncluded]: Start isIncluded. First operand 326 states. Second operand 361 states. [2018-11-14 17:40:48,390 INFO L87 Difference]: Start difference. First operand 326 states. Second operand 361 states. [2018-11-14 17:40:48,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:40:48,405 INFO L93 Difference]: Finished difference Result 361 states and 454 transitions. [2018-11-14 17:40:48,406 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 454 transitions. [2018-11-14 17:40:48,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:40:48,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:40:48,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:40:48,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:40:48,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-11-14 17:40:48,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 407 transitions. [2018-11-14 17:40:48,418 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 407 transitions. Word has length 61 [2018-11-14 17:40:48,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:40:48,419 INFO L480 AbstractCegarLoop]: Abstraction has 326 states and 407 transitions. [2018-11-14 17:40:48,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 17:40:48,419 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 407 transitions. [2018-11-14 17:40:48,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 17:40:48,421 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:40:48,421 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:40:48,421 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:40:48,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:40:48,421 INFO L82 PathProgramCache]: Analyzing trace with hash -73854379, now seen corresponding path program 3 times [2018-11-14 17:40:48,422 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:40:48,422 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 17:40:48,451 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 17:40:49,181 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2018-11-14 17:40:49,182 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 17:40:49,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:40:49,244 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:40:49,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 30 [2018-11-14 17:40:49,807 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:40:49,810 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:40:49,811 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-11-14 17:40:49,820 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:40:49,829 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:40:49,837 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:40:49,837 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:7 [2018-11-14 17:40:49,849 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:40:50,047 INFO L256 TraceCheckUtils]: 0: Hoare triple {6824#true} call ULTIMATE.init(); {6824#true} is VALID [2018-11-14 17:40:50,047 INFO L273 TraceCheckUtils]: 1: Hoare triple {6824#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6824#true} is VALID [2018-11-14 17:40:50,047 INFO L273 TraceCheckUtils]: 2: Hoare triple {6824#true} assume true; {6824#true} is VALID [2018-11-14 17:40:50,048 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6824#true} {6824#true} #137#return; {6824#true} is VALID [2018-11-14 17:40:50,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {6824#true} call #t~ret15 := main(); {6824#true} is VALID [2018-11-14 17:40:50,054 INFO L273 TraceCheckUtils]: 5: Hoare triple {6824#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {6844#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:40:50,054 INFO L273 TraceCheckUtils]: 6: Hoare triple {6844#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {6844#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:40:50,055 INFO L273 TraceCheckUtils]: 7: Hoare triple {6844#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {6851#(and (= main_~k~0 main_~i~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~s~0 (_ bv4294967295 32)) main_~i~0))} is VALID [2018-11-14 17:40:50,069 INFO L273 TraceCheckUtils]: 8: Hoare triple {6851#(and (= main_~k~0 main_~i~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~s~0 (_ bv4294967295 32)) main_~i~0))} assume true; {6851#(and (= main_~k~0 main_~i~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~s~0 (_ bv4294967295 32)) main_~i~0))} is VALID [2018-11-14 17:40:50,070 INFO L273 TraceCheckUtils]: 9: Hoare triple {6851#(and (= main_~k~0 main_~i~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= (bvadd main_~s~0 (_ bv4294967295 32)) main_~i~0))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6858#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) |main_#t~mem1|) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) |main_#t~mem0|) (= main_~k~0 main_~i~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:40:50,079 INFO L273 TraceCheckUtils]: 10: Hoare triple {6858#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32))) |main_#t~mem1|) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) |main_#t~mem0|) (= main_~k~0 main_~i~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6862#(and (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (= main_~k~0 main_~i~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 main_~s~0))} is VALID [2018-11-14 17:40:50,084 INFO L273 TraceCheckUtils]: 11: Hoare triple {6862#(and (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (= main_~k~0 main_~i~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)) (= main_~k~0 main_~s~0))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6866#(and (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (= main_~s~0 main_~i~0) (= (bvadd main_~k~0 (_ bv4294967295 32)) main_~i~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:40:50,086 INFO L273 TraceCheckUtils]: 12: Hoare triple {6866#(and (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (= main_~s~0 main_~i~0) (= (bvadd main_~k~0 (_ bv4294967295 32)) main_~i~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {6866#(and (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (= main_~s~0 main_~i~0) (= (bvadd main_~k~0 (_ bv4294967295 32)) main_~i~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 17:40:50,092 INFO L273 TraceCheckUtils]: 13: Hoare triple {6866#(and (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~i~0) (_ bv4 32)))) (= main_~s~0 main_~i~0) (= (bvadd main_~k~0 (_ bv4294967295 32)) main_~i~0) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6873#(and (= main_~i~0 (_ bv0 32)) (bvsgt |main_#t~mem1| |main_#t~mem0|))} is VALID [2018-11-14 17:40:50,097 INFO L273 TraceCheckUtils]: 14: Hoare triple {6873#(and (= main_~i~0 (_ bv0 32)) (bvsgt |main_#t~mem1| |main_#t~mem0|))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,097 INFO L273 TraceCheckUtils]: 15: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,097 INFO L273 TraceCheckUtils]: 16: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,097 INFO L273 TraceCheckUtils]: 17: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,097 INFO L273 TraceCheckUtils]: 18: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,098 INFO L273 TraceCheckUtils]: 19: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,098 INFO L273 TraceCheckUtils]: 20: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,098 INFO L273 TraceCheckUtils]: 21: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,098 INFO L273 TraceCheckUtils]: 22: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,098 INFO L273 TraceCheckUtils]: 23: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,099 INFO L273 TraceCheckUtils]: 24: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,099 INFO L273 TraceCheckUtils]: 25: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,099 INFO L273 TraceCheckUtils]: 26: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,099 INFO L273 TraceCheckUtils]: 27: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,099 INFO L273 TraceCheckUtils]: 28: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,099 INFO L273 TraceCheckUtils]: 29: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,100 INFO L273 TraceCheckUtils]: 30: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,100 INFO L273 TraceCheckUtils]: 31: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,100 INFO L273 TraceCheckUtils]: 32: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,100 INFO L273 TraceCheckUtils]: 33: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,100 INFO L273 TraceCheckUtils]: 34: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,101 INFO L273 TraceCheckUtils]: 35: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,101 INFO L273 TraceCheckUtils]: 36: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,101 INFO L273 TraceCheckUtils]: 37: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,101 INFO L273 TraceCheckUtils]: 38: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,101 INFO L273 TraceCheckUtils]: 39: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,102 INFO L273 TraceCheckUtils]: 40: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,102 INFO L273 TraceCheckUtils]: 41: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,102 INFO L273 TraceCheckUtils]: 42: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,102 INFO L273 TraceCheckUtils]: 43: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,102 INFO L273 TraceCheckUtils]: 44: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,103 INFO L273 TraceCheckUtils]: 45: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,103 INFO L273 TraceCheckUtils]: 46: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,103 INFO L273 TraceCheckUtils]: 47: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,103 INFO L273 TraceCheckUtils]: 48: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,103 INFO L273 TraceCheckUtils]: 49: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,103 INFO L273 TraceCheckUtils]: 50: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,104 INFO L273 TraceCheckUtils]: 51: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,104 INFO L273 TraceCheckUtils]: 52: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,104 INFO L273 TraceCheckUtils]: 53: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,104 INFO L273 TraceCheckUtils]: 54: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,104 INFO L273 TraceCheckUtils]: 55: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,104 INFO L273 TraceCheckUtils]: 56: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,105 INFO L273 TraceCheckUtils]: 57: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,105 INFO L273 TraceCheckUtils]: 58: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,105 INFO L273 TraceCheckUtils]: 59: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,105 INFO L273 TraceCheckUtils]: 60: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,105 INFO L273 TraceCheckUtils]: 61: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,106 INFO L273 TraceCheckUtils]: 62: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,106 INFO L273 TraceCheckUtils]: 63: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,106 INFO L273 TraceCheckUtils]: 64: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,106 INFO L273 TraceCheckUtils]: 65: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,106 INFO L273 TraceCheckUtils]: 66: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,106 INFO L273 TraceCheckUtils]: 67: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,107 INFO L273 TraceCheckUtils]: 68: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,107 INFO L273 TraceCheckUtils]: 69: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,107 INFO L273 TraceCheckUtils]: 70: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,107 INFO L273 TraceCheckUtils]: 71: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,107 INFO L273 TraceCheckUtils]: 72: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,108 INFO L273 TraceCheckUtils]: 73: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,108 INFO L273 TraceCheckUtils]: 74: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,108 INFO L273 TraceCheckUtils]: 75: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,108 INFO L273 TraceCheckUtils]: 76: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,108 INFO L273 TraceCheckUtils]: 77: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,109 INFO L273 TraceCheckUtils]: 78: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,109 INFO L273 TraceCheckUtils]: 79: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,109 INFO L273 TraceCheckUtils]: 80: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,109 INFO L273 TraceCheckUtils]: 81: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,109 INFO L273 TraceCheckUtils]: 82: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,109 INFO L273 TraceCheckUtils]: 83: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,110 INFO L273 TraceCheckUtils]: 84: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,110 INFO L273 TraceCheckUtils]: 85: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,110 INFO L273 TraceCheckUtils]: 86: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,110 INFO L273 TraceCheckUtils]: 87: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,110 INFO L273 TraceCheckUtils]: 88: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,110 INFO L273 TraceCheckUtils]: 89: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,111 INFO L273 TraceCheckUtils]: 90: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,111 INFO L273 TraceCheckUtils]: 91: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,111 INFO L273 TraceCheckUtils]: 92: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,111 INFO L273 TraceCheckUtils]: 93: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,111 INFO L273 TraceCheckUtils]: 94: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:50,112 INFO L273 TraceCheckUtils]: 95: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:50,112 INFO L273 TraceCheckUtils]: 96: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,112 INFO L273 TraceCheckUtils]: 97: Hoare triple {6825#false} assume !~bvslt32(~k~0, 100000bv32); {6825#false} is VALID [2018-11-14 17:40:50,112 INFO L273 TraceCheckUtils]: 98: Hoare triple {6825#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,112 INFO L273 TraceCheckUtils]: 99: Hoare triple {6825#false} ~x~0 := 0bv32; {6825#false} is VALID [2018-11-14 17:40:50,112 INFO L273 TraceCheckUtils]: 100: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,113 INFO L273 TraceCheckUtils]: 101: Hoare triple {6825#false} assume !~bvslt32(~x~0, ~i~0); {6825#false} is VALID [2018-11-14 17:40:50,113 INFO L273 TraceCheckUtils]: 102: Hoare triple {6825#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {6825#false} is VALID [2018-11-14 17:40:50,113 INFO L273 TraceCheckUtils]: 103: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:50,113 INFO L273 TraceCheckUtils]: 104: Hoare triple {6825#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:50,113 INFO L256 TraceCheckUtils]: 105: Hoare triple {6825#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {6825#false} is VALID [2018-11-14 17:40:50,114 INFO L273 TraceCheckUtils]: 106: Hoare triple {6825#false} ~cond := #in~cond; {6825#false} is VALID [2018-11-14 17:40:50,114 INFO L273 TraceCheckUtils]: 107: Hoare triple {6825#false} assume ~cond == 0bv32; {6825#false} is VALID [2018-11-14 17:40:50,114 INFO L273 TraceCheckUtils]: 108: Hoare triple {6825#false} assume !false; {6825#false} is VALID [2018-11-14 17:40:50,125 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 145 proven. 3 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-11-14 17:40:50,125 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:40:52,632 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-14 17:40:52,657 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:40:54,664 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|)) [2018-11-14 17:40:56,700 WARN L669 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|)) [2018-11-14 17:40:56,708 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:40:56,713 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:40:56,717 INFO L682 Elim1Store]: detected equality via solver [2018-11-14 17:40:56,718 INFO L303 Elim1Store]: Index analysis took 4083 ms [2018-11-14 17:40:56,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 53 [2018-11-14 17:40:56,733 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:40:56,752 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:40:56,762 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:40:56,762 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:24 [2018-11-14 17:40:56,784 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:40:56,995 INFO L273 TraceCheckUtils]: 108: Hoare triple {6825#false} assume !false; {6825#false} is VALID [2018-11-14 17:40:56,996 INFO L273 TraceCheckUtils]: 107: Hoare triple {6825#false} assume ~cond == 0bv32; {6825#false} is VALID [2018-11-14 17:40:56,996 INFO L273 TraceCheckUtils]: 106: Hoare triple {6825#false} ~cond := #in~cond; {6825#false} is VALID [2018-11-14 17:40:56,996 INFO L256 TraceCheckUtils]: 105: Hoare triple {6825#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {6825#false} is VALID [2018-11-14 17:40:56,996 INFO L273 TraceCheckUtils]: 104: Hoare triple {6825#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:56,996 INFO L273 TraceCheckUtils]: 103: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:56,996 INFO L273 TraceCheckUtils]: 102: Hoare triple {6825#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {6825#false} is VALID [2018-11-14 17:40:56,997 INFO L273 TraceCheckUtils]: 101: Hoare triple {6825#false} assume !~bvslt32(~x~0, ~i~0); {6825#false} is VALID [2018-11-14 17:40:56,997 INFO L273 TraceCheckUtils]: 100: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:56,997 INFO L273 TraceCheckUtils]: 99: Hoare triple {6825#false} ~x~0 := 0bv32; {6825#false} is VALID [2018-11-14 17:40:56,997 INFO L273 TraceCheckUtils]: 98: Hoare triple {6825#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:56,997 INFO L273 TraceCheckUtils]: 97: Hoare triple {6825#false} assume !~bvslt32(~k~0, 100000bv32); {6825#false} is VALID [2018-11-14 17:40:56,997 INFO L273 TraceCheckUtils]: 96: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:56,997 INFO L273 TraceCheckUtils]: 95: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:56,997 INFO L273 TraceCheckUtils]: 94: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:56,998 INFO L273 TraceCheckUtils]: 93: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:56,998 INFO L273 TraceCheckUtils]: 92: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:56,998 INFO L273 TraceCheckUtils]: 91: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:56,998 INFO L273 TraceCheckUtils]: 90: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:56,998 INFO L273 TraceCheckUtils]: 89: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:56,998 INFO L273 TraceCheckUtils]: 88: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:56,998 INFO L273 TraceCheckUtils]: 87: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:56,999 INFO L273 TraceCheckUtils]: 86: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:56,999 INFO L273 TraceCheckUtils]: 85: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:56,999 INFO L273 TraceCheckUtils]: 84: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:56,999 INFO L273 TraceCheckUtils]: 83: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,000 INFO L273 TraceCheckUtils]: 82: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,000 INFO L273 TraceCheckUtils]: 81: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,000 INFO L273 TraceCheckUtils]: 80: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,000 INFO L273 TraceCheckUtils]: 79: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,000 INFO L273 TraceCheckUtils]: 78: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,000 INFO L273 TraceCheckUtils]: 77: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,001 INFO L273 TraceCheckUtils]: 76: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,001 INFO L273 TraceCheckUtils]: 75: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,001 INFO L273 TraceCheckUtils]: 74: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,001 INFO L273 TraceCheckUtils]: 73: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,001 INFO L273 TraceCheckUtils]: 72: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,002 INFO L273 TraceCheckUtils]: 71: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,002 INFO L273 TraceCheckUtils]: 70: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,002 INFO L273 TraceCheckUtils]: 69: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,002 INFO L273 TraceCheckUtils]: 68: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,002 INFO L273 TraceCheckUtils]: 67: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,003 INFO L273 TraceCheckUtils]: 66: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,003 INFO L273 TraceCheckUtils]: 65: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,003 INFO L273 TraceCheckUtils]: 64: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,003 INFO L273 TraceCheckUtils]: 63: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,003 INFO L273 TraceCheckUtils]: 62: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,003 INFO L273 TraceCheckUtils]: 61: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,004 INFO L273 TraceCheckUtils]: 60: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,004 INFO L273 TraceCheckUtils]: 59: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,004 INFO L273 TraceCheckUtils]: 58: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,004 INFO L273 TraceCheckUtils]: 57: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,004 INFO L273 TraceCheckUtils]: 56: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,004 INFO L273 TraceCheckUtils]: 55: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,005 INFO L273 TraceCheckUtils]: 54: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,005 INFO L273 TraceCheckUtils]: 53: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,005 INFO L273 TraceCheckUtils]: 52: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,005 INFO L273 TraceCheckUtils]: 51: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,005 INFO L273 TraceCheckUtils]: 50: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,005 INFO L273 TraceCheckUtils]: 49: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,006 INFO L273 TraceCheckUtils]: 48: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,006 INFO L273 TraceCheckUtils]: 47: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,006 INFO L273 TraceCheckUtils]: 46: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,006 INFO L273 TraceCheckUtils]: 45: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,006 INFO L273 TraceCheckUtils]: 44: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,007 INFO L273 TraceCheckUtils]: 43: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,007 INFO L273 TraceCheckUtils]: 42: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,007 INFO L273 TraceCheckUtils]: 41: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,007 INFO L273 TraceCheckUtils]: 40: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,007 INFO L273 TraceCheckUtils]: 39: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,007 INFO L273 TraceCheckUtils]: 38: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,008 INFO L273 TraceCheckUtils]: 37: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,008 INFO L273 TraceCheckUtils]: 36: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,008 INFO L273 TraceCheckUtils]: 35: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,008 INFO L273 TraceCheckUtils]: 34: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,008 INFO L273 TraceCheckUtils]: 33: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,009 INFO L273 TraceCheckUtils]: 32: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,009 INFO L273 TraceCheckUtils]: 31: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,009 INFO L273 TraceCheckUtils]: 30: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,009 INFO L273 TraceCheckUtils]: 29: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,009 INFO L273 TraceCheckUtils]: 28: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,009 INFO L273 TraceCheckUtils]: 27: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,010 INFO L273 TraceCheckUtils]: 26: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,010 INFO L273 TraceCheckUtils]: 25: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,010 INFO L273 TraceCheckUtils]: 24: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,010 INFO L273 TraceCheckUtils]: 23: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,010 INFO L273 TraceCheckUtils]: 22: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,010 INFO L273 TraceCheckUtils]: 21: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,011 INFO L273 TraceCheckUtils]: 20: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,011 INFO L273 TraceCheckUtils]: 19: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,011 INFO L273 TraceCheckUtils]: 18: Hoare triple {6825#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,011 INFO L273 TraceCheckUtils]: 17: Hoare triple {6825#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6825#false} is VALID [2018-11-14 17:40:57,011 INFO L273 TraceCheckUtils]: 16: Hoare triple {6825#false} assume true; {6825#false} is VALID [2018-11-14 17:40:57,012 INFO L273 TraceCheckUtils]: 15: Hoare triple {6825#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {6825#false} is VALID [2018-11-14 17:40:57,015 INFO L273 TraceCheckUtils]: 14: Hoare triple {7441#(not (bvsgt |main_#t~mem0| |main_#t~mem1|))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {6825#false} is VALID [2018-11-14 17:40:57,018 INFO L273 TraceCheckUtils]: 13: Hoare triple {7445#(not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {7441#(not (bvsgt |main_#t~mem0| |main_#t~mem1|))} is VALID [2018-11-14 17:40:57,019 INFO L273 TraceCheckUtils]: 12: Hoare triple {7445#(not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|))))} assume true; {7445#(not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|))))} is VALID [2018-11-14 17:40:59,045 INFO L273 TraceCheckUtils]: 11: Hoare triple {7452#(not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7445#(not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|))))} is UNKNOWN [2018-11-14 17:40:59,048 INFO L273 TraceCheckUtils]: 10: Hoare triple {7456#(or (not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))))) (not (bvsgt |main_#t~mem0| |main_#t~mem1|)))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7452#(not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|))))} is VALID [2018-11-14 17:41:01,056 INFO L273 TraceCheckUtils]: 9: Hoare triple {7460#(or (= (bvmul (_ bv4 32) main_~k~0) (bvmul (_ bv4 32) main_~s~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvmul (_ bv4 32) main_~s~0)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {7456#(or (not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))))) (not (bvsgt |main_#t~mem0| |main_#t~mem1|)))} is UNKNOWN [2018-11-14 17:41:01,056 INFO L273 TraceCheckUtils]: 8: Hoare triple {7460#(or (= (bvmul (_ bv4 32) main_~k~0) (bvmul (_ bv4 32) main_~s~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvmul (_ bv4 32) main_~s~0)))} assume true; {7460#(or (= (bvmul (_ bv4 32) main_~k~0) (bvmul (_ bv4 32) main_~s~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvmul (_ bv4 32) main_~s~0)))} is VALID [2018-11-14 17:41:01,068 INFO L273 TraceCheckUtils]: 7: Hoare triple {6824#true} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {7460#(or (= (bvmul (_ bv4 32) main_~k~0) (bvmul (_ bv4 32) main_~s~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvmul (_ bv4 32) main_~s~0)))} is VALID [2018-11-14 17:41:01,068 INFO L273 TraceCheckUtils]: 6: Hoare triple {6824#true} assume true; {6824#true} is VALID [2018-11-14 17:41:01,068 INFO L273 TraceCheckUtils]: 5: Hoare triple {6824#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {6824#true} is VALID [2018-11-14 17:41:01,069 INFO L256 TraceCheckUtils]: 4: Hoare triple {6824#true} call #t~ret15 := main(); {6824#true} is VALID [2018-11-14 17:41:01,069 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {6824#true} {6824#true} #137#return; {6824#true} is VALID [2018-11-14 17:41:01,069 INFO L273 TraceCheckUtils]: 2: Hoare triple {6824#true} assume true; {6824#true} is VALID [2018-11-14 17:41:01,069 INFO L273 TraceCheckUtils]: 1: Hoare triple {6824#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {6824#true} is VALID [2018-11-14 17:41:01,069 INFO L256 TraceCheckUtils]: 0: Hoare triple {6824#true} call ULTIMATE.init(); {6824#true} is VALID [2018-11-14 17:41:01,076 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 146 proven. 2 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2018-11-14 17:41:01,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:41:01,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-14 17:41:01,081 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2018-11-14 17:41:01,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:41:01,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-14 17:41:05,189 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 39 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-14 17:41:05,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-14 17:41:05,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-14 17:41:05,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-11-14 17:41:05,191 INFO L87 Difference]: Start difference. First operand 326 states and 407 transitions. Second operand 13 states. [2018-11-14 17:41:12,527 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-14 17:41:19,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:41:19,954 INFO L93 Difference]: Finished difference Result 613 states and 761 transitions. [2018-11-14 17:41:19,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-14 17:41:19,955 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 109 [2018-11-14 17:41:19,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:41:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:41:19,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 189 transitions. [2018-11-14 17:41:19,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-14 17:41:19,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 189 transitions. [2018-11-14 17:41:19,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 189 transitions. [2018-11-14 17:41:26,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 186 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-14 17:41:26,576 INFO L225 Difference]: With dead ends: 613 [2018-11-14 17:41:26,577 INFO L226 Difference]: Without dead ends: 390 [2018-11-14 17:41:26,578 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 206 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=107, Invalid=355, Unknown=0, NotChecked=0, Total=462 [2018-11-14 17:41:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-11-14 17:41:26,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 330. [2018-11-14 17:41:26,823 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:41:26,824 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand 330 states. [2018-11-14 17:41:26,824 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand 330 states. [2018-11-14 17:41:26,824 INFO L87 Difference]: Start difference. First operand 390 states. Second operand 330 states. [2018-11-14 17:41:26,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:41:26,841 INFO L93 Difference]: Finished difference Result 390 states and 477 transitions. [2018-11-14 17:41:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 477 transitions. [2018-11-14 17:41:26,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:41:26,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:41:26,843 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand 390 states. [2018-11-14 17:41:26,843 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 390 states. [2018-11-14 17:41:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:41:26,859 INFO L93 Difference]: Finished difference Result 390 states and 477 transitions. [2018-11-14 17:41:26,859 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 477 transitions. [2018-11-14 17:41:26,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:41:26,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:41:26,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:41:26,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:41:26,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-11-14 17:41:26,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 409 transitions. [2018-11-14 17:41:26,873 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 409 transitions. Word has length 109 [2018-11-14 17:41:26,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:41:26,874 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 409 transitions. [2018-11-14 17:41:26,874 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-14 17:41:26,874 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 409 transitions. [2018-11-14 17:41:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-11-14 17:41:26,876 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:41:26,876 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:41:26,876 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:41:26,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:41:26,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1277530839, now seen corresponding path program 1 times [2018-11-14 17:41:26,877 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 17:41:26,877 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 11 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 11 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 17:41:26,905 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 17:41:27,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:41:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:41:27,203 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:41:28,028 INFO L256 TraceCheckUtils]: 0: Hoare triple {9477#true} call ULTIMATE.init(); {9477#true} is VALID [2018-11-14 17:41:28,028 INFO L273 TraceCheckUtils]: 1: Hoare triple {9477#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {9477#true} is VALID [2018-11-14 17:41:28,029 INFO L273 TraceCheckUtils]: 2: Hoare triple {9477#true} assume true; {9477#true} is VALID [2018-11-14 17:41:28,029 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9477#true} {9477#true} #137#return; {9477#true} is VALID [2018-11-14 17:41:28,029 INFO L256 TraceCheckUtils]: 4: Hoare triple {9477#true} call #t~ret15 := main(); {9477#true} is VALID [2018-11-14 17:41:28,030 INFO L273 TraceCheckUtils]: 5: Hoare triple {9477#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {9497#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:41:28,030 INFO L273 TraceCheckUtils]: 6: Hoare triple {9497#(= main_~i~0 (_ bv0 32))} assume true; {9497#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 17:41:28,031 INFO L273 TraceCheckUtils]: 7: Hoare triple {9497#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {9504#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:41:28,031 INFO L273 TraceCheckUtils]: 8: Hoare triple {9504#(= main_~k~0 (_ bv0 32))} assume true; {9504#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:41:28,031 INFO L273 TraceCheckUtils]: 9: Hoare triple {9504#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9504#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:41:28,032 INFO L273 TraceCheckUtils]: 10: Hoare triple {9504#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9504#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-14 17:41:28,032 INFO L273 TraceCheckUtils]: 11: Hoare triple {9504#(= main_~k~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9517#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,033 INFO L273 TraceCheckUtils]: 12: Hoare triple {9517#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {9517#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,033 INFO L273 TraceCheckUtils]: 13: Hoare triple {9517#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9517#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,034 INFO L273 TraceCheckUtils]: 14: Hoare triple {9517#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0; {9517#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,034 INFO L273 TraceCheckUtils]: 15: Hoare triple {9517#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9530#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,035 INFO L273 TraceCheckUtils]: 16: Hoare triple {9530#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {9530#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,036 INFO L273 TraceCheckUtils]: 17: Hoare triple {9530#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9530#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,036 INFO L273 TraceCheckUtils]: 18: Hoare triple {9530#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9530#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,037 INFO L273 TraceCheckUtils]: 19: Hoare triple {9530#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9543#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,037 INFO L273 TraceCheckUtils]: 20: Hoare triple {9543#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {9543#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,038 INFO L273 TraceCheckUtils]: 21: Hoare triple {9543#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9543#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,038 INFO L273 TraceCheckUtils]: 22: Hoare triple {9543#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9543#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,039 INFO L273 TraceCheckUtils]: 23: Hoare triple {9543#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9556#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,040 INFO L273 TraceCheckUtils]: 24: Hoare triple {9556#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {9556#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,040 INFO L273 TraceCheckUtils]: 25: Hoare triple {9556#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9556#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,041 INFO L273 TraceCheckUtils]: 26: Hoare triple {9556#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9556#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,042 INFO L273 TraceCheckUtils]: 27: Hoare triple {9556#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9569#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,042 INFO L273 TraceCheckUtils]: 28: Hoare triple {9569#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {9569#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,043 INFO L273 TraceCheckUtils]: 29: Hoare triple {9569#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9569#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,043 INFO L273 TraceCheckUtils]: 30: Hoare triple {9569#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9569#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,044 INFO L273 TraceCheckUtils]: 31: Hoare triple {9569#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9582#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 17:41:28,045 INFO L273 TraceCheckUtils]: 32: Hoare triple {9582#(= (_ bv6 32) main_~k~0)} assume true; {9582#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 17:41:28,051 INFO L273 TraceCheckUtils]: 33: Hoare triple {9582#(= (_ bv6 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9582#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 17:41:28,051 INFO L273 TraceCheckUtils]: 34: Hoare triple {9582#(= (_ bv6 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9582#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 17:41:28,052 INFO L273 TraceCheckUtils]: 35: Hoare triple {9582#(= (_ bv6 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {9595#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,052 INFO L273 TraceCheckUtils]: 36: Hoare triple {9595#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {9595#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,052 INFO L273 TraceCheckUtils]: 37: Hoare triple {9595#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9595#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,053 INFO L273 TraceCheckUtils]: 38: Hoare triple {9595#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9595#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,053 INFO L273 TraceCheckUtils]: 39: Hoare triple {9595#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9608#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,053 INFO L273 TraceCheckUtils]: 40: Hoare triple {9608#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {9608#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,054 INFO L273 TraceCheckUtils]: 41: Hoare triple {9608#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9608#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,054 INFO L273 TraceCheckUtils]: 42: Hoare triple {9608#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9608#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,054 INFO L273 TraceCheckUtils]: 43: Hoare triple {9608#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9621#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,055 INFO L273 TraceCheckUtils]: 44: Hoare triple {9621#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} assume true; {9621#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,055 INFO L273 TraceCheckUtils]: 45: Hoare triple {9621#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9621#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,056 INFO L273 TraceCheckUtils]: 46: Hoare triple {9621#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9621#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,057 INFO L273 TraceCheckUtils]: 47: Hoare triple {9621#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9634#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,057 INFO L273 TraceCheckUtils]: 48: Hoare triple {9634#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {9634#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,058 INFO L273 TraceCheckUtils]: 49: Hoare triple {9634#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9634#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,058 INFO L273 TraceCheckUtils]: 50: Hoare triple {9634#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9634#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,059 INFO L273 TraceCheckUtils]: 51: Hoare triple {9634#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9647#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 17:41:28,060 INFO L273 TraceCheckUtils]: 52: Hoare triple {9647#(= (_ bv11 32) main_~k~0)} assume true; {9647#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 17:41:28,060 INFO L273 TraceCheckUtils]: 53: Hoare triple {9647#(= (_ bv11 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9647#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 17:41:28,061 INFO L273 TraceCheckUtils]: 54: Hoare triple {9647#(= (_ bv11 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9647#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 17:41:28,061 INFO L273 TraceCheckUtils]: 55: Hoare triple {9647#(= (_ bv11 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {9660#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,062 INFO L273 TraceCheckUtils]: 56: Hoare triple {9660#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {9660#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,062 INFO L273 TraceCheckUtils]: 57: Hoare triple {9660#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9660#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,063 INFO L273 TraceCheckUtils]: 58: Hoare triple {9660#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9660#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,064 INFO L273 TraceCheckUtils]: 59: Hoare triple {9660#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9673#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,064 INFO L273 TraceCheckUtils]: 60: Hoare triple {9673#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} assume true; {9673#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,065 INFO L273 TraceCheckUtils]: 61: Hoare triple {9673#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9673#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,065 INFO L273 TraceCheckUtils]: 62: Hoare triple {9673#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9673#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,066 INFO L273 TraceCheckUtils]: 63: Hoare triple {9673#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9686#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,083 INFO L273 TraceCheckUtils]: 64: Hoare triple {9686#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} assume true; {9686#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,091 INFO L273 TraceCheckUtils]: 65: Hoare triple {9686#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9686#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,092 INFO L273 TraceCheckUtils]: 66: Hoare triple {9686#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9686#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,092 INFO L273 TraceCheckUtils]: 67: Hoare triple {9686#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9699#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-14 17:41:28,093 INFO L273 TraceCheckUtils]: 68: Hoare triple {9699#(= (_ bv15 32) main_~k~0)} assume true; {9699#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-14 17:41:28,093 INFO L273 TraceCheckUtils]: 69: Hoare triple {9699#(= (_ bv15 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9699#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-14 17:41:28,093 INFO L273 TraceCheckUtils]: 70: Hoare triple {9699#(= (_ bv15 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9699#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-14 17:41:28,094 INFO L273 TraceCheckUtils]: 71: Hoare triple {9699#(= (_ bv15 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {9712#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,094 INFO L273 TraceCheckUtils]: 72: Hoare triple {9712#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume true; {9712#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,094 INFO L273 TraceCheckUtils]: 73: Hoare triple {9712#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9712#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,095 INFO L273 TraceCheckUtils]: 74: Hoare triple {9712#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9712#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,096 INFO L273 TraceCheckUtils]: 75: Hoare triple {9712#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9725#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,096 INFO L273 TraceCheckUtils]: 76: Hoare triple {9725#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} assume true; {9725#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,097 INFO L273 TraceCheckUtils]: 77: Hoare triple {9725#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9725#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,097 INFO L273 TraceCheckUtils]: 78: Hoare triple {9725#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9725#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,098 INFO L273 TraceCheckUtils]: 79: Hoare triple {9725#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9738#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,099 INFO L273 TraceCheckUtils]: 80: Hoare triple {9738#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume true; {9738#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,099 INFO L273 TraceCheckUtils]: 81: Hoare triple {9738#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9738#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,100 INFO L273 TraceCheckUtils]: 82: Hoare triple {9738#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9738#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,100 INFO L273 TraceCheckUtils]: 83: Hoare triple {9738#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9751#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-14 17:41:28,101 INFO L273 TraceCheckUtils]: 84: Hoare triple {9751#(= (_ bv19 32) main_~k~0)} assume true; {9751#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-14 17:41:28,101 INFO L273 TraceCheckUtils]: 85: Hoare triple {9751#(= (_ bv19 32) main_~k~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9751#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-14 17:41:28,102 INFO L273 TraceCheckUtils]: 86: Hoare triple {9751#(= (_ bv19 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9751#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-14 17:41:28,103 INFO L273 TraceCheckUtils]: 87: Hoare triple {9751#(= (_ bv19 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {9764#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,103 INFO L273 TraceCheckUtils]: 88: Hoare triple {9764#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {9764#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,104 INFO L273 TraceCheckUtils]: 89: Hoare triple {9764#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9764#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,104 INFO L273 TraceCheckUtils]: 90: Hoare triple {9764#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9764#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,105 INFO L273 TraceCheckUtils]: 91: Hoare triple {9764#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9777#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,105 INFO L273 TraceCheckUtils]: 92: Hoare triple {9777#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} assume true; {9777#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,106 INFO L273 TraceCheckUtils]: 93: Hoare triple {9777#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9777#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,106 INFO L273 TraceCheckUtils]: 94: Hoare triple {9777#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9777#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,107 INFO L273 TraceCheckUtils]: 95: Hoare triple {9777#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9790#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,108 INFO L273 TraceCheckUtils]: 96: Hoare triple {9790#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {9790#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 17:41:28,108 INFO L273 TraceCheckUtils]: 97: Hoare triple {9790#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {9478#false} is VALID [2018-11-14 17:41:28,108 INFO L273 TraceCheckUtils]: 98: Hoare triple {9478#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {9478#false} is VALID [2018-11-14 17:41:28,109 INFO L273 TraceCheckUtils]: 99: Hoare triple {9478#false} ~x~0 := 0bv32; {9478#false} is VALID [2018-11-14 17:41:28,109 INFO L273 TraceCheckUtils]: 100: Hoare triple {9478#false} assume true; {9478#false} is VALID [2018-11-14 17:41:28,109 INFO L273 TraceCheckUtils]: 101: Hoare triple {9478#false} assume !~bvslt32(~x~0, ~i~0); {9478#false} is VALID [2018-11-14 17:41:28,109 INFO L273 TraceCheckUtils]: 102: Hoare triple {9478#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {9478#false} is VALID [2018-11-14 17:41:28,110 INFO L273 TraceCheckUtils]: 103: Hoare triple {9478#false} assume true; {9478#false} is VALID [2018-11-14 17:41:28,110 INFO L273 TraceCheckUtils]: 104: Hoare triple {9478#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {9478#false} is VALID [2018-11-14 17:41:28,110 INFO L256 TraceCheckUtils]: 105: Hoare triple {9478#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {9478#false} is VALID [2018-11-14 17:41:28,110 INFO L273 TraceCheckUtils]: 106: Hoare triple {9478#false} ~cond := #in~cond; {9478#false} is VALID [2018-11-14 17:41:28,111 INFO L273 TraceCheckUtils]: 107: Hoare triple {9478#false} assume ~cond == 0bv32; {9478#false} is VALID [2018-11-14 17:41:28,111 INFO L273 TraceCheckUtils]: 108: Hoare triple {9478#false} assume !false; {9478#false} is VALID [2018-11-14 17:41:28,129 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:41:28,129 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 17:41:30,074 INFO L273 TraceCheckUtils]: 108: Hoare triple {9478#false} assume !false; {9478#false} is VALID [2018-11-14 17:41:30,074 INFO L273 TraceCheckUtils]: 107: Hoare triple {9478#false} assume ~cond == 0bv32; {9478#false} is VALID [2018-11-14 17:41:30,074 INFO L273 TraceCheckUtils]: 106: Hoare triple {9478#false} ~cond := #in~cond; {9478#false} is VALID [2018-11-14 17:41:30,074 INFO L256 TraceCheckUtils]: 105: Hoare triple {9478#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {9478#false} is VALID [2018-11-14 17:41:30,075 INFO L273 TraceCheckUtils]: 104: Hoare triple {9478#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem10 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {9478#false} is VALID [2018-11-14 17:41:30,075 INFO L273 TraceCheckUtils]: 103: Hoare triple {9478#false} assume true; {9478#false} is VALID [2018-11-14 17:41:30,075 INFO L273 TraceCheckUtils]: 102: Hoare triple {9478#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {9478#false} is VALID [2018-11-14 17:41:30,075 INFO L273 TraceCheckUtils]: 101: Hoare triple {9478#false} assume !~bvslt32(~x~0, ~i~0); {9478#false} is VALID [2018-11-14 17:41:30,075 INFO L273 TraceCheckUtils]: 100: Hoare triple {9478#false} assume true; {9478#false} is VALID [2018-11-14 17:41:30,076 INFO L273 TraceCheckUtils]: 99: Hoare triple {9478#false} ~x~0 := 0bv32; {9478#false} is VALID [2018-11-14 17:41:30,076 INFO L273 TraceCheckUtils]: 98: Hoare triple {9478#false} assume ~s~0 != ~i~0;call #t~mem2 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);~tmp~0 := #t~mem2;havoc #t~mem2;call #t~mem3 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32);havoc #t~mem3;call write~intINTTYPE4(~tmp~0, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32); {9478#false} is VALID [2018-11-14 17:41:30,076 INFO L273 TraceCheckUtils]: 97: Hoare triple {9863#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {9478#false} is VALID [2018-11-14 17:41:30,077 INFO L273 TraceCheckUtils]: 96: Hoare triple {9863#(bvslt main_~k~0 (_ bv100000 32))} assume true; {9863#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 17:41:30,078 INFO L273 TraceCheckUtils]: 95: Hoare triple {9870#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9863#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 17:41:30,078 INFO L273 TraceCheckUtils]: 94: Hoare triple {9870#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9870#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,078 INFO L273 TraceCheckUtils]: 93: Hoare triple {9870#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9870#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,079 INFO L273 TraceCheckUtils]: 92: Hoare triple {9870#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume true; {9870#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,087 INFO L273 TraceCheckUtils]: 91: Hoare triple {9883#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9870#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,087 INFO L273 TraceCheckUtils]: 90: Hoare triple {9883#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9883#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,087 INFO L273 TraceCheckUtils]: 89: Hoare triple {9883#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9883#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,088 INFO L273 TraceCheckUtils]: 88: Hoare triple {9883#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume true; {9883#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,094 INFO L273 TraceCheckUtils]: 87: Hoare triple {9896#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9883#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,094 INFO L273 TraceCheckUtils]: 86: Hoare triple {9896#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9896#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,095 INFO L273 TraceCheckUtils]: 85: Hoare triple {9896#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9896#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,095 INFO L273 TraceCheckUtils]: 84: Hoare triple {9896#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume true; {9896#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,100 INFO L273 TraceCheckUtils]: 83: Hoare triple {9909#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9896#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,101 INFO L273 TraceCheckUtils]: 82: Hoare triple {9909#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9909#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,101 INFO L273 TraceCheckUtils]: 81: Hoare triple {9909#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9909#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,101 INFO L273 TraceCheckUtils]: 80: Hoare triple {9909#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume true; {9909#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,107 INFO L273 TraceCheckUtils]: 79: Hoare triple {9922#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9909#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,108 INFO L273 TraceCheckUtils]: 78: Hoare triple {9922#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9922#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,108 INFO L273 TraceCheckUtils]: 77: Hoare triple {9922#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9922#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,109 INFO L273 TraceCheckUtils]: 76: Hoare triple {9922#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume true; {9922#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,114 INFO L273 TraceCheckUtils]: 75: Hoare triple {9935#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9922#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,114 INFO L273 TraceCheckUtils]: 74: Hoare triple {9935#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9935#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,115 INFO L273 TraceCheckUtils]: 73: Hoare triple {9935#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9935#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,115 INFO L273 TraceCheckUtils]: 72: Hoare triple {9935#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume true; {9935#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,121 INFO L273 TraceCheckUtils]: 71: Hoare triple {9948#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9935#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,122 INFO L273 TraceCheckUtils]: 70: Hoare triple {9948#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9948#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,122 INFO L273 TraceCheckUtils]: 69: Hoare triple {9948#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9948#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,122 INFO L273 TraceCheckUtils]: 68: Hoare triple {9948#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume true; {9948#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,128 INFO L273 TraceCheckUtils]: 67: Hoare triple {9961#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9948#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,129 INFO L273 TraceCheckUtils]: 66: Hoare triple {9961#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9961#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,129 INFO L273 TraceCheckUtils]: 65: Hoare triple {9961#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9961#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,130 INFO L273 TraceCheckUtils]: 64: Hoare triple {9961#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume true; {9961#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,136 INFO L273 TraceCheckUtils]: 63: Hoare triple {9974#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9961#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,136 INFO L273 TraceCheckUtils]: 62: Hoare triple {9974#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9974#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,136 INFO L273 TraceCheckUtils]: 61: Hoare triple {9974#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9974#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,137 INFO L273 TraceCheckUtils]: 60: Hoare triple {9974#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume true; {9974#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,143 INFO L273 TraceCheckUtils]: 59: Hoare triple {9987#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9974#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,143 INFO L273 TraceCheckUtils]: 58: Hoare triple {9987#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {9987#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,143 INFO L273 TraceCheckUtils]: 57: Hoare triple {9987#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {9987#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,144 INFO L273 TraceCheckUtils]: 56: Hoare triple {9987#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume true; {9987#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,149 INFO L273 TraceCheckUtils]: 55: Hoare triple {10000#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {9987#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,150 INFO L273 TraceCheckUtils]: 54: Hoare triple {10000#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10000#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,150 INFO L273 TraceCheckUtils]: 53: Hoare triple {10000#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10000#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,150 INFO L273 TraceCheckUtils]: 52: Hoare triple {10000#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} assume true; {10000#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,155 INFO L273 TraceCheckUtils]: 51: Hoare triple {10013#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10000#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,155 INFO L273 TraceCheckUtils]: 50: Hoare triple {10013#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10013#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,155 INFO L273 TraceCheckUtils]: 49: Hoare triple {10013#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10013#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,156 INFO L273 TraceCheckUtils]: 48: Hoare triple {10013#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} assume true; {10013#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,160 INFO L273 TraceCheckUtils]: 47: Hoare triple {10026#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10013#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,160 INFO L273 TraceCheckUtils]: 46: Hoare triple {10026#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10026#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,160 INFO L273 TraceCheckUtils]: 45: Hoare triple {10026#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10026#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,161 INFO L273 TraceCheckUtils]: 44: Hoare triple {10026#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} assume true; {10026#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,165 INFO L273 TraceCheckUtils]: 43: Hoare triple {10039#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10026#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,165 INFO L273 TraceCheckUtils]: 42: Hoare triple {10039#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10039#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,166 INFO L273 TraceCheckUtils]: 41: Hoare triple {10039#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10039#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,166 INFO L273 TraceCheckUtils]: 40: Hoare triple {10039#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} assume true; {10039#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,183 INFO L273 TraceCheckUtils]: 39: Hoare triple {10052#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10039#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,198 INFO L273 TraceCheckUtils]: 38: Hoare triple {10052#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10052#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,213 INFO L273 TraceCheckUtils]: 37: Hoare triple {10052#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10052#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,227 INFO L273 TraceCheckUtils]: 36: Hoare triple {10052#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} assume true; {10052#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,236 INFO L273 TraceCheckUtils]: 35: Hoare triple {10065#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10052#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,240 INFO L273 TraceCheckUtils]: 34: Hoare triple {10065#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10065#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,240 INFO L273 TraceCheckUtils]: 33: Hoare triple {10065#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10065#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,241 INFO L273 TraceCheckUtils]: 32: Hoare triple {10065#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} assume true; {10065#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,245 INFO L273 TraceCheckUtils]: 31: Hoare triple {10078#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10065#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,245 INFO L273 TraceCheckUtils]: 30: Hoare triple {10078#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10078#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,263 INFO L273 TraceCheckUtils]: 29: Hoare triple {10078#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10078#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,271 INFO L273 TraceCheckUtils]: 28: Hoare triple {10078#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} assume true; {10078#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {10091#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10078#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,283 INFO L273 TraceCheckUtils]: 26: Hoare triple {10091#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10091#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,288 INFO L273 TraceCheckUtils]: 25: Hoare triple {10091#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10091#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,288 INFO L273 TraceCheckUtils]: 24: Hoare triple {10091#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} assume true; {10091#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,294 INFO L273 TraceCheckUtils]: 23: Hoare triple {10104#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10091#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,294 INFO L273 TraceCheckUtils]: 22: Hoare triple {10104#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10104#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,294 INFO L273 TraceCheckUtils]: 21: Hoare triple {10104#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10104#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,295 INFO L273 TraceCheckUtils]: 20: Hoare triple {10104#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} assume true; {10104#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,298 INFO L273 TraceCheckUtils]: 19: Hoare triple {10117#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10104#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,299 INFO L273 TraceCheckUtils]: 18: Hoare triple {10117#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10117#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,299 INFO L273 TraceCheckUtils]: 17: Hoare triple {10117#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10117#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,299 INFO L273 TraceCheckUtils]: 16: Hoare triple {10117#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} assume true; {10117#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {10130#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10117#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,307 INFO L273 TraceCheckUtils]: 14: Hoare triple {10130#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} assume !~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0; {10130#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,307 INFO L273 TraceCheckUtils]: 13: Hoare triple {10130#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10130#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,307 INFO L273 TraceCheckUtils]: 12: Hoare triple {10130#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} assume true; {10130#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,313 INFO L273 TraceCheckUtils]: 11: Hoare triple {10143#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10130#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,314 INFO L273 TraceCheckUtils]: 10: Hoare triple {10143#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {10143#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,314 INFO L273 TraceCheckUtils]: 9: Hoare triple {10143#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10143#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,314 INFO L273 TraceCheckUtils]: 8: Hoare triple {10143#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} assume true; {10143#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,316 INFO L273 TraceCheckUtils]: 7: Hoare triple {10156#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {10143#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,316 INFO L273 TraceCheckUtils]: 6: Hoare triple {10156#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume true; {10156#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,316 INFO L273 TraceCheckUtils]: 5: Hoare triple {9477#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {10156#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 17:41:30,316 INFO L256 TraceCheckUtils]: 4: Hoare triple {9477#true} call #t~ret15 := main(); {9477#true} is VALID [2018-11-14 17:41:30,317 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {9477#true} {9477#true} #137#return; {9477#true} is VALID [2018-11-14 17:41:30,317 INFO L273 TraceCheckUtils]: 2: Hoare triple {9477#true} assume true; {9477#true} is VALID [2018-11-14 17:41:30,317 INFO L273 TraceCheckUtils]: 1: Hoare triple {9477#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {9477#true} is VALID [2018-11-14 17:41:30,317 INFO L256 TraceCheckUtils]: 0: Hoare triple {9477#true} call ULTIMATE.init(); {9477#true} is VALID [2018-11-14 17:41:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:41:30,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:41:30,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-11-14 17:41:30,337 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 109 [2018-11-14 17:41:30,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:41:30,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-14 17:41:30,754 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:41:30,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-14 17:41:30,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-14 17:41:30,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=1823, Unknown=0, NotChecked=0, Total=2450 [2018-11-14 17:41:30,756 INFO L87 Difference]: Start difference. First operand 330 states and 409 transitions. Second operand 50 states. [2018-11-14 17:41:40,804 WARN L179 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 10 [2018-11-14 17:41:41,373 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 10 [2018-11-14 17:41:41,980 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 10 [2018-11-14 17:41:42,600 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 10 [2018-11-14 17:41:43,245 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 10 [2018-11-14 17:41:43,931 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 10 [2018-11-14 17:41:44,595 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 10 [2018-11-14 17:41:45,243 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2018-11-14 17:41:54,721 WARN L179 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 10 [2018-11-14 17:41:55,819 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 11 [2018-11-14 17:41:56,844 WARN L179 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 11 [2018-11-14 17:41:57,662 WARN L179 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 11 [2018-11-14 17:41:58,532 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 11