java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 15:49:17,021 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 15:49:17,023 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 15:49:17,035 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 15:49:17,036 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 15:49:17,037 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 15:49:17,038 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 15:49:17,041 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 15:49:17,044 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 15:49:17,046 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 15:49:17,047 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 15:49:17,047 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 15:49:17,048 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 15:49:17,049 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 15:49:17,050 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 15:49:17,051 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 15:49:17,052 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 15:49:17,053 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 15:49:17,055 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 15:49:17,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 15:49:17,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 15:49:17,062 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 15:49:17,068 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 15:49:17,068 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 15:49:17,068 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 15:49:17,069 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 15:49:17,071 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 15:49:17,072 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 15:49:17,072 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 15:49:17,077 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 15:49:17,077 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 15:49:17,079 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 15:49:17,080 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 15:49:17,080 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 15:49:17,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 15:49:17,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 15:49:17,084 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 15:49:17,118 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 15:49:17,118 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 15:49:17,119 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 15:49:17,119 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 15:49:17,120 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 15:49:17,120 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 15:49:17,120 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 15:49:17,122 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 15:49:17,122 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 15:49:17,122 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 15:49:17,122 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 15:49:17,122 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 15:49:17,123 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 15:49:17,123 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 15:49:17,123 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 15:49:17,123 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 15:49:17,123 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 15:49:17,125 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 15:49:17,125 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 15:49:17,125 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 15:49:17,125 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 15:49:17,126 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 15:49:17,126 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 15:49:17,126 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 15:49:17,127 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 15:49:17,127 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 15:49:17,127 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 15:49:17,127 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 15:49:17,127 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 15:49:17,128 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 15:49:17,128 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 15:49:17,128 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 15:49:17,202 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 15:49:17,219 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 15:49:17,224 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 15:49:17,225 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 15:49:17,226 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 15:49:17,226 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-call_ground.i [2018-11-14 15:49:17,294 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ec10927d/f80cc3054d3f406ab859ea64040bdd64/FLAG37be48b32 [2018-11-14 15:49:17,789 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 15:49:17,789 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call_ground.i [2018-11-14 15:49:17,795 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ec10927d/f80cc3054d3f406ab859ea64040bdd64/FLAG37be48b32 [2018-11-14 15:49:17,809 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ec10927d/f80cc3054d3f406ab859ea64040bdd64 [2018-11-14 15:49:17,820 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 15:49:17,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 15:49:17,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 15:49:17,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 15:49:17,829 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 15:49:17,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:49:17" (1/1) ... [2018-11-14 15:49:17,834 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56b74e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:17, skipping insertion in model container [2018-11-14 15:49:17,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 03:49:17" (1/1) ... [2018-11-14 15:49:17,846 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 15:49:17,874 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 15:49:18,079 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:49:18,085 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 15:49:18,121 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 15:49:18,146 INFO L195 MainTranslator]: Completed translation [2018-11-14 15:49:18,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18 WrapperNode [2018-11-14 15:49:18,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 15:49:18,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 15:49:18,148 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 15:49:18,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 15:49:18,164 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... [2018-11-14 15:49:18,212 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 15:49:18,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 15:49:18,215 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 15:49:18,215 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 15:49:18,216 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 15:49:18,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 15:49:18,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 15:49:18,352 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 15:49:18,352 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 15:49:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 15:49:18,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 15:49:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 15:49:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 15:49:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-14 15:49:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-14 15:49:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 15:49:18,353 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 15:49:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 15:49:18,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4 [2018-11-14 15:49:19,351 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 15:49:19,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:49:19 BoogieIcfgContainer [2018-11-14 15:49:19,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 15:49:19,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 15:49:19,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 15:49:19,357 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 15:49:19,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 03:49:17" (1/3) ... [2018-11-14 15:49:19,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f86ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:49:19, skipping insertion in model container [2018-11-14 15:49:19,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 03:49:18" (2/3) ... [2018-11-14 15:49:19,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29f86ea1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 03:49:19, skipping insertion in model container [2018-11-14 15:49:19,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 03:49:19" (3/3) ... [2018-11-14 15:49:19,361 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_false-unreach-call_ground.i [2018-11-14 15:49:19,371 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 15:49:19,379 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 15:49:19,397 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 15:49:19,432 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 15:49:19,433 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 15:49:19,433 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 15:49:19,433 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 15:49:19,434 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 15:49:19,434 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 15:49:19,434 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 15:49:19,434 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 15:49:19,434 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 15:49:19,453 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-11-14 15:49:19,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 15:49:19,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:19,462 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:49:19,464 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:19,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:19,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1734015145, now seen corresponding path program 1 times [2018-11-14 15:49:19,476 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:19,477 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:49:19,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:49:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:19,578 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:19,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {52#true} call ULTIMATE.init(); {52#true} is VALID [2018-11-14 15:49:19,802 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 15:49:19,803 INFO L273 TraceCheckUtils]: 2: Hoare triple {52#true} assume true; {52#true} is VALID [2018-11-14 15:49:19,803 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {52#true} {52#true} #137#return; {52#true} is VALID [2018-11-14 15:49:19,803 INFO L256 TraceCheckUtils]: 4: Hoare triple {52#true} call #t~ret15 := main(); {52#true} is VALID [2018-11-14 15:49:19,804 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 15:49:19,805 INFO L273 TraceCheckUtils]: 6: Hoare triple {52#true} assume !true; {53#false} is VALID [2018-11-14 15:49:19,806 INFO L273 TraceCheckUtils]: 7: Hoare triple {53#false} ~x~0 := 0bv32; {53#false} is VALID [2018-11-14 15:49:19,806 INFO L273 TraceCheckUtils]: 8: Hoare triple {53#false} assume true; {53#false} is VALID [2018-11-14 15:49:19,806 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 15:49:19,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {53#false} assume true; {53#false} is VALID [2018-11-14 15:49:19,807 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 15:49:19,807 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 15:49:19,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {53#false} ~cond := #in~cond; {53#false} is VALID [2018-11-14 15:49:19,808 INFO L273 TraceCheckUtils]: 14: Hoare triple {53#false} assume ~cond == 0bv32; {53#false} is VALID [2018-11-14 15:49:19,808 INFO L273 TraceCheckUtils]: 15: Hoare triple {53#false} assume !false; {53#false} is VALID [2018-11-14 15:49:19,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:49:19,812 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:49:19,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:49:19,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 15:49:19,824 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 15:49:19,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:19,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 15:49:19,878 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 15:49:19,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 15:49:19,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 15:49:19,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 15:49:19,891 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-11-14 15:49:20,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:20,193 INFO L93 Difference]: Finished difference Result 92 states and 131 transitions. [2018-11-14 15:49:20,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 15:49:20,193 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2018-11-14 15:49:20,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:49:20,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 131 transitions. [2018-11-14 15:49:20,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 15:49:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 131 transitions. [2018-11-14 15:49:20,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 131 transitions. [2018-11-14 15:49:20,976 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 15:49:20,990 INFO L225 Difference]: With dead ends: 92 [2018-11-14 15:49:20,990 INFO L226 Difference]: Without dead ends: 44 [2018-11-14 15:49:20,994 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 15:49:21,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-14 15:49:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-14 15:49:21,048 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:21,049 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 44 states. [2018-11-14 15:49:21,049 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 15:49:21,050 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 15:49:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:21,057 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-14 15:49:21,057 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-14 15:49:21,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:21,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:21,058 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 44 states. [2018-11-14 15:49:21,059 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 44 states. [2018-11-14 15:49:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:21,064 INFO L93 Difference]: Finished difference Result 44 states and 54 transitions. [2018-11-14 15:49:21,065 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-14 15:49:21,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:21,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:21,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:21,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:21,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-14 15:49:21,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 54 transitions. [2018-11-14 15:49:21,072 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 54 transitions. Word has length 16 [2018-11-14 15:49:21,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:21,073 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 54 transitions. [2018-11-14 15:49:21,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 15:49:21,073 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 54 transitions. [2018-11-14 15:49:21,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-14 15:49:21,075 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:21,075 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 15:49:21,075 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:21,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:21,076 INFO L82 PathProgramCache]: Analyzing trace with hash 1030099958, now seen corresponding path program 1 times [2018-11-14 15:49:21,076 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:21,076 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:49:21,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:49:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:21,142 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:21,221 INFO L256 TraceCheckUtils]: 0: Hoare triple {366#true} call ULTIMATE.init(); {366#true} is VALID [2018-11-14 15:49:21,221 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 15:49:21,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {366#true} assume true; {366#true} is VALID [2018-11-14 15:49:21,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {366#true} {366#true} #137#return; {366#true} is VALID [2018-11-14 15:49:21,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {366#true} call #t~ret15 := main(); {366#true} is VALID [2018-11-14 15:49:21,246 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 15:49:21,254 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 15:49:21,255 INFO L273 TraceCheckUtils]: 7: Hoare triple {386#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {367#false} is VALID [2018-11-14 15:49:21,255 INFO L273 TraceCheckUtils]: 8: Hoare triple {367#false} ~x~0 := 0bv32; {367#false} is VALID [2018-11-14 15:49:21,256 INFO L273 TraceCheckUtils]: 9: Hoare triple {367#false} assume true; {367#false} is VALID [2018-11-14 15:49:21,256 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 15:49:21,256 INFO L273 TraceCheckUtils]: 11: Hoare triple {367#false} assume true; {367#false} is VALID [2018-11-14 15:49:21,256 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 15:49:21,257 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 15:49:21,257 INFO L273 TraceCheckUtils]: 14: Hoare triple {367#false} ~cond := #in~cond; {367#false} is VALID [2018-11-14 15:49:21,257 INFO L273 TraceCheckUtils]: 15: Hoare triple {367#false} assume ~cond == 0bv32; {367#false} is VALID [2018-11-14 15:49:21,258 INFO L273 TraceCheckUtils]: 16: Hoare triple {367#false} assume !false; {367#false} is VALID [2018-11-14 15:49:21,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:49:21,260 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:49:21,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:49:21,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 15:49:21,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 15:49:21,266 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:21,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 15:49:21,339 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 15:49:21,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 15:49:21,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 15:49:21,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 15:49:21,340 INFO L87 Difference]: Start difference. First operand 44 states and 54 transitions. Second operand 3 states. [2018-11-14 15:49:21,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:21,823 INFO L93 Difference]: Finished difference Result 82 states and 102 transitions. [2018-11-14 15:49:21,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 15:49:21,823 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-14 15:49:21,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:49:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-14 15:49:21,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:49:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2018-11-14 15:49:21,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2018-11-14 15:49:22,188 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 15:49:22,193 INFO L225 Difference]: With dead ends: 82 [2018-11-14 15:49:22,193 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 15:49:22,195 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 15:49:22,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 15:49:22,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 46. [2018-11-14 15:49:22,225 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:22,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 46 states. [2018-11-14 15:49:22,225 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 46 states. [2018-11-14 15:49:22,225 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 46 states. [2018-11-14 15:49:22,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:22,232 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-11-14 15:49:22,232 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-14 15:49:22,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:22,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:22,234 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 67 states. [2018-11-14 15:49:22,234 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 67 states. [2018-11-14 15:49:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:22,239 INFO L93 Difference]: Finished difference Result 67 states and 85 transitions. [2018-11-14 15:49:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2018-11-14 15:49:22,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:22,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:22,241 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:22,241 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:22,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-14 15:49:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 56 transitions. [2018-11-14 15:49:22,245 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 56 transitions. Word has length 17 [2018-11-14 15:49:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:22,245 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 56 transitions. [2018-11-14 15:49:22,245 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 15:49:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 56 transitions. [2018-11-14 15:49:22,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 15:49:22,246 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:22,247 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 15:49:22,247 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:22,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:22,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1829402631, now seen corresponding path program 1 times [2018-11-14 15:49:22,248 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:22,248 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:49:22,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:49:22,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:22,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:22,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:22,365 INFO L256 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {723#true} is VALID [2018-11-14 15:49:22,365 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 15:49:22,366 INFO L273 TraceCheckUtils]: 2: Hoare triple {723#true} assume true; {723#true} is VALID [2018-11-14 15:49:22,366 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {723#true} {723#true} #137#return; {723#true} is VALID [2018-11-14 15:49:22,366 INFO L256 TraceCheckUtils]: 4: Hoare triple {723#true} call #t~ret15 := main(); {723#true} is VALID [2018-11-14 15:49:22,366 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; {723#true} is VALID [2018-11-14 15:49:22,367 INFO L273 TraceCheckUtils]: 6: Hoare triple {723#true} assume true; {723#true} is VALID [2018-11-14 15:49:22,367 INFO L273 TraceCheckUtils]: 7: Hoare triple {723#true} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {749#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 15:49:22,368 INFO L273 TraceCheckUtils]: 8: Hoare triple {749#(= main_~s~0 main_~i~0)} assume true; {749#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 15:49:22,368 INFO L273 TraceCheckUtils]: 9: Hoare triple {749#(= main_~s~0 main_~i~0)} assume !~bvslt32(~k~0, 100000bv32); {749#(= main_~s~0 main_~i~0)} is VALID [2018-11-14 15:49:22,369 INFO L273 TraceCheckUtils]: 10: Hoare triple {749#(= 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); {724#false} is VALID [2018-11-14 15:49:22,370 INFO L273 TraceCheckUtils]: 11: Hoare triple {724#false} ~x~0 := 0bv32; {724#false} is VALID [2018-11-14 15:49:22,370 INFO L273 TraceCheckUtils]: 12: Hoare triple {724#false} assume true; {724#false} is VALID [2018-11-14 15:49:22,370 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 15:49:22,371 INFO L273 TraceCheckUtils]: 14: Hoare triple {724#false} assume true; {724#false} is VALID [2018-11-14 15:49:22,371 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 15:49:22,371 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 15:49:22,372 INFO L273 TraceCheckUtils]: 17: Hoare triple {724#false} ~cond := #in~cond; {724#false} is VALID [2018-11-14 15:49:22,372 INFO L273 TraceCheckUtils]: 18: Hoare triple {724#false} assume ~cond == 0bv32; {724#false} is VALID [2018-11-14 15:49:22,372 INFO L273 TraceCheckUtils]: 19: Hoare triple {724#false} assume !false; {724#false} is VALID [2018-11-14 15:49:22,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:49:22,374 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:49:22,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:49:22,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 15:49:22,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 15:49:22,382 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:22,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 15:49:22,510 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 15:49:22,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 15:49:22,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 15:49:22,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 15:49:22,511 INFO L87 Difference]: Start difference. First operand 46 states and 56 transitions. Second operand 3 states. [2018-11-14 15:49:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:22,780 INFO L93 Difference]: Finished difference Result 105 states and 133 transitions. [2018-11-14 15:49:22,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 15:49:22,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-11-14 15:49:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:22,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:49:22,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2018-11-14 15:49:22,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 15:49:22,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2018-11-14 15:49:22,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 131 transitions. [2018-11-14 15:49:23,006 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 15:49:23,009 INFO L225 Difference]: With dead ends: 105 [2018-11-14 15:49:23,009 INFO L226 Difference]: Without dead ends: 67 [2018-11-14 15:49:23,010 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 15:49:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-14 15:49:23,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 51. [2018-11-14 15:49:23,064 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:23,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand 51 states. [2018-11-14 15:49:23,064 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 51 states. [2018-11-14 15:49:23,064 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 51 states. [2018-11-14 15:49:23,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:23,068 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2018-11-14 15:49:23,068 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2018-11-14 15:49:23,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:23,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:23,069 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 67 states. [2018-11-14 15:49:23,070 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 67 states. [2018-11-14 15:49:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:23,074 INFO L93 Difference]: Finished difference Result 67 states and 84 transitions. [2018-11-14 15:49:23,074 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 84 transitions. [2018-11-14 15:49:23,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:23,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:23,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:23,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:23,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-14 15:49:23,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2018-11-14 15:49:23,079 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 20 [2018-11-14 15:49:23,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:23,079 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2018-11-14 15:49:23,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 15:49:23,080 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2018-11-14 15:49:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 15:49:23,081 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:23,081 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 15:49:23,081 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:23,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:23,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1436375621, now seen corresponding path program 1 times [2018-11-14 15:49:23,082 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:23,082 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:49:23,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:49:23,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:23,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:23,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:23,209 INFO L256 TraceCheckUtils]: 0: Hoare triple {1125#true} call ULTIMATE.init(); {1125#true} is VALID [2018-11-14 15:49:23,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {1125#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1125#true} is VALID [2018-11-14 15:49:23,210 INFO L273 TraceCheckUtils]: 2: Hoare triple {1125#true} assume true; {1125#true} is VALID [2018-11-14 15:49:23,211 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1125#true} {1125#true} #137#return; {1125#true} is VALID [2018-11-14 15:49:23,211 INFO L256 TraceCheckUtils]: 4: Hoare triple {1125#true} call #t~ret15 := main(); {1125#true} is VALID [2018-11-14 15:49:23,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {1125#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {1145#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:23,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {1145#(= main_~i~0 (_ bv0 32))} assume true; {1145#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:23,216 INFO L273 TraceCheckUtils]: 7: Hoare triple {1145#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {1152#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:23,217 INFO L273 TraceCheckUtils]: 8: Hoare triple {1152#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1152#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:23,219 INFO L273 TraceCheckUtils]: 9: Hoare triple {1152#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {1126#false} is VALID [2018-11-14 15:49:23,219 INFO L273 TraceCheckUtils]: 10: Hoare triple {1126#false} assume !(~s~0 != ~i~0); {1126#false} is VALID [2018-11-14 15:49:23,220 INFO L273 TraceCheckUtils]: 11: Hoare triple {1126#false} ~x~0 := 0bv32; {1126#false} is VALID [2018-11-14 15:49:23,220 INFO L273 TraceCheckUtils]: 12: Hoare triple {1126#false} assume true; {1126#false} is VALID [2018-11-14 15:49:23,220 INFO L273 TraceCheckUtils]: 13: Hoare triple {1126#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {1126#false} is VALID [2018-11-14 15:49:23,220 INFO L273 TraceCheckUtils]: 14: Hoare triple {1126#false} assume true; {1126#false} is VALID [2018-11-14 15:49:23,221 INFO L273 TraceCheckUtils]: 15: Hoare triple {1126#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); {1126#false} is VALID [2018-11-14 15:49:23,221 INFO L256 TraceCheckUtils]: 16: Hoare triple {1126#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {1126#false} is VALID [2018-11-14 15:49:23,221 INFO L273 TraceCheckUtils]: 17: Hoare triple {1126#false} ~cond := #in~cond; {1126#false} is VALID [2018-11-14 15:49:23,221 INFO L273 TraceCheckUtils]: 18: Hoare triple {1126#false} assume ~cond == 0bv32; {1126#false} is VALID [2018-11-14 15:49:23,222 INFO L273 TraceCheckUtils]: 19: Hoare triple {1126#false} assume !false; {1126#false} is VALID [2018-11-14 15:49:23,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:49:23,223 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:49:23,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:49:23,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 15:49:23,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-14 15:49:23,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:23,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 15:49:23,248 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 15:49:23,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 15:49:23,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 15:49:23,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-14 15:49:23,250 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand 4 states. [2018-11-14 15:49:23,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:23,750 INFO L93 Difference]: Finished difference Result 125 states and 161 transitions. [2018-11-14 15:49:23,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 15:49:23,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-11-14 15:49:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:23,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 15:49:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2018-11-14 15:49:23,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 15:49:23,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 139 transitions. [2018-11-14 15:49:23,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 139 transitions. [2018-11-14 15:49:23,990 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 15:49:23,993 INFO L225 Difference]: With dead ends: 125 [2018-11-14 15:49:23,993 INFO L226 Difference]: Without dead ends: 82 [2018-11-14 15:49:23,994 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 15:49:23,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-14 15:49:24,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 53. [2018-11-14 15:49:24,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:24,032 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand 53 states. [2018-11-14 15:49:24,032 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand 53 states. [2018-11-14 15:49:24,033 INFO L87 Difference]: Start difference. First operand 82 states. Second operand 53 states. [2018-11-14 15:49:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:24,037 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2018-11-14 15:49:24,037 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2018-11-14 15:49:24,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:24,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:24,038 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 82 states. [2018-11-14 15:49:24,038 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 82 states. [2018-11-14 15:49:24,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:24,042 INFO L93 Difference]: Finished difference Result 82 states and 105 transitions. [2018-11-14 15:49:24,043 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 105 transitions. [2018-11-14 15:49:24,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:24,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:24,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:24,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:24,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-11-14 15:49:24,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-11-14 15:49:24,047 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 20 [2018-11-14 15:49:24,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:24,047 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-11-14 15:49:24,047 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 15:49:24,047 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-11-14 15:49:24,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-14 15:49:24,048 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:24,048 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 15:49:24,049 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:24,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:24,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1435057265, now seen corresponding path program 1 times [2018-11-14 15:49:24,050 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:24,050 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:49:24,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 15:49:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:24,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:24,148 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:24,227 INFO L256 TraceCheckUtils]: 0: Hoare triple {1587#true} call ULTIMATE.init(); {1587#true} is VALID [2018-11-14 15:49:24,228 INFO L273 TraceCheckUtils]: 1: Hoare triple {1587#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1587#true} is VALID [2018-11-14 15:49:24,228 INFO L273 TraceCheckUtils]: 2: Hoare triple {1587#true} assume true; {1587#true} is VALID [2018-11-14 15:49:24,228 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1587#true} {1587#true} #137#return; {1587#true} is VALID [2018-11-14 15:49:24,228 INFO L256 TraceCheckUtils]: 4: Hoare triple {1587#true} call #t~ret15 := main(); {1587#true} is VALID [2018-11-14 15:49:24,229 INFO L273 TraceCheckUtils]: 5: Hoare triple {1587#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {1607#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:24,229 INFO L273 TraceCheckUtils]: 6: Hoare triple {1607#(= main_~i~0 (_ bv0 32))} assume true; {1607#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:24,230 INFO L273 TraceCheckUtils]: 7: Hoare triple {1607#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {1614#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:24,231 INFO L273 TraceCheckUtils]: 8: Hoare triple {1614#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {1614#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:24,231 INFO L273 TraceCheckUtils]: 9: Hoare triple {1614#(= (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); {1614#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:24,232 INFO L273 TraceCheckUtils]: 10: Hoare triple {1614#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {1614#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:24,232 INFO L273 TraceCheckUtils]: 11: Hoare triple {1614#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {1627#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:24,233 INFO L273 TraceCheckUtils]: 12: Hoare triple {1627#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {1627#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:24,234 INFO L273 TraceCheckUtils]: 13: Hoare triple {1627#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {1588#false} is VALID [2018-11-14 15:49:24,234 INFO L273 TraceCheckUtils]: 14: Hoare triple {1588#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); {1588#false} is VALID [2018-11-14 15:49:24,234 INFO L273 TraceCheckUtils]: 15: Hoare triple {1588#false} ~x~0 := 0bv32; {1588#false} is VALID [2018-11-14 15:49:24,235 INFO L273 TraceCheckUtils]: 16: Hoare triple {1588#false} assume true; {1588#false} is VALID [2018-11-14 15:49:24,235 INFO L273 TraceCheckUtils]: 17: Hoare triple {1588#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {1588#false} is VALID [2018-11-14 15:49:24,236 INFO L273 TraceCheckUtils]: 18: Hoare triple {1588#false} assume true; {1588#false} is VALID [2018-11-14 15:49:24,236 INFO L273 TraceCheckUtils]: 19: Hoare triple {1588#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); {1588#false} is VALID [2018-11-14 15:49:24,237 INFO L256 TraceCheckUtils]: 20: Hoare triple {1588#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {1588#false} is VALID [2018-11-14 15:49:24,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {1588#false} ~cond := #in~cond; {1588#false} is VALID [2018-11-14 15:49:24,237 INFO L273 TraceCheckUtils]: 22: Hoare triple {1588#false} assume ~cond == 0bv32; {1588#false} is VALID [2018-11-14 15:49:24,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {1588#false} assume !false; {1588#false} is VALID [2018-11-14 15:49:24,239 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:49:24,240 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:49:24,353 INFO L273 TraceCheckUtils]: 23: Hoare triple {1588#false} assume !false; {1588#false} is VALID [2018-11-14 15:49:24,353 INFO L273 TraceCheckUtils]: 22: Hoare triple {1588#false} assume ~cond == 0bv32; {1588#false} is VALID [2018-11-14 15:49:24,354 INFO L273 TraceCheckUtils]: 21: Hoare triple {1588#false} ~cond := #in~cond; {1588#false} is VALID [2018-11-14 15:49:24,354 INFO L256 TraceCheckUtils]: 20: Hoare triple {1588#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {1588#false} is VALID [2018-11-14 15:49:24,354 INFO L273 TraceCheckUtils]: 19: Hoare triple {1588#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); {1588#false} is VALID [2018-11-14 15:49:24,354 INFO L273 TraceCheckUtils]: 18: Hoare triple {1588#false} assume true; {1588#false} is VALID [2018-11-14 15:49:24,355 INFO L273 TraceCheckUtils]: 17: Hoare triple {1588#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {1588#false} is VALID [2018-11-14 15:49:24,355 INFO L273 TraceCheckUtils]: 16: Hoare triple {1588#false} assume true; {1588#false} is VALID [2018-11-14 15:49:24,355 INFO L273 TraceCheckUtils]: 15: Hoare triple {1588#false} ~x~0 := 0bv32; {1588#false} is VALID [2018-11-14 15:49:24,355 INFO L273 TraceCheckUtils]: 14: Hoare triple {1588#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); {1588#false} is VALID [2018-11-14 15:49:24,361 INFO L273 TraceCheckUtils]: 13: Hoare triple {1694#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {1588#false} is VALID [2018-11-14 15:49:24,362 INFO L273 TraceCheckUtils]: 12: Hoare triple {1694#(bvslt main_~k~0 (_ bv100000 32))} assume true; {1694#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:24,364 INFO L273 TraceCheckUtils]: 11: Hoare triple {1701#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {1694#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:24,367 INFO L273 TraceCheckUtils]: 10: Hoare triple {1701#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {1701#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:24,367 INFO L273 TraceCheckUtils]: 9: Hoare triple {1701#(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); {1701#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:24,369 INFO L273 TraceCheckUtils]: 8: Hoare triple {1701#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume true; {1701#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:24,375 INFO L273 TraceCheckUtils]: 7: Hoare triple {1714#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {1701#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:24,376 INFO L273 TraceCheckUtils]: 6: Hoare triple {1714#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume true; {1714#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:24,377 INFO L273 TraceCheckUtils]: 5: Hoare triple {1587#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {1714#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:24,377 INFO L256 TraceCheckUtils]: 4: Hoare triple {1587#true} call #t~ret15 := main(); {1587#true} is VALID [2018-11-14 15:49:24,377 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1587#true} {1587#true} #137#return; {1587#true} is VALID [2018-11-14 15:49:24,377 INFO L273 TraceCheckUtils]: 2: Hoare triple {1587#true} assume true; {1587#true} is VALID [2018-11-14 15:49:24,378 INFO L273 TraceCheckUtils]: 1: Hoare triple {1587#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1587#true} is VALID [2018-11-14 15:49:24,378 INFO L256 TraceCheckUtils]: 0: Hoare triple {1587#true} call ULTIMATE.init(); {1587#true} is VALID [2018-11-14 15:49:24,380 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 15:49:24,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:49:24,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-14 15:49:24,388 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 15:49:24,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:24,389 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-14 15:49:24,442 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 15:49:24,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-14 15:49:24,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-14 15:49:24,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-14 15:49:24,443 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 8 states. [2018-11-14 15:49:25,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:25,579 INFO L93 Difference]: Finished difference Result 191 states and 253 transitions. [2018-11-14 15:49:25,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-14 15:49:25,579 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2018-11-14 15:49:25,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:25,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 15:49:25,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2018-11-14 15:49:25,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-14 15:49:25,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 205 transitions. [2018-11-14 15:49:25,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 205 transitions. [2018-11-14 15:49:25,985 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:25,990 INFO L225 Difference]: With dead ends: 191 [2018-11-14 15:49:25,991 INFO L226 Difference]: Without dead ends: 148 [2018-11-14 15:49:25,992 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2018-11-14 15:49:25,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-11-14 15:49:26,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 113. [2018-11-14 15:49:26,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:26,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand 113 states. [2018-11-14 15:49:26,095 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand 113 states. [2018-11-14 15:49:26,095 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 113 states. [2018-11-14 15:49:26,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:26,103 INFO L93 Difference]: Finished difference Result 148 states and 189 transitions. [2018-11-14 15:49:26,103 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 189 transitions. [2018-11-14 15:49:26,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:26,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:26,105 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand 148 states. [2018-11-14 15:49:26,105 INFO L87 Difference]: Start difference. First operand 113 states. Second operand 148 states. [2018-11-14 15:49:26,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:26,112 INFO L93 Difference]: Finished difference Result 148 states and 189 transitions. [2018-11-14 15:49:26,112 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 189 transitions. [2018-11-14 15:49:26,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:26,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:26,113 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:26,113 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:26,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-11-14 15:49:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 142 transitions. [2018-11-14 15:49:26,118 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 142 transitions. Word has length 24 [2018-11-14 15:49:26,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:26,119 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 142 transitions. [2018-11-14 15:49:26,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-14 15:49:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 142 transitions. [2018-11-14 15:49:26,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-11-14 15:49:26,120 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:26,120 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 15:49:26,121 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:26,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:26,121 INFO L82 PathProgramCache]: Analyzing trace with hash 560327599, now seen corresponding path program 2 times [2018-11-14 15:49:26,122 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:26,122 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:49:26,144 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 15:49:26,176 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 15:49:26,176 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:49:26,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:26,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:26,300 INFO L256 TraceCheckUtils]: 0: Hoare triple {2442#true} call ULTIMATE.init(); {2442#true} is VALID [2018-11-14 15:49:26,300 INFO L273 TraceCheckUtils]: 1: Hoare triple {2442#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2442#true} is VALID [2018-11-14 15:49:26,301 INFO L273 TraceCheckUtils]: 2: Hoare triple {2442#true} assume true; {2442#true} is VALID [2018-11-14 15:49:26,301 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2442#true} {2442#true} #137#return; {2442#true} is VALID [2018-11-14 15:49:26,302 INFO L256 TraceCheckUtils]: 4: Hoare triple {2442#true} call #t~ret15 := main(); {2442#true} is VALID [2018-11-14 15:49:26,303 INFO L273 TraceCheckUtils]: 5: Hoare triple {2442#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,303 INFO L273 TraceCheckUtils]: 6: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} assume true; {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,306 INFO L273 TraceCheckUtils]: 7: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,308 INFO L273 TraceCheckUtils]: 8: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} assume true; {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,308 INFO L273 TraceCheckUtils]: 9: Hoare triple {2462#(= 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); {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,309 INFO L273 TraceCheckUtils]: 10: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,309 INFO L273 TraceCheckUtils]: 11: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,310 INFO L273 TraceCheckUtils]: 12: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} assume true; {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,310 INFO L273 TraceCheckUtils]: 13: Hoare triple {2462#(= 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); {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,310 INFO L273 TraceCheckUtils]: 14: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,311 INFO L273 TraceCheckUtils]: 15: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,311 INFO L273 TraceCheckUtils]: 16: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} assume true; {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,312 INFO L273 TraceCheckUtils]: 17: Hoare triple {2462#(= 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); {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,312 INFO L273 TraceCheckUtils]: 18: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,313 INFO L273 TraceCheckUtils]: 19: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,314 INFO L273 TraceCheckUtils]: 20: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} assume true; {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,314 INFO L273 TraceCheckUtils]: 21: Hoare triple {2462#(= 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); {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,315 INFO L273 TraceCheckUtils]: 22: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,316 INFO L273 TraceCheckUtils]: 23: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,316 INFO L273 TraceCheckUtils]: 24: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} assume true; {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,317 INFO L273 TraceCheckUtils]: 25: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,318 INFO L273 TraceCheckUtils]: 26: Hoare triple {2462#(= 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); {2462#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:26,319 INFO L273 TraceCheckUtils]: 27: Hoare triple {2462#(= main_~i~0 (_ bv0 32))} ~x~0 := 0bv32; {2529#(and (= main_~x~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:26,319 INFO L273 TraceCheckUtils]: 28: Hoare triple {2529#(and (= main_~x~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {2529#(and (= main_~x~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:26,320 INFO L273 TraceCheckUtils]: 29: Hoare triple {2529#(and (= main_~x~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {2443#false} is VALID [2018-11-14 15:49:26,321 INFO L273 TraceCheckUtils]: 30: Hoare triple {2443#false} assume true; {2443#false} is VALID [2018-11-14 15:49:26,321 INFO L273 TraceCheckUtils]: 31: Hoare triple {2443#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); {2443#false} is VALID [2018-11-14 15:49:26,321 INFO L256 TraceCheckUtils]: 32: Hoare triple {2443#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {2443#false} is VALID [2018-11-14 15:49:26,322 INFO L273 TraceCheckUtils]: 33: Hoare triple {2443#false} ~cond := #in~cond; {2443#false} is VALID [2018-11-14 15:49:26,322 INFO L273 TraceCheckUtils]: 34: Hoare triple {2443#false} assume ~cond == 0bv32; {2443#false} is VALID [2018-11-14 15:49:26,322 INFO L273 TraceCheckUtils]: 35: Hoare triple {2443#false} assume !false; {2443#false} is VALID [2018-11-14 15:49:26,325 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 15:49:26,326 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:49:26,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:49:26,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-14 15:49:26,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 15:49:26,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:26,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-14 15:49:26,397 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 15:49:26,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-14 15:49:26,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-14 15:49:26,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-14 15:49:26,398 INFO L87 Difference]: Start difference. First operand 113 states and 142 transitions. Second operand 4 states. [2018-11-14 15:49:26,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:26,850 INFO L93 Difference]: Finished difference Result 181 states and 229 transitions. [2018-11-14 15:49:26,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-14 15:49:26,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-11-14 15:49:26,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:26,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 15:49:26,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2018-11-14 15:49:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-14 15:49:26,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2018-11-14 15:49:26,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 132 transitions. [2018-11-14 15:49:27,106 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:27,109 INFO L225 Difference]: With dead ends: 181 [2018-11-14 15:49:27,109 INFO L226 Difference]: Without dead ends: 112 [2018-11-14 15:49:27,110 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 15:49:27,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-11-14 15:49:27,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2018-11-14 15:49:27,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:27,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 112 states. Second operand 109 states. [2018-11-14 15:49:27,213 INFO L74 IsIncluded]: Start isIncluded. First operand 112 states. Second operand 109 states. [2018-11-14 15:49:27,213 INFO L87 Difference]: Start difference. First operand 112 states. Second operand 109 states. [2018-11-14 15:49:27,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:27,218 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2018-11-14 15:49:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2018-11-14 15:49:27,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:27,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:27,218 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand 112 states. [2018-11-14 15:49:27,218 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 112 states. [2018-11-14 15:49:27,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:27,222 INFO L93 Difference]: Finished difference Result 112 states and 139 transitions. [2018-11-14 15:49:27,222 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 139 transitions. [2018-11-14 15:49:27,223 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:27,223 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:27,223 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:27,223 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:27,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-14 15:49:27,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 135 transitions. [2018-11-14 15:49:27,227 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 135 transitions. Word has length 36 [2018-11-14 15:49:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:27,228 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 135 transitions. [2018-11-14 15:49:27,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-14 15:49:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 135 transitions. [2018-11-14 15:49:27,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-14 15:49:27,229 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:27,229 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 15:49:27,229 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:27,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:27,230 INFO L82 PathProgramCache]: Analyzing trace with hash -688591287, now seen corresponding path program 1 times [2018-11-14 15:49:27,230 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:27,230 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:49:27,255 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 15:49:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:27,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:27,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:27,497 INFO L256 TraceCheckUtils]: 0: Hoare triple {3157#true} call ULTIMATE.init(); {3157#true} is VALID [2018-11-14 15:49:27,497 INFO L273 TraceCheckUtils]: 1: Hoare triple {3157#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3157#true} is VALID [2018-11-14 15:49:27,497 INFO L273 TraceCheckUtils]: 2: Hoare triple {3157#true} assume true; {3157#true} is VALID [2018-11-14 15:49:27,498 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3157#true} {3157#true} #137#return; {3157#true} is VALID [2018-11-14 15:49:27,498 INFO L256 TraceCheckUtils]: 4: Hoare triple {3157#true} call #t~ret15 := main(); {3157#true} is VALID [2018-11-14 15:49:27,518 INFO L273 TraceCheckUtils]: 5: Hoare triple {3157#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {3177#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:27,533 INFO L273 TraceCheckUtils]: 6: Hoare triple {3177#(= main_~i~0 (_ bv0 32))} assume true; {3177#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:27,538 INFO L273 TraceCheckUtils]: 7: Hoare triple {3177#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {3184#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,541 INFO L273 TraceCheckUtils]: 8: Hoare triple {3184#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {3184#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,541 INFO L273 TraceCheckUtils]: 9: Hoare triple {3184#(= (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); {3184#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,541 INFO L273 TraceCheckUtils]: 10: Hoare triple {3184#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3184#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,542 INFO L273 TraceCheckUtils]: 11: Hoare triple {3184#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3197#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,542 INFO L273 TraceCheckUtils]: 12: Hoare triple {3197#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume true; {3197#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,543 INFO L273 TraceCheckUtils]: 13: Hoare triple {3197#(= (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); {3197#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,543 INFO L273 TraceCheckUtils]: 14: Hoare triple {3197#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3197#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,544 INFO L273 TraceCheckUtils]: 15: Hoare triple {3197#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3210#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,544 INFO L273 TraceCheckUtils]: 16: Hoare triple {3210#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {3210#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,544 INFO L273 TraceCheckUtils]: 17: Hoare triple {3210#(= (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); {3210#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,545 INFO L273 TraceCheckUtils]: 18: Hoare triple {3210#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3210#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,545 INFO L273 TraceCheckUtils]: 19: Hoare triple {3210#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3223#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,546 INFO L273 TraceCheckUtils]: 20: Hoare triple {3223#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {3223#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,546 INFO L273 TraceCheckUtils]: 21: Hoare triple {3223#(= (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); {3223#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,547 INFO L273 TraceCheckUtils]: 22: Hoare triple {3223#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3223#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,548 INFO L273 TraceCheckUtils]: 23: Hoare triple {3223#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3236#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,549 INFO L273 TraceCheckUtils]: 24: Hoare triple {3236#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {3236#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:27,549 INFO L273 TraceCheckUtils]: 25: Hoare triple {3236#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {3158#false} is VALID [2018-11-14 15:49:27,550 INFO L273 TraceCheckUtils]: 26: Hoare triple {3158#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); {3158#false} is VALID [2018-11-14 15:49:27,550 INFO L273 TraceCheckUtils]: 27: Hoare triple {3158#false} ~x~0 := 0bv32; {3158#false} is VALID [2018-11-14 15:49:27,550 INFO L273 TraceCheckUtils]: 28: Hoare triple {3158#false} assume true; {3158#false} is VALID [2018-11-14 15:49:27,550 INFO L273 TraceCheckUtils]: 29: Hoare triple {3158#false} assume !~bvslt32(~x~0, ~i~0); {3158#false} is VALID [2018-11-14 15:49:27,551 INFO L273 TraceCheckUtils]: 30: Hoare triple {3158#false} ~x~0 := 0bv32; {3158#false} is VALID [2018-11-14 15:49:27,551 INFO L273 TraceCheckUtils]: 31: Hoare triple {3158#false} assume true; {3158#false} is VALID [2018-11-14 15:49:27,551 INFO L273 TraceCheckUtils]: 32: Hoare triple {3158#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); {3158#false} is VALID [2018-11-14 15:49:27,552 INFO L256 TraceCheckUtils]: 33: Hoare triple {3158#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {3158#false} is VALID [2018-11-14 15:49:27,552 INFO L273 TraceCheckUtils]: 34: Hoare triple {3158#false} ~cond := #in~cond; {3158#false} is VALID [2018-11-14 15:49:27,552 INFO L273 TraceCheckUtils]: 35: Hoare triple {3158#false} assume ~cond == 0bv32; {3158#false} is VALID [2018-11-14 15:49:27,552 INFO L273 TraceCheckUtils]: 36: Hoare triple {3158#false} assume !false; {3158#false} is VALID [2018-11-14 15:49:27,554 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 15:49:27,554 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:49:27,898 INFO L273 TraceCheckUtils]: 36: Hoare triple {3158#false} assume !false; {3158#false} is VALID [2018-11-14 15:49:27,898 INFO L273 TraceCheckUtils]: 35: Hoare triple {3158#false} assume ~cond == 0bv32; {3158#false} is VALID [2018-11-14 15:49:27,899 INFO L273 TraceCheckUtils]: 34: Hoare triple {3158#false} ~cond := #in~cond; {3158#false} is VALID [2018-11-14 15:49:27,899 INFO L256 TraceCheckUtils]: 33: Hoare triple {3158#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {3158#false} is VALID [2018-11-14 15:49:27,899 INFO L273 TraceCheckUtils]: 32: Hoare triple {3158#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); {3158#false} is VALID [2018-11-14 15:49:27,899 INFO L273 TraceCheckUtils]: 31: Hoare triple {3158#false} assume true; {3158#false} is VALID [2018-11-14 15:49:27,900 INFO L273 TraceCheckUtils]: 30: Hoare triple {3158#false} ~x~0 := 0bv32; {3158#false} is VALID [2018-11-14 15:49:27,900 INFO L273 TraceCheckUtils]: 29: Hoare triple {3158#false} assume !~bvslt32(~x~0, ~i~0); {3158#false} is VALID [2018-11-14 15:49:27,900 INFO L273 TraceCheckUtils]: 28: Hoare triple {3158#false} assume true; {3158#false} is VALID [2018-11-14 15:49:27,901 INFO L273 TraceCheckUtils]: 27: Hoare triple {3158#false} ~x~0 := 0bv32; {3158#false} is VALID [2018-11-14 15:49:27,901 INFO L273 TraceCheckUtils]: 26: Hoare triple {3158#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); {3158#false} is VALID [2018-11-14 15:49:27,909 INFO L273 TraceCheckUtils]: 25: Hoare triple {3309#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {3158#false} is VALID [2018-11-14 15:49:27,910 INFO L273 TraceCheckUtils]: 24: Hoare triple {3309#(bvslt main_~k~0 (_ bv100000 32))} assume true; {3309#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:27,911 INFO L273 TraceCheckUtils]: 23: Hoare triple {3316#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3309#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:27,912 INFO L273 TraceCheckUtils]: 22: Hoare triple {3316#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3316#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,912 INFO L273 TraceCheckUtils]: 21: Hoare triple {3316#(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); {3316#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,912 INFO L273 TraceCheckUtils]: 20: Hoare triple {3316#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume true; {3316#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,917 INFO L273 TraceCheckUtils]: 19: Hoare triple {3329#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3316#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,918 INFO L273 TraceCheckUtils]: 18: Hoare triple {3329#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3329#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,919 INFO L273 TraceCheckUtils]: 17: Hoare triple {3329#(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); {3329#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,919 INFO L273 TraceCheckUtils]: 16: Hoare triple {3329#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume true; {3329#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,926 INFO L273 TraceCheckUtils]: 15: Hoare triple {3342#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3329#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,926 INFO L273 TraceCheckUtils]: 14: Hoare triple {3342#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3342#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,926 INFO L273 TraceCheckUtils]: 13: Hoare triple {3342#(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); {3342#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {3342#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume true; {3342#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,933 INFO L273 TraceCheckUtils]: 11: Hoare triple {3355#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3342#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,934 INFO L273 TraceCheckUtils]: 10: Hoare triple {3355#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {3355#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,935 INFO L273 TraceCheckUtils]: 9: Hoare triple {3355#(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); {3355#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {3355#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume true; {3355#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,939 INFO L273 TraceCheckUtils]: 7: Hoare triple {3368#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {3355#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,940 INFO L273 TraceCheckUtils]: 6: Hoare triple {3368#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume true; {3368#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,941 INFO L273 TraceCheckUtils]: 5: Hoare triple {3157#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {3368#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:27,941 INFO L256 TraceCheckUtils]: 4: Hoare triple {3157#true} call #t~ret15 := main(); {3157#true} is VALID [2018-11-14 15:49:27,941 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3157#true} {3157#true} #137#return; {3157#true} is VALID [2018-11-14 15:49:27,941 INFO L273 TraceCheckUtils]: 2: Hoare triple {3157#true} assume true; {3157#true} is VALID [2018-11-14 15:49:27,941 INFO L273 TraceCheckUtils]: 1: Hoare triple {3157#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3157#true} is VALID [2018-11-14 15:49:27,942 INFO L256 TraceCheckUtils]: 0: Hoare triple {3157#true} call ULTIMATE.init(); {3157#true} is VALID [2018-11-14 15:49:27,943 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 15:49:27,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:49:27,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-14 15:49:27,951 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-14 15:49:27,951 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:27,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-14 15:49:28,100 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 15:49:28,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-14 15:49:28,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-14 15:49:28,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-14 15:49:28,102 INFO L87 Difference]: Start difference. First operand 109 states and 135 transitions. Second operand 14 states. [2018-11-14 15:49:31,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:31,097 INFO L93 Difference]: Finished difference Result 284 states and 375 transitions. [2018-11-14 15:49:31,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-14 15:49:31,097 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 37 [2018-11-14 15:49:31,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 15:49:31,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 245 transitions. [2018-11-14 15:49:31,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 15:49:31,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 245 transitions. [2018-11-14 15:49:31,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 245 transitions. [2018-11-14 15:49:31,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:31,677 INFO L225 Difference]: With dead ends: 284 [2018-11-14 15:49:31,677 INFO L226 Difference]: Without dead ends: 216 [2018-11-14 15:49:31,678 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2018-11-14 15:49:31,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-11-14 15:49:32,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 181. [2018-11-14 15:49:32,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:32,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand 181 states. [2018-11-14 15:49:32,509 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 181 states. [2018-11-14 15:49:32,509 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 181 states. [2018-11-14 15:49:32,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:32,518 INFO L93 Difference]: Finished difference Result 216 states and 272 transitions. [2018-11-14 15:49:32,518 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 272 transitions. [2018-11-14 15:49:32,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:32,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:32,519 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand 216 states. [2018-11-14 15:49:32,519 INFO L87 Difference]: Start difference. First operand 181 states. Second operand 216 states. [2018-11-14 15:49:32,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:32,527 INFO L93 Difference]: Finished difference Result 216 states and 272 transitions. [2018-11-14 15:49:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 272 transitions. [2018-11-14 15:49:32,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:32,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:32,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:32,529 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:32,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-11-14 15:49:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 225 transitions. [2018-11-14 15:49:32,535 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 225 transitions. Word has length 37 [2018-11-14 15:49:32,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:32,535 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 225 transitions. [2018-11-14 15:49:32,535 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-14 15:49:32,535 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 225 transitions. [2018-11-14 15:49:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-14 15:49:32,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:32,537 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 15:49:32,537 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:32,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:32,537 INFO L82 PathProgramCache]: Analyzing trace with hash -2026125747, now seen corresponding path program 2 times [2018-11-14 15:49:32,538 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:32,538 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:49:32,555 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 15:49:32,601 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-14 15:49:32,601 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:49:32,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:32,625 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:32,921 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 31 [2018-11-14 15:49:33,061 INFO L303 Elim1Store]: Index analysis took 113 ms [2018-11-14 15:49:33,111 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 47 [2018-11-14 15:49:33,239 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 26 [2018-11-14 15:49:33,304 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 15:49:33,423 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 38 [2018-11-14 15:49:33,435 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-14 15:49:33,450 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 15:49:33,451 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 15:49:33,456 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 15:49:33,457 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:45, output treesize:7 [2018-11-14 15:49:33,541 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 15 treesize of output 11 [2018-11-14 15:49:33,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 15:49:33,553 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 15:49:33,555 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 15:49:33,556 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 15:49:33,557 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2018-11-14 15:49:33,562 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 15:49:33,776 INFO L256 TraceCheckUtils]: 0: Hoare triple {4453#true} call ULTIMATE.init(); {4453#true} is VALID [2018-11-14 15:49:33,776 INFO L273 TraceCheckUtils]: 1: Hoare triple {4453#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4453#true} is VALID [2018-11-14 15:49:33,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {4453#true} assume true; {4453#true} is VALID [2018-11-14 15:49:33,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4453#true} {4453#true} #137#return; {4453#true} is VALID [2018-11-14 15:49:33,777 INFO L256 TraceCheckUtils]: 4: Hoare triple {4453#true} call #t~ret15 := main(); {4453#true} is VALID [2018-11-14 15:49:33,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {4453#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {4473#(and (= |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); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,780 INFO L273 TraceCheckUtils]: 11: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,781 INFO L273 TraceCheckUtils]: 12: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,781 INFO L273 TraceCheckUtils]: 13: Hoare triple {4473#(and (= |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); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,782 INFO L273 TraceCheckUtils]: 14: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,783 INFO L273 TraceCheckUtils]: 15: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,784 INFO L273 TraceCheckUtils]: 16: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,785 INFO L273 TraceCheckUtils]: 17: Hoare triple {4473#(and (= |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); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,787 INFO L273 TraceCheckUtils]: 19: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,788 INFO L273 TraceCheckUtils]: 21: Hoare triple {4473#(and (= |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); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,792 INFO L273 TraceCheckUtils]: 22: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,799 INFO L273 TraceCheckUtils]: 24: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,801 INFO L273 TraceCheckUtils]: 25: Hoare triple {4473#(and (= |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); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,801 INFO L273 TraceCheckUtils]: 26: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,802 INFO L273 TraceCheckUtils]: 27: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,802 INFO L273 TraceCheckUtils]: 28: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,803 INFO L273 TraceCheckUtils]: 29: Hoare triple {4473#(and (= |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); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,803 INFO L273 TraceCheckUtils]: 30: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,821 INFO L273 TraceCheckUtils]: 31: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,830 INFO L273 TraceCheckUtils]: 32: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,831 INFO L273 TraceCheckUtils]: 33: Hoare triple {4473#(and (= |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); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,831 INFO L273 TraceCheckUtils]: 34: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,832 INFO L273 TraceCheckUtils]: 35: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,832 INFO L273 TraceCheckUtils]: 36: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,833 INFO L273 TraceCheckUtils]: 37: Hoare triple {4473#(and (= |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); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,833 INFO L273 TraceCheckUtils]: 38: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,834 INFO L273 TraceCheckUtils]: 39: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,835 INFO L273 TraceCheckUtils]: 40: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,836 INFO L273 TraceCheckUtils]: 41: Hoare triple {4473#(and (= |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); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,836 INFO L273 TraceCheckUtils]: 42: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,837 INFO L273 TraceCheckUtils]: 43: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,838 INFO L273 TraceCheckUtils]: 44: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,850 INFO L273 TraceCheckUtils]: 45: Hoare triple {4473#(and (= |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); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,851 INFO L273 TraceCheckUtils]: 46: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,852 INFO L273 TraceCheckUtils]: 47: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,859 INFO L273 TraceCheckUtils]: 48: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,859 INFO L273 TraceCheckUtils]: 49: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~k~0, 100000bv32); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,860 INFO L273 TraceCheckUtils]: 50: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= 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); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,860 INFO L273 TraceCheckUtils]: 51: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~x~0 := 0bv32; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,861 INFO L273 TraceCheckUtils]: 52: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,861 INFO L273 TraceCheckUtils]: 53: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !~bvslt32(~x~0, ~i~0); {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,862 INFO L273 TraceCheckUtils]: 54: Hoare triple {4473#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} ~x~0 := 0bv32; {4621#(and (= main_~x~0 (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,862 INFO L273 TraceCheckUtils]: 55: Hoare triple {4621#(and (= main_~x~0 (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume true; {4621#(and (= main_~x~0 (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-14 15:49:33,863 INFO L273 TraceCheckUtils]: 56: Hoare triple {4621#(and (= main_~x~0 (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} 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); {4628#(= |main_#t~mem10| |main_#t~mem9|)} is VALID [2018-11-14 15:49:33,863 INFO L256 TraceCheckUtils]: 57: Hoare triple {4628#(= |main_#t~mem10| |main_#t~mem9|)} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {4632#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:33,864 INFO L273 TraceCheckUtils]: 58: Hoare triple {4632#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {4636#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:33,865 INFO L273 TraceCheckUtils]: 59: Hoare triple {4636#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {4454#false} is VALID [2018-11-14 15:49:33,865 INFO L273 TraceCheckUtils]: 60: Hoare triple {4454#false} assume !false; {4454#false} is VALID [2018-11-14 15:49:33,871 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-14 15:49:33,871 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 15:49:33,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 15:49:33,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-14 15:49:33,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-11-14 15:49:33,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:33,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-14 15:49:33,926 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 15:49:33,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-14 15:49:33,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-14 15:49:33,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-14 15:49:33,927 INFO L87 Difference]: Start difference. First operand 181 states and 225 transitions. Second operand 7 states. [2018-11-14 15:49:34,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:34,680 INFO L93 Difference]: Finished difference Result 190 states and 234 transitions. [2018-11-14 15:49:34,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 15:49:34,680 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-11-14 15:49:34,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:34,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 15:49:34,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2018-11-14 15:49:34,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-14 15:49:34,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2018-11-14 15:49:34,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2018-11-14 15:49:34,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:34,847 INFO L225 Difference]: With dead ends: 190 [2018-11-14 15:49:34,848 INFO L226 Difference]: Without dead ends: 188 [2018-11-14 15:49:34,848 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-14 15:49:34,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-11-14 15:49:35,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-11-14 15:49:35,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:35,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand 186 states. [2018-11-14 15:49:35,229 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand 186 states. [2018-11-14 15:49:35,229 INFO L87 Difference]: Start difference. First operand 188 states. Second operand 186 states. [2018-11-14 15:49:35,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:35,237 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2018-11-14 15:49:35,237 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 232 transitions. [2018-11-14 15:49:35,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:35,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:35,238 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand 188 states. [2018-11-14 15:49:35,238 INFO L87 Difference]: Start difference. First operand 186 states. Second operand 188 states. [2018-11-14 15:49:35,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:35,246 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2018-11-14 15:49:35,246 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 232 transitions. [2018-11-14 15:49:35,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:35,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:35,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:35,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:35,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-11-14 15:49:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 230 transitions. [2018-11-14 15:49:35,255 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 230 transitions. Word has length 61 [2018-11-14 15:49:35,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:35,255 INFO L480 AbstractCegarLoop]: Abstraction has 186 states and 230 transitions. [2018-11-14 15:49:35,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-14 15:49:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 230 transitions. [2018-11-14 15:49:35,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-11-14 15:49:35,257 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:35,257 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:49:35,257 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:35,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:35,257 INFO L82 PathProgramCache]: Analyzing trace with hash -139059430, now seen corresponding path program 1 times [2018-11-14 15:49:35,258 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:35,258 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:49:35,283 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-14 15:49:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:35,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:35,488 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:36,163 INFO L256 TraceCheckUtils]: 0: Hoare triple {5506#true} call ULTIMATE.init(); {5506#true} is VALID [2018-11-14 15:49:36,164 INFO L273 TraceCheckUtils]: 1: Hoare triple {5506#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5506#true} is VALID [2018-11-14 15:49:36,164 INFO L273 TraceCheckUtils]: 2: Hoare triple {5506#true} assume true; {5506#true} is VALID [2018-11-14 15:49:36,164 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5506#true} {5506#true} #137#return; {5506#true} is VALID [2018-11-14 15:49:36,164 INFO L256 TraceCheckUtils]: 4: Hoare triple {5506#true} call #t~ret15 := main(); {5506#true} is VALID [2018-11-14 15:49:36,165 INFO L273 TraceCheckUtils]: 5: Hoare triple {5506#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {5526#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:36,165 INFO L273 TraceCheckUtils]: 6: Hoare triple {5526#(= main_~i~0 (_ bv0 32))} assume true; {5526#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:36,167 INFO L273 TraceCheckUtils]: 7: Hoare triple {5526#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {5533#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,167 INFO L273 TraceCheckUtils]: 8: Hoare triple {5533#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {5533#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,168 INFO L273 TraceCheckUtils]: 9: Hoare triple {5533#(= (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); {5533#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,168 INFO L273 TraceCheckUtils]: 10: Hoare triple {5533#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5533#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,169 INFO L273 TraceCheckUtils]: 11: Hoare triple {5533#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5546#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 15:49:36,170 INFO L273 TraceCheckUtils]: 12: Hoare triple {5546#(= (_ bv2 32) main_~k~0)} assume true; {5546#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 15:49:36,170 INFO L273 TraceCheckUtils]: 13: Hoare triple {5546#(= (_ 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); {5546#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 15:49:36,171 INFO L273 TraceCheckUtils]: 14: Hoare triple {5546#(= (_ bv2 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5546#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 15:49:36,172 INFO L273 TraceCheckUtils]: 15: Hoare triple {5546#(= (_ bv2 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {5559#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,173 INFO L273 TraceCheckUtils]: 16: Hoare triple {5559#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {5559#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,175 INFO L273 TraceCheckUtils]: 17: Hoare triple {5559#(= (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); {5559#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,175 INFO L273 TraceCheckUtils]: 18: Hoare triple {5559#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5559#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,176 INFO L273 TraceCheckUtils]: 19: Hoare triple {5559#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5572#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,177 INFO L273 TraceCheckUtils]: 20: Hoare triple {5572#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {5572#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,177 INFO L273 TraceCheckUtils]: 21: Hoare triple {5572#(= (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); {5572#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,177 INFO L273 TraceCheckUtils]: 22: Hoare triple {5572#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5572#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,186 INFO L273 TraceCheckUtils]: 23: Hoare triple {5572#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5585#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,186 INFO L273 TraceCheckUtils]: 24: Hoare triple {5585#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {5585#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,187 INFO L273 TraceCheckUtils]: 25: Hoare triple {5585#(= (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); {5585#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,187 INFO L273 TraceCheckUtils]: 26: Hoare triple {5585#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5585#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,188 INFO L273 TraceCheckUtils]: 27: Hoare triple {5585#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5598#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 15:49:36,188 INFO L273 TraceCheckUtils]: 28: Hoare triple {5598#(= (_ bv6 32) main_~k~0)} assume true; {5598#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 15:49:36,188 INFO L273 TraceCheckUtils]: 29: Hoare triple {5598#(= (_ 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); {5598#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 15:49:36,189 INFO L273 TraceCheckUtils]: 30: Hoare triple {5598#(= (_ bv6 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5598#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 15:49:36,189 INFO L273 TraceCheckUtils]: 31: Hoare triple {5598#(= (_ bv6 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {5611#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,190 INFO L273 TraceCheckUtils]: 32: Hoare triple {5611#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {5611#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,190 INFO L273 TraceCheckUtils]: 33: Hoare triple {5611#(= (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); {5611#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,191 INFO L273 TraceCheckUtils]: 34: Hoare triple {5611#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5611#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,191 INFO L273 TraceCheckUtils]: 35: Hoare triple {5611#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5624#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,192 INFO L273 TraceCheckUtils]: 36: Hoare triple {5624#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {5624#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,192 INFO L273 TraceCheckUtils]: 37: Hoare triple {5624#(= (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); {5624#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,194 INFO L273 TraceCheckUtils]: 38: Hoare triple {5624#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5624#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,195 INFO L273 TraceCheckUtils]: 39: Hoare triple {5624#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5637#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 15:49:36,195 INFO L273 TraceCheckUtils]: 40: Hoare triple {5637#(= (_ bv9 32) main_~k~0)} assume true; {5637#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 15:49:36,196 INFO L273 TraceCheckUtils]: 41: Hoare triple {5637#(= (_ 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); {5637#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 15:49:36,196 INFO L273 TraceCheckUtils]: 42: Hoare triple {5637#(= (_ bv9 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5637#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 15:49:36,197 INFO L273 TraceCheckUtils]: 43: Hoare triple {5637#(= (_ bv9 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {5650#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,197 INFO L273 TraceCheckUtils]: 44: Hoare triple {5650#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {5650#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,197 INFO L273 TraceCheckUtils]: 45: Hoare triple {5650#(= (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); {5650#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,198 INFO L273 TraceCheckUtils]: 46: Hoare triple {5650#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5650#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:36,198 INFO L273 TraceCheckUtils]: 47: Hoare triple {5650#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5663#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 15:49:36,199 INFO L273 TraceCheckUtils]: 48: Hoare triple {5663#(= (_ bv11 32) main_~k~0)} assume true; {5663#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 15:49:36,200 INFO L273 TraceCheckUtils]: 49: Hoare triple {5663#(= (_ bv11 32) main_~k~0)} assume !~bvslt32(~k~0, 100000bv32); {5507#false} is VALID [2018-11-14 15:49:36,200 INFO L273 TraceCheckUtils]: 50: Hoare triple {5507#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); {5507#false} is VALID [2018-11-14 15:49:36,200 INFO L273 TraceCheckUtils]: 51: Hoare triple {5507#false} ~x~0 := 0bv32; {5507#false} is VALID [2018-11-14 15:49:36,200 INFO L273 TraceCheckUtils]: 52: Hoare triple {5507#false} assume true; {5507#false} is VALID [2018-11-14 15:49:36,200 INFO L273 TraceCheckUtils]: 53: Hoare triple {5507#false} assume !~bvslt32(~x~0, ~i~0); {5507#false} is VALID [2018-11-14 15:49:36,201 INFO L273 TraceCheckUtils]: 54: Hoare triple {5507#false} ~x~0 := 0bv32; {5507#false} is VALID [2018-11-14 15:49:36,201 INFO L273 TraceCheckUtils]: 55: Hoare triple {5507#false} assume true; {5507#false} is VALID [2018-11-14 15:49:36,201 INFO L273 TraceCheckUtils]: 56: Hoare triple {5507#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); {5507#false} is VALID [2018-11-14 15:49:36,201 INFO L256 TraceCheckUtils]: 57: Hoare triple {5507#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {5507#false} is VALID [2018-11-14 15:49:36,202 INFO L273 TraceCheckUtils]: 58: Hoare triple {5507#false} ~cond := #in~cond; {5507#false} is VALID [2018-11-14 15:49:36,202 INFO L273 TraceCheckUtils]: 59: Hoare triple {5507#false} assume !(~cond == 0bv32); {5507#false} is VALID [2018-11-14 15:49:36,202 INFO L273 TraceCheckUtils]: 60: Hoare triple {5507#false} assume true; {5507#false} is VALID [2018-11-14 15:49:36,202 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {5507#false} {5507#false} #143#return; {5507#false} is VALID [2018-11-14 15:49:36,203 INFO L273 TraceCheckUtils]: 62: Hoare triple {5507#false} havoc #t~mem9;havoc #t~mem10; {5507#false} is VALID [2018-11-14 15:49:36,203 INFO L273 TraceCheckUtils]: 63: Hoare triple {5507#false} #t~post8 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {5507#false} is VALID [2018-11-14 15:49:36,203 INFO L273 TraceCheckUtils]: 64: Hoare triple {5507#false} assume true; {5507#false} is VALID [2018-11-14 15:49:36,203 INFO L273 TraceCheckUtils]: 65: Hoare triple {5507#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); {5507#false} is VALID [2018-11-14 15:49:36,204 INFO L256 TraceCheckUtils]: 66: Hoare triple {5507#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {5507#false} is VALID [2018-11-14 15:49:36,204 INFO L273 TraceCheckUtils]: 67: Hoare triple {5507#false} ~cond := #in~cond; {5507#false} is VALID [2018-11-14 15:49:36,204 INFO L273 TraceCheckUtils]: 68: Hoare triple {5507#false} assume ~cond == 0bv32; {5507#false} is VALID [2018-11-14 15:49:36,204 INFO L273 TraceCheckUtils]: 69: Hoare triple {5507#false} assume !false; {5507#false} is VALID [2018-11-14 15:49:36,210 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 15:49:36,210 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:49:36,803 INFO L273 TraceCheckUtils]: 69: Hoare triple {5507#false} assume !false; {5507#false} is VALID [2018-11-14 15:49:36,804 INFO L273 TraceCheckUtils]: 68: Hoare triple {5507#false} assume ~cond == 0bv32; {5507#false} is VALID [2018-11-14 15:49:36,804 INFO L273 TraceCheckUtils]: 67: Hoare triple {5507#false} ~cond := #in~cond; {5507#false} is VALID [2018-11-14 15:49:36,804 INFO L256 TraceCheckUtils]: 66: Hoare triple {5507#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {5507#false} is VALID [2018-11-14 15:49:36,805 INFO L273 TraceCheckUtils]: 65: Hoare triple {5507#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); {5507#false} is VALID [2018-11-14 15:49:36,805 INFO L273 TraceCheckUtils]: 64: Hoare triple {5507#false} assume true; {5507#false} is VALID [2018-11-14 15:49:36,806 INFO L273 TraceCheckUtils]: 63: Hoare triple {5507#false} #t~post8 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {5507#false} is VALID [2018-11-14 15:49:36,806 INFO L273 TraceCheckUtils]: 62: Hoare triple {5507#false} havoc #t~mem9;havoc #t~mem10; {5507#false} is VALID [2018-11-14 15:49:36,806 INFO L268 TraceCheckUtils]: 61: Hoare quadruple {5506#true} {5507#false} #143#return; {5507#false} is VALID [2018-11-14 15:49:36,807 INFO L273 TraceCheckUtils]: 60: Hoare triple {5506#true} assume true; {5506#true} is VALID [2018-11-14 15:49:36,807 INFO L273 TraceCheckUtils]: 59: Hoare triple {5506#true} assume !(~cond == 0bv32); {5506#true} is VALID [2018-11-14 15:49:36,807 INFO L273 TraceCheckUtils]: 58: Hoare triple {5506#true} ~cond := #in~cond; {5506#true} is VALID [2018-11-14 15:49:36,807 INFO L256 TraceCheckUtils]: 57: Hoare triple {5507#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {5506#true} is VALID [2018-11-14 15:49:36,807 INFO L273 TraceCheckUtils]: 56: Hoare triple {5507#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); {5507#false} is VALID [2018-11-14 15:49:36,808 INFO L273 TraceCheckUtils]: 55: Hoare triple {5507#false} assume true; {5507#false} is VALID [2018-11-14 15:49:36,808 INFO L273 TraceCheckUtils]: 54: Hoare triple {5507#false} ~x~0 := 0bv32; {5507#false} is VALID [2018-11-14 15:49:36,808 INFO L273 TraceCheckUtils]: 53: Hoare triple {5507#false} assume !~bvslt32(~x~0, ~i~0); {5507#false} is VALID [2018-11-14 15:49:36,808 INFO L273 TraceCheckUtils]: 52: Hoare triple {5507#false} assume true; {5507#false} is VALID [2018-11-14 15:49:36,809 INFO L273 TraceCheckUtils]: 51: Hoare triple {5507#false} ~x~0 := 0bv32; {5507#false} is VALID [2018-11-14 15:49:36,809 INFO L273 TraceCheckUtils]: 50: Hoare triple {5507#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); {5507#false} is VALID [2018-11-14 15:49:36,825 INFO L273 TraceCheckUtils]: 49: Hoare triple {5790#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {5507#false} is VALID [2018-11-14 15:49:36,834 INFO L273 TraceCheckUtils]: 48: Hoare triple {5790#(bvslt main_~k~0 (_ bv100000 32))} assume true; {5790#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:36,847 INFO L273 TraceCheckUtils]: 47: Hoare triple {5797#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5790#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:36,859 INFO L273 TraceCheckUtils]: 46: Hoare triple {5797#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5797#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,860 INFO L273 TraceCheckUtils]: 45: Hoare triple {5797#(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); {5797#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,860 INFO L273 TraceCheckUtils]: 44: Hoare triple {5797#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume true; {5797#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,865 INFO L273 TraceCheckUtils]: 43: Hoare triple {5810#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5797#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,866 INFO L273 TraceCheckUtils]: 42: Hoare triple {5810#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5810#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,866 INFO L273 TraceCheckUtils]: 41: Hoare triple {5810#(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); {5810#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,866 INFO L273 TraceCheckUtils]: 40: Hoare triple {5810#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume true; {5810#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,873 INFO L273 TraceCheckUtils]: 39: Hoare triple {5823#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5810#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,874 INFO L273 TraceCheckUtils]: 38: Hoare triple {5823#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5823#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,875 INFO L273 TraceCheckUtils]: 37: Hoare triple {5823#(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); {5823#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,875 INFO L273 TraceCheckUtils]: 36: Hoare triple {5823#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume true; {5823#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,883 INFO L273 TraceCheckUtils]: 35: Hoare triple {5836#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5823#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,883 INFO L273 TraceCheckUtils]: 34: Hoare triple {5836#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5836#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,884 INFO L273 TraceCheckUtils]: 33: Hoare triple {5836#(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); {5836#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,884 INFO L273 TraceCheckUtils]: 32: Hoare triple {5836#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume true; {5836#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,892 INFO L273 TraceCheckUtils]: 31: Hoare triple {5849#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5836#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,893 INFO L273 TraceCheckUtils]: 30: Hoare triple {5849#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5849#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,893 INFO L273 TraceCheckUtils]: 29: Hoare triple {5849#(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); {5849#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,893 INFO L273 TraceCheckUtils]: 28: Hoare triple {5849#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume true; {5849#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,899 INFO L273 TraceCheckUtils]: 27: Hoare triple {5862#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5849#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,900 INFO L273 TraceCheckUtils]: 26: Hoare triple {5862#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5862#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,900 INFO L273 TraceCheckUtils]: 25: Hoare triple {5862#(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); {5862#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,900 INFO L273 TraceCheckUtils]: 24: Hoare triple {5862#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume true; {5862#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,906 INFO L273 TraceCheckUtils]: 23: Hoare triple {5875#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5862#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,907 INFO L273 TraceCheckUtils]: 22: Hoare triple {5875#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5875#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,907 INFO L273 TraceCheckUtils]: 21: Hoare triple {5875#(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); {5875#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,908 INFO L273 TraceCheckUtils]: 20: Hoare triple {5875#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume true; {5875#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,915 INFO L273 TraceCheckUtils]: 19: Hoare triple {5888#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5875#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,915 INFO L273 TraceCheckUtils]: 18: Hoare triple {5888#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5888#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,916 INFO L273 TraceCheckUtils]: 17: Hoare triple {5888#(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); {5888#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,916 INFO L273 TraceCheckUtils]: 16: Hoare triple {5888#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume true; {5888#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,923 INFO L273 TraceCheckUtils]: 15: Hoare triple {5901#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5888#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,924 INFO L273 TraceCheckUtils]: 14: Hoare triple {5901#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5901#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,924 INFO L273 TraceCheckUtils]: 13: Hoare triple {5901#(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); {5901#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,925 INFO L273 TraceCheckUtils]: 12: Hoare triple {5901#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume true; {5901#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,931 INFO L273 TraceCheckUtils]: 11: Hoare triple {5914#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5901#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,938 INFO L273 TraceCheckUtils]: 10: Hoare triple {5914#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {5914#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,938 INFO L273 TraceCheckUtils]: 9: Hoare triple {5914#(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); {5914#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,939 INFO L273 TraceCheckUtils]: 8: Hoare triple {5914#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume true; {5914#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,943 INFO L273 TraceCheckUtils]: 7: Hoare triple {5927#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {5914#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,944 INFO L273 TraceCheckUtils]: 6: Hoare triple {5927#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume true; {5927#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,944 INFO L273 TraceCheckUtils]: 5: Hoare triple {5506#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {5927#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:36,944 INFO L256 TraceCheckUtils]: 4: Hoare triple {5506#true} call #t~ret15 := main(); {5506#true} is VALID [2018-11-14 15:49:36,945 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5506#true} {5506#true} #137#return; {5506#true} is VALID [2018-11-14 15:49:36,945 INFO L273 TraceCheckUtils]: 2: Hoare triple {5506#true} assume true; {5506#true} is VALID [2018-11-14 15:49:36,945 INFO L273 TraceCheckUtils]: 1: Hoare triple {5506#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5506#true} is VALID [2018-11-14 15:49:36,945 INFO L256 TraceCheckUtils]: 0: Hoare triple {5506#true} call ULTIMATE.init(); {5506#true} is VALID [2018-11-14 15:49:36,953 INFO L134 CoverageAnalysis]: Checked inductivity of 205 backedges. 2 proven. 200 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 15:49:36,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:49:36,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-14 15:49:36,955 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 70 [2018-11-14 15:49:36,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:36,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-14 15:49:37,199 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:37,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-14 15:49:37,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-14 15:49:37,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2018-11-14 15:49:37,200 INFO L87 Difference]: Start difference. First operand 186 states and 230 transitions. Second operand 26 states. [2018-11-14 15:49:46,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:46,261 INFO L93 Difference]: Finished difference Result 462 states and 613 transitions. [2018-11-14 15:49:46,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-14 15:49:46,262 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 70 [2018-11-14 15:49:46,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:49:46,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 15:49:46,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 344 transitions. [2018-11-14 15:49:46,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 15:49:46,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 344 transitions. [2018-11-14 15:49:46,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 344 transitions. [2018-11-14 15:49:47,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 344 edges. 344 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:47,058 INFO L225 Difference]: With dead ends: 462 [2018-11-14 15:49:47,059 INFO L226 Difference]: Without dead ends: 365 [2018-11-14 15:49:47,061 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=974, Invalid=2448, Unknown=0, NotChecked=0, Total=3422 [2018-11-14 15:49:47,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-11-14 15:49:47,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 330. [2018-11-14 15:49:47,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:49:47,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 365 states. Second operand 330 states. [2018-11-14 15:49:47,384 INFO L74 IsIncluded]: Start isIncluded. First operand 365 states. Second operand 330 states. [2018-11-14 15:49:47,385 INFO L87 Difference]: Start difference. First operand 365 states. Second operand 330 states. [2018-11-14 15:49:47,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:47,398 INFO L93 Difference]: Finished difference Result 365 states and 457 transitions. [2018-11-14 15:49:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 457 transitions. [2018-11-14 15:49:47,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:47,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:47,400 INFO L74 IsIncluded]: Start isIncluded. First operand 330 states. Second operand 365 states. [2018-11-14 15:49:47,400 INFO L87 Difference]: Start difference. First operand 330 states. Second operand 365 states. [2018-11-14 15:49:47,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:49:47,413 INFO L93 Difference]: Finished difference Result 365 states and 457 transitions. [2018-11-14 15:49:47,413 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 457 transitions. [2018-11-14 15:49:47,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:49:47,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:49:47,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:49:47,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:49:47,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-11-14 15:49:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 410 transitions. [2018-11-14 15:49:47,427 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 410 transitions. Word has length 70 [2018-11-14 15:49:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:49:47,428 INFO L480 AbstractCegarLoop]: Abstraction has 330 states and 410 transitions. [2018-11-14 15:49:47,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-14 15:49:47,428 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 410 transitions. [2018-11-14 15:49:47,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-11-14 15:49:47,429 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:49:47,430 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:49:47,430 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:49:47,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:49:47,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1948656622, now seen corresponding path program 2 times [2018-11-14 15:49:47,431 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:49:47,431 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 15:49:47,460 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 15:49:47,672 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 15:49:47,673 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 15:49:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 15:49:47,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 15:49:48,381 INFO L256 TraceCheckUtils]: 0: Hoare triple {7757#true} call ULTIMATE.init(); {7757#true} is VALID [2018-11-14 15:49:48,381 INFO L273 TraceCheckUtils]: 1: Hoare triple {7757#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {7757#true} is VALID [2018-11-14 15:49:48,381 INFO L273 TraceCheckUtils]: 2: Hoare triple {7757#true} assume true; {7757#true} is VALID [2018-11-14 15:49:48,382 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7757#true} {7757#true} #137#return; {7757#true} is VALID [2018-11-14 15:49:48,382 INFO L256 TraceCheckUtils]: 4: Hoare triple {7757#true} call #t~ret15 := main(); {7757#true} is VALID [2018-11-14 15:49:48,382 INFO L273 TraceCheckUtils]: 5: Hoare triple {7757#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {7777#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:48,383 INFO L273 TraceCheckUtils]: 6: Hoare triple {7777#(= main_~i~0 (_ bv0 32))} assume true; {7777#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-14 15:49:48,383 INFO L273 TraceCheckUtils]: 7: Hoare triple {7777#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {7784#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,384 INFO L273 TraceCheckUtils]: 8: Hoare triple {7784#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume true; {7784#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,384 INFO L273 TraceCheckUtils]: 9: Hoare triple {7784#(= (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); {7784#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,384 INFO L273 TraceCheckUtils]: 10: Hoare triple {7784#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7784#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,385 INFO L273 TraceCheckUtils]: 11: Hoare triple {7784#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7797#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 15:49:48,386 INFO L273 TraceCheckUtils]: 12: Hoare triple {7797#(= (_ bv2 32) main_~k~0)} assume true; {7797#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 15:49:48,386 INFO L273 TraceCheckUtils]: 13: Hoare triple {7797#(= (_ 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); {7797#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 15:49:48,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {7797#(= (_ bv2 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7797#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-14 15:49:48,388 INFO L273 TraceCheckUtils]: 15: Hoare triple {7797#(= (_ bv2 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {7810#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,388 INFO L273 TraceCheckUtils]: 16: Hoare triple {7810#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume true; {7810#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,389 INFO L273 TraceCheckUtils]: 17: Hoare triple {7810#(= (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); {7810#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,389 INFO L273 TraceCheckUtils]: 18: Hoare triple {7810#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7810#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,390 INFO L273 TraceCheckUtils]: 19: Hoare triple {7810#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7823#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,391 INFO L273 TraceCheckUtils]: 20: Hoare triple {7823#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume true; {7823#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,392 INFO L273 TraceCheckUtils]: 21: Hoare triple {7823#(= (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); {7823#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,392 INFO L273 TraceCheckUtils]: 22: Hoare triple {7823#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7823#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,393 INFO L273 TraceCheckUtils]: 23: Hoare triple {7823#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7836#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,394 INFO L273 TraceCheckUtils]: 24: Hoare triple {7836#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume true; {7836#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,394 INFO L273 TraceCheckUtils]: 25: Hoare triple {7836#(= (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); {7836#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,395 INFO L273 TraceCheckUtils]: 26: Hoare triple {7836#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7836#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,396 INFO L273 TraceCheckUtils]: 27: Hoare triple {7836#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7849#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 15:49:48,397 INFO L273 TraceCheckUtils]: 28: Hoare triple {7849#(= (_ bv6 32) main_~k~0)} assume true; {7849#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 15:49:48,397 INFO L273 TraceCheckUtils]: 29: Hoare triple {7849#(= (_ 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); {7849#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 15:49:48,402 INFO L273 TraceCheckUtils]: 30: Hoare triple {7849#(= (_ bv6 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7849#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-14 15:49:48,403 INFO L273 TraceCheckUtils]: 31: Hoare triple {7849#(= (_ bv6 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {7862#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,403 INFO L273 TraceCheckUtils]: 32: Hoare triple {7862#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume true; {7862#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,404 INFO L273 TraceCheckUtils]: 33: Hoare triple {7862#(= (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); {7862#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,404 INFO L273 TraceCheckUtils]: 34: Hoare triple {7862#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7862#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,405 INFO L273 TraceCheckUtils]: 35: Hoare triple {7862#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7875#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,405 INFO L273 TraceCheckUtils]: 36: Hoare triple {7875#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {7875#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,406 INFO L273 TraceCheckUtils]: 37: Hoare triple {7875#(= (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); {7875#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,406 INFO L273 TraceCheckUtils]: 38: Hoare triple {7875#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7875#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,407 INFO L273 TraceCheckUtils]: 39: Hoare triple {7875#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7888#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 15:49:48,407 INFO L273 TraceCheckUtils]: 40: Hoare triple {7888#(= (_ bv9 32) main_~k~0)} assume true; {7888#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 15:49:48,408 INFO L273 TraceCheckUtils]: 41: Hoare triple {7888#(= (_ 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); {7888#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 15:49:48,409 INFO L273 TraceCheckUtils]: 42: Hoare triple {7888#(= (_ bv9 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7888#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-14 15:49:48,410 INFO L273 TraceCheckUtils]: 43: Hoare triple {7888#(= (_ bv9 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {7901#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,410 INFO L273 TraceCheckUtils]: 44: Hoare triple {7901#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {7901#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,411 INFO L273 TraceCheckUtils]: 45: Hoare triple {7901#(= (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); {7901#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,412 INFO L273 TraceCheckUtils]: 46: Hoare triple {7901#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7901#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,413 INFO L273 TraceCheckUtils]: 47: Hoare triple {7901#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7914#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 15:49:48,413 INFO L273 TraceCheckUtils]: 48: Hoare triple {7914#(= (_ bv11 32) main_~k~0)} assume true; {7914#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 15:49:48,414 INFO L273 TraceCheckUtils]: 49: Hoare triple {7914#(= (_ 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); {7914#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 15:49:48,414 INFO L273 TraceCheckUtils]: 50: Hoare triple {7914#(= (_ bv11 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7914#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-14 15:49:48,415 INFO L273 TraceCheckUtils]: 51: Hoare triple {7914#(= (_ bv11 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {7927#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,416 INFO L273 TraceCheckUtils]: 52: Hoare triple {7927#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume true; {7927#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,417 INFO L273 TraceCheckUtils]: 53: Hoare triple {7927#(= (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); {7927#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,417 INFO L273 TraceCheckUtils]: 54: Hoare triple {7927#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7927#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,418 INFO L273 TraceCheckUtils]: 55: Hoare triple {7927#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7940#(= (_ bv13 32) main_~k~0)} is VALID [2018-11-14 15:49:48,419 INFO L273 TraceCheckUtils]: 56: Hoare triple {7940#(= (_ bv13 32) main_~k~0)} assume true; {7940#(= (_ bv13 32) main_~k~0)} is VALID [2018-11-14 15:49:48,419 INFO L273 TraceCheckUtils]: 57: Hoare triple {7940#(= (_ bv13 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); {7940#(= (_ bv13 32) main_~k~0)} is VALID [2018-11-14 15:49:48,420 INFO L273 TraceCheckUtils]: 58: Hoare triple {7940#(= (_ bv13 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7940#(= (_ bv13 32) main_~k~0)} is VALID [2018-11-14 15:49:48,421 INFO L273 TraceCheckUtils]: 59: Hoare triple {7940#(= (_ bv13 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {7953#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,422 INFO L273 TraceCheckUtils]: 60: Hoare triple {7953#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} assume true; {7953#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,422 INFO L273 TraceCheckUtils]: 61: Hoare triple {7953#(= (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); {7953#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,423 INFO L273 TraceCheckUtils]: 62: Hoare triple {7953#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7953#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,424 INFO L273 TraceCheckUtils]: 63: Hoare triple {7953#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7966#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-14 15:49:48,424 INFO L273 TraceCheckUtils]: 64: Hoare triple {7966#(= (_ bv15 32) main_~k~0)} assume true; {7966#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-14 15:49:48,425 INFO L273 TraceCheckUtils]: 65: Hoare triple {7966#(= (_ 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); {7966#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-14 15:49:48,426 INFO L273 TraceCheckUtils]: 66: Hoare triple {7966#(= (_ bv15 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7966#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-14 15:49:48,426 INFO L273 TraceCheckUtils]: 67: Hoare triple {7966#(= (_ bv15 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {7979#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,427 INFO L273 TraceCheckUtils]: 68: Hoare triple {7979#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume true; {7979#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,428 INFO L273 TraceCheckUtils]: 69: Hoare triple {7979#(= (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); {7979#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,428 INFO L273 TraceCheckUtils]: 70: Hoare triple {7979#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7979#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,429 INFO L273 TraceCheckUtils]: 71: Hoare triple {7979#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7992#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-14 15:49:48,430 INFO L273 TraceCheckUtils]: 72: Hoare triple {7992#(= (_ bv17 32) main_~k~0)} assume true; {7992#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-14 15:49:48,430 INFO L273 TraceCheckUtils]: 73: Hoare triple {7992#(= (_ bv17 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); {7992#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-14 15:49:48,431 INFO L273 TraceCheckUtils]: 74: Hoare triple {7992#(= (_ bv17 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {7992#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-14 15:49:48,432 INFO L273 TraceCheckUtils]: 75: Hoare triple {7992#(= (_ bv17 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {8005#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,432 INFO L273 TraceCheckUtils]: 76: Hoare triple {8005#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume true; {8005#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,433 INFO L273 TraceCheckUtils]: 77: Hoare triple {8005#(= (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); {8005#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,434 INFO L273 TraceCheckUtils]: 78: Hoare triple {8005#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8005#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,435 INFO L273 TraceCheckUtils]: 79: Hoare triple {8005#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8018#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-14 15:49:48,450 INFO L273 TraceCheckUtils]: 80: Hoare triple {8018#(= (_ bv19 32) main_~k~0)} assume true; {8018#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-14 15:49:48,451 INFO L273 TraceCheckUtils]: 81: Hoare triple {8018#(= (_ 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); {8018#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-14 15:49:48,451 INFO L273 TraceCheckUtils]: 82: Hoare triple {8018#(= (_ bv19 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8018#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-14 15:49:48,452 INFO L273 TraceCheckUtils]: 83: Hoare triple {8018#(= (_ bv19 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {8031#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,452 INFO L273 TraceCheckUtils]: 84: Hoare triple {8031#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} assume true; {8031#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,453 INFO L273 TraceCheckUtils]: 85: Hoare triple {8031#(= (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); {8031#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,453 INFO L273 TraceCheckUtils]: 86: Hoare triple {8031#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8031#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,454 INFO L273 TraceCheckUtils]: 87: Hoare triple {8031#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8044#(= (_ bv21 32) main_~k~0)} is VALID [2018-11-14 15:49:48,454 INFO L273 TraceCheckUtils]: 88: Hoare triple {8044#(= (_ bv21 32) main_~k~0)} assume true; {8044#(= (_ bv21 32) main_~k~0)} is VALID [2018-11-14 15:49:48,454 INFO L273 TraceCheckUtils]: 89: Hoare triple {8044#(= (_ bv21 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); {8044#(= (_ bv21 32) main_~k~0)} is VALID [2018-11-14 15:49:48,455 INFO L273 TraceCheckUtils]: 90: Hoare triple {8044#(= (_ bv21 32) main_~k~0)} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8044#(= (_ bv21 32) main_~k~0)} is VALID [2018-11-14 15:49:48,455 INFO L273 TraceCheckUtils]: 91: Hoare triple {8044#(= (_ bv21 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {8057#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,456 INFO L273 TraceCheckUtils]: 92: Hoare triple {8057#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} assume true; {8057#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,456 INFO L273 TraceCheckUtils]: 93: Hoare triple {8057#(= (bvadd main_~k~0 (_ bv4294967274 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); {8057#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,457 INFO L273 TraceCheckUtils]: 94: Hoare triple {8057#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8057#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,458 INFO L273 TraceCheckUtils]: 95: Hoare triple {8057#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8070#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,458 INFO L273 TraceCheckUtils]: 96: Hoare triple {8070#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} assume true; {8070#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} is VALID [2018-11-14 15:49:48,459 INFO L273 TraceCheckUtils]: 97: Hoare triple {8070#(= (bvadd main_~k~0 (_ bv4294967273 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {7758#false} is VALID [2018-11-14 15:49:48,459 INFO L273 TraceCheckUtils]: 98: Hoare triple {7758#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); {7758#false} is VALID [2018-11-14 15:49:48,460 INFO L273 TraceCheckUtils]: 99: Hoare triple {7758#false} ~x~0 := 0bv32; {7758#false} is VALID [2018-11-14 15:49:48,460 INFO L273 TraceCheckUtils]: 100: Hoare triple {7758#false} assume true; {7758#false} is VALID [2018-11-14 15:49:48,460 INFO L273 TraceCheckUtils]: 101: Hoare triple {7758#false} assume !~bvslt32(~x~0, ~i~0); {7758#false} is VALID [2018-11-14 15:49:48,461 INFO L273 TraceCheckUtils]: 102: Hoare triple {7758#false} ~x~0 := 0bv32; {7758#false} is VALID [2018-11-14 15:49:48,461 INFO L273 TraceCheckUtils]: 103: Hoare triple {7758#false} assume true; {7758#false} is VALID [2018-11-14 15:49:48,461 INFO L273 TraceCheckUtils]: 104: Hoare triple {7758#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); {7758#false} is VALID [2018-11-14 15:49:48,461 INFO L256 TraceCheckUtils]: 105: Hoare triple {7758#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {7758#false} is VALID [2018-11-14 15:49:48,462 INFO L273 TraceCheckUtils]: 106: Hoare triple {7758#false} ~cond := #in~cond; {7758#false} is VALID [2018-11-14 15:49:48,462 INFO L273 TraceCheckUtils]: 107: Hoare triple {7758#false} assume !(~cond == 0bv32); {7758#false} is VALID [2018-11-14 15:49:48,462 INFO L273 TraceCheckUtils]: 108: Hoare triple {7758#false} assume true; {7758#false} is VALID [2018-11-14 15:49:48,462 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {7758#false} {7758#false} #143#return; {7758#false} is VALID [2018-11-14 15:49:48,462 INFO L273 TraceCheckUtils]: 110: Hoare triple {7758#false} havoc #t~mem9;havoc #t~mem10; {7758#false} is VALID [2018-11-14 15:49:48,463 INFO L273 TraceCheckUtils]: 111: Hoare triple {7758#false} #t~post8 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {7758#false} is VALID [2018-11-14 15:49:48,463 INFO L273 TraceCheckUtils]: 112: Hoare triple {7758#false} assume true; {7758#false} is VALID [2018-11-14 15:49:48,463 INFO L273 TraceCheckUtils]: 113: Hoare triple {7758#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); {7758#false} is VALID [2018-11-14 15:49:48,463 INFO L256 TraceCheckUtils]: 114: Hoare triple {7758#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {7758#false} is VALID [2018-11-14 15:49:48,463 INFO L273 TraceCheckUtils]: 115: Hoare triple {7758#false} ~cond := #in~cond; {7758#false} is VALID [2018-11-14 15:49:48,463 INFO L273 TraceCheckUtils]: 116: Hoare triple {7758#false} assume ~cond == 0bv32; {7758#false} is VALID [2018-11-14 15:49:48,463 INFO L273 TraceCheckUtils]: 117: Hoare triple {7758#false} assume !false; {7758#false} is VALID [2018-11-14 15:49:48,484 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 0 proven. 968 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-14 15:49:48,484 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 15:49:50,448 INFO L273 TraceCheckUtils]: 117: Hoare triple {7758#false} assume !false; {7758#false} is VALID [2018-11-14 15:49:50,448 INFO L273 TraceCheckUtils]: 116: Hoare triple {7758#false} assume ~cond == 0bv32; {7758#false} is VALID [2018-11-14 15:49:50,448 INFO L273 TraceCheckUtils]: 115: Hoare triple {7758#false} ~cond := #in~cond; {7758#false} is VALID [2018-11-14 15:49:50,448 INFO L256 TraceCheckUtils]: 114: Hoare triple {7758#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {7758#false} is VALID [2018-11-14 15:49:50,449 INFO L273 TraceCheckUtils]: 113: Hoare triple {7758#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); {7758#false} is VALID [2018-11-14 15:49:50,449 INFO L273 TraceCheckUtils]: 112: Hoare triple {7758#false} assume true; {7758#false} is VALID [2018-11-14 15:49:50,449 INFO L273 TraceCheckUtils]: 111: Hoare triple {7758#false} #t~post8 := ~x~0;~x~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {7758#false} is VALID [2018-11-14 15:49:50,449 INFO L273 TraceCheckUtils]: 110: Hoare triple {7758#false} havoc #t~mem9;havoc #t~mem10; {7758#false} is VALID [2018-11-14 15:49:50,449 INFO L268 TraceCheckUtils]: 109: Hoare quadruple {7757#true} {7758#false} #143#return; {7758#false} is VALID [2018-11-14 15:49:50,449 INFO L273 TraceCheckUtils]: 108: Hoare triple {7757#true} assume true; {7757#true} is VALID [2018-11-14 15:49:50,449 INFO L273 TraceCheckUtils]: 107: Hoare triple {7757#true} assume !(~cond == 0bv32); {7757#true} is VALID [2018-11-14 15:49:50,449 INFO L273 TraceCheckUtils]: 106: Hoare triple {7757#true} ~cond := #in~cond; {7757#true} is VALID [2018-11-14 15:49:50,450 INFO L256 TraceCheckUtils]: 105: Hoare triple {7758#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {7757#true} is VALID [2018-11-14 15:49:50,450 INFO L273 TraceCheckUtils]: 104: Hoare triple {7758#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); {7758#false} is VALID [2018-11-14 15:49:50,450 INFO L273 TraceCheckUtils]: 103: Hoare triple {7758#false} assume true; {7758#false} is VALID [2018-11-14 15:49:50,450 INFO L273 TraceCheckUtils]: 102: Hoare triple {7758#false} ~x~0 := 0bv32; {7758#false} is VALID [2018-11-14 15:49:50,450 INFO L273 TraceCheckUtils]: 101: Hoare triple {7758#false} assume !~bvslt32(~x~0, ~i~0); {7758#false} is VALID [2018-11-14 15:49:50,450 INFO L273 TraceCheckUtils]: 100: Hoare triple {7758#false} assume true; {7758#false} is VALID [2018-11-14 15:49:50,450 INFO L273 TraceCheckUtils]: 99: Hoare triple {7758#false} ~x~0 := 0bv32; {7758#false} is VALID [2018-11-14 15:49:50,450 INFO L273 TraceCheckUtils]: 98: Hoare triple {7758#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); {7758#false} is VALID [2018-11-14 15:49:50,451 INFO L273 TraceCheckUtils]: 97: Hoare triple {8197#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {7758#false} is VALID [2018-11-14 15:49:50,455 INFO L273 TraceCheckUtils]: 96: Hoare triple {8197#(bvslt main_~k~0 (_ bv100000 32))} assume true; {8197#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:50,456 INFO L273 TraceCheckUtils]: 95: Hoare triple {8204#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8197#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-14 15:49:50,456 INFO L273 TraceCheckUtils]: 94: Hoare triple {8204#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8204#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,458 INFO L273 TraceCheckUtils]: 93: Hoare triple {8204#(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); {8204#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,458 INFO L273 TraceCheckUtils]: 92: Hoare triple {8204#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume true; {8204#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,463 INFO L273 TraceCheckUtils]: 91: Hoare triple {8217#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8204#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,463 INFO L273 TraceCheckUtils]: 90: Hoare triple {8217#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8217#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,466 INFO L273 TraceCheckUtils]: 89: Hoare triple {8217#(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); {8217#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,466 INFO L273 TraceCheckUtils]: 88: Hoare triple {8217#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume true; {8217#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,473 INFO L273 TraceCheckUtils]: 87: Hoare triple {8230#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8217#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,473 INFO L273 TraceCheckUtils]: 86: Hoare triple {8230#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8230#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,473 INFO L273 TraceCheckUtils]: 85: Hoare triple {8230#(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); {8230#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,475 INFO L273 TraceCheckUtils]: 84: Hoare triple {8230#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume true; {8230#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,478 INFO L273 TraceCheckUtils]: 83: Hoare triple {8243#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8230#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,480 INFO L273 TraceCheckUtils]: 82: Hoare triple {8243#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8243#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,480 INFO L273 TraceCheckUtils]: 81: Hoare triple {8243#(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); {8243#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,482 INFO L273 TraceCheckUtils]: 80: Hoare triple {8243#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume true; {8243#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,488 INFO L273 TraceCheckUtils]: 79: Hoare triple {8256#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8243#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,489 INFO L273 TraceCheckUtils]: 78: Hoare triple {8256#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8256#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,489 INFO L273 TraceCheckUtils]: 77: Hoare triple {8256#(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); {8256#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,492 INFO L273 TraceCheckUtils]: 76: Hoare triple {8256#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume true; {8256#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,508 INFO L273 TraceCheckUtils]: 75: Hoare triple {8269#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8256#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,520 INFO L273 TraceCheckUtils]: 74: Hoare triple {8269#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8269#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,533 INFO L273 TraceCheckUtils]: 73: Hoare triple {8269#(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); {8269#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,545 INFO L273 TraceCheckUtils]: 72: Hoare triple {8269#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume true; {8269#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,565 INFO L273 TraceCheckUtils]: 71: Hoare triple {8282#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8269#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,574 INFO L273 TraceCheckUtils]: 70: Hoare triple {8282#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8282#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,587 INFO L273 TraceCheckUtils]: 69: Hoare triple {8282#(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); {8282#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,599 INFO L273 TraceCheckUtils]: 68: Hoare triple {8282#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume true; {8282#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,612 INFO L273 TraceCheckUtils]: 67: Hoare triple {8295#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8282#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,626 INFO L273 TraceCheckUtils]: 66: Hoare triple {8295#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8295#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,634 INFO L273 TraceCheckUtils]: 65: Hoare triple {8295#(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); {8295#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,647 INFO L273 TraceCheckUtils]: 64: Hoare triple {8295#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume true; {8295#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,660 INFO L273 TraceCheckUtils]: 63: Hoare triple {8308#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8295#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,672 INFO L273 TraceCheckUtils]: 62: Hoare triple {8308#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8308#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,690 INFO L273 TraceCheckUtils]: 61: Hoare triple {8308#(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); {8308#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,699 INFO L273 TraceCheckUtils]: 60: Hoare triple {8308#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume true; {8308#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,712 INFO L273 TraceCheckUtils]: 59: Hoare triple {8321#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8308#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,724 INFO L273 TraceCheckUtils]: 58: Hoare triple {8321#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8321#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,736 INFO L273 TraceCheckUtils]: 57: Hoare triple {8321#(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); {8321#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,755 INFO L273 TraceCheckUtils]: 56: Hoare triple {8321#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume true; {8321#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,767 INFO L273 TraceCheckUtils]: 55: Hoare triple {8334#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8321#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,776 INFO L273 TraceCheckUtils]: 54: Hoare triple {8334#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8334#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,789 INFO L273 TraceCheckUtils]: 53: Hoare triple {8334#(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); {8334#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,801 INFO L273 TraceCheckUtils]: 52: Hoare triple {8334#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} assume true; {8334#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,820 INFO L273 TraceCheckUtils]: 51: Hoare triple {8347#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8334#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,829 INFO L273 TraceCheckUtils]: 50: Hoare triple {8347#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8347#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,842 INFO L273 TraceCheckUtils]: 49: Hoare triple {8347#(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); {8347#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,855 INFO L273 TraceCheckUtils]: 48: Hoare triple {8347#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} assume true; {8347#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,868 INFO L273 TraceCheckUtils]: 47: Hoare triple {8360#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8347#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,888 INFO L273 TraceCheckUtils]: 46: Hoare triple {8360#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8360#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,897 INFO L273 TraceCheckUtils]: 45: Hoare triple {8360#(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); {8360#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,909 INFO L273 TraceCheckUtils]: 44: Hoare triple {8360#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} assume true; {8360#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,925 INFO L273 TraceCheckUtils]: 43: Hoare triple {8373#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8360#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,930 INFO L273 TraceCheckUtils]: 42: Hoare triple {8373#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8373#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,930 INFO L273 TraceCheckUtils]: 41: Hoare triple {8373#(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); {8373#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,931 INFO L273 TraceCheckUtils]: 40: Hoare triple {8373#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} assume true; {8373#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,939 INFO L273 TraceCheckUtils]: 39: Hoare triple {8386#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8373#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,939 INFO L273 TraceCheckUtils]: 38: Hoare triple {8386#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8386#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,940 INFO L273 TraceCheckUtils]: 37: Hoare triple {8386#(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); {8386#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,940 INFO L273 TraceCheckUtils]: 36: Hoare triple {8386#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} assume true; {8386#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,946 INFO L273 TraceCheckUtils]: 35: Hoare triple {8399#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8386#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,946 INFO L273 TraceCheckUtils]: 34: Hoare triple {8399#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8399#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,946 INFO L273 TraceCheckUtils]: 33: Hoare triple {8399#(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); {8399#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,947 INFO L273 TraceCheckUtils]: 32: Hoare triple {8399#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} assume true; {8399#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,951 INFO L273 TraceCheckUtils]: 31: Hoare triple {8412#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8399#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,952 INFO L273 TraceCheckUtils]: 30: Hoare triple {8412#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8412#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,952 INFO L273 TraceCheckUtils]: 29: Hoare triple {8412#(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); {8412#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,952 INFO L273 TraceCheckUtils]: 28: Hoare triple {8412#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} assume true; {8412#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,958 INFO L273 TraceCheckUtils]: 27: Hoare triple {8425#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8412#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,959 INFO L273 TraceCheckUtils]: 26: Hoare triple {8425#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8425#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,959 INFO L273 TraceCheckUtils]: 25: Hoare triple {8425#(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); {8425#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,959 INFO L273 TraceCheckUtils]: 24: Hoare triple {8425#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} assume true; {8425#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,965 INFO L273 TraceCheckUtils]: 23: Hoare triple {8438#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8425#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,965 INFO L273 TraceCheckUtils]: 22: Hoare triple {8438#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8438#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,965 INFO L273 TraceCheckUtils]: 21: Hoare triple {8438#(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); {8438#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,966 INFO L273 TraceCheckUtils]: 20: Hoare triple {8438#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} assume true; {8438#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,970 INFO L273 TraceCheckUtils]: 19: Hoare triple {8451#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8438#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,971 INFO L273 TraceCheckUtils]: 18: Hoare triple {8451#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8451#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,971 INFO L273 TraceCheckUtils]: 17: Hoare triple {8451#(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); {8451#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,972 INFO L273 TraceCheckUtils]: 16: Hoare triple {8451#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} assume true; {8451#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,980 INFO L273 TraceCheckUtils]: 15: Hoare triple {8464#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8451#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,980 INFO L273 TraceCheckUtils]: 14: Hoare triple {8464#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8464#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,980 INFO L273 TraceCheckUtils]: 13: Hoare triple {8464#(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); {8464#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,981 INFO L273 TraceCheckUtils]: 12: Hoare triple {8464#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} assume true; {8464#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,987 INFO L273 TraceCheckUtils]: 11: Hoare triple {8477#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8464#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,987 INFO L273 TraceCheckUtils]: 10: Hoare triple {8477#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvslt32(#t~mem0, #t~mem1);havoc #t~mem1;havoc #t~mem0;~s~0 := ~k~0; {8477#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,988 INFO L273 TraceCheckUtils]: 9: Hoare triple {8477#(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); {8477#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,988 INFO L273 TraceCheckUtils]: 8: Hoare triple {8477#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} assume true; {8477#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,994 INFO L273 TraceCheckUtils]: 7: Hoare triple {8490#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~bvadd32(1bv32, ~i~0);~s~0 := ~i~0; {8477#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,995 INFO L273 TraceCheckUtils]: 6: Hoare triple {8490#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} assume true; {8490#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,995 INFO L273 TraceCheckUtils]: 5: Hoare triple {7757#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {8490#(bvslt (bvadd main_~i~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-14 15:49:50,995 INFO L256 TraceCheckUtils]: 4: Hoare triple {7757#true} call #t~ret15 := main(); {7757#true} is VALID [2018-11-14 15:49:50,996 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7757#true} {7757#true} #137#return; {7757#true} is VALID [2018-11-14 15:49:50,996 INFO L273 TraceCheckUtils]: 2: Hoare triple {7757#true} assume true; {7757#true} is VALID [2018-11-14 15:49:50,996 INFO L273 TraceCheckUtils]: 1: Hoare triple {7757#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {7757#true} is VALID [2018-11-14 15:49:50,996 INFO L256 TraceCheckUtils]: 0: Hoare triple {7757#true} call ULTIMATE.init(); {7757#true} is VALID [2018-11-14 15:49:51,014 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 2 proven. 968 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-14 15:49:51,020 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 15:49:51,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-11-14 15:49:51,021 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 118 [2018-11-14 15:49:51,022 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 15:49:51,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-14 15:49:51,454 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 212 edges. 212 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:49:51,455 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-14 15:49:51,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-14 15:49:51,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=1823, Unknown=0, NotChecked=0, Total=2450 [2018-11-14 15:49:51,456 INFO L87 Difference]: Start difference. First operand 330 states and 410 transitions. Second operand 50 states. [2018-11-14 15:50:00,902 WARN L179 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 10 [2018-11-14 15:50:01,480 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 10 [2018-11-14 15:50:02,106 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 10 [2018-11-14 15:50:02,737 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 10 [2018-11-14 15:50:03,368 WARN L179 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 10 [2018-11-14 15:50:04,041 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 10 [2018-11-14 15:50:04,700 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 10 [2018-11-14 15:50:05,344 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2018-11-14 15:50:14,540 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 11 [2018-11-14 15:50:15,469 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 11 [2018-11-14 15:50:16,460 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 11 [2018-11-14 15:50:17,262 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 11 [2018-11-14 15:50:18,106 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 11 [2018-11-14 15:50:19,003 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 11 [2018-11-14 15:50:19,918 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 11 [2018-11-14 15:50:20,853 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 11 [2018-11-14 15:50:21,855 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 11 [2018-11-14 15:50:22,847 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 11 [2018-11-14 15:50:31,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:50:31,683 INFO L93 Difference]: Finished difference Result 798 states and 1069 transitions. [2018-11-14 15:50:31,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-14 15:50:31,683 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 118 [2018-11-14 15:50:31,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 15:50:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 15:50:31,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 542 transitions. [2018-11-14 15:50:31,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-14 15:50:31,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 542 transitions. [2018-11-14 15:50:31,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 542 transitions. [2018-11-14 15:50:34,670 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 542 edges. 542 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 15:50:34,694 INFO L225 Difference]: With dead ends: 798 [2018-11-14 15:50:34,694 INFO L226 Difference]: Without dead ends: 653 [2018-11-14 15:50:34,698 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 187 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2369 ImplicationChecksByTransitivity, 28.3s TimeCoverageRelationStatistics Valid=3824, Invalid=10218, Unknown=0, NotChecked=0, Total=14042 [2018-11-14 15:50:34,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2018-11-14 15:50:35,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 618. [2018-11-14 15:50:35,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 15:50:35,312 INFO L82 GeneralOperation]: Start isEquivalent. First operand 653 states. Second operand 618 states. [2018-11-14 15:50:35,312 INFO L74 IsIncluded]: Start isIncluded. First operand 653 states. Second operand 618 states. [2018-11-14 15:50:35,312 INFO L87 Difference]: Start difference. First operand 653 states. Second operand 618 states. [2018-11-14 15:50:35,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:50:35,341 INFO L93 Difference]: Finished difference Result 653 states and 817 transitions. [2018-11-14 15:50:35,341 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 817 transitions. [2018-11-14 15:50:35,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:50:35,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:50:35,343 INFO L74 IsIncluded]: Start isIncluded. First operand 618 states. Second operand 653 states. [2018-11-14 15:50:35,344 INFO L87 Difference]: Start difference. First operand 618 states. Second operand 653 states. [2018-11-14 15:50:35,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 15:50:35,371 INFO L93 Difference]: Finished difference Result 653 states and 817 transitions. [2018-11-14 15:50:35,371 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 817 transitions. [2018-11-14 15:50:35,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 15:50:35,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 15:50:35,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 15:50:35,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 15:50:35,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 618 states. [2018-11-14 15:50:35,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 618 states to 618 states and 770 transitions. [2018-11-14 15:50:35,401 INFO L78 Accepts]: Start accepts. Automaton has 618 states and 770 transitions. Word has length 118 [2018-11-14 15:50:35,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 15:50:35,402 INFO L480 AbstractCegarLoop]: Abstraction has 618 states and 770 transitions. [2018-11-14 15:50:35,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-14 15:50:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 770 transitions. [2018-11-14 15:50:35,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-11-14 15:50:35,406 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 15:50:35,406 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 15:50:35,406 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 15:50:35,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 15:50:35,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1009837570, now seen corresponding path program 3 times [2018-11-14 15:50:35,408 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 15:50:35,408 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 12 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 12 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 15:50:35,435 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2