java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call2_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:54:54,601 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:54:54,603 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:54:54,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:54:54,616 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:54:54,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:54:54,619 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:54:54,621 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:54:54,623 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:54:54,624 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:54:54,625 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:54:54,625 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:54:54,626 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:54:54,630 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:54:54,632 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:54:54,632 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:54:54,633 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:54:54,638 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:54:54,643 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:54:54,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:54:54,650 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:54:54,653 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:54:54,655 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:54:54,659 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:54:54,659 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:54:54,660 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:54:54,661 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:54:54,661 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:54:54,662 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:54:54,663 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:54:54,663 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:54:54,664 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:54:54,664 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:54:54,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:54:54,665 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:54:54,666 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:54:54,666 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 09:54:54,689 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:54:54,689 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:54:54,690 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:54:54,690 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:54:54,695 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:54:54,695 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:54:54,695 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:54:54,695 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:54:54,696 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:54:54,696 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:54:54,696 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:54:54,696 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:54:54,696 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:54:54,697 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:54:54,698 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:54:54,698 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:54:54,698 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:54:54,698 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:54:54,699 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:54:54,700 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:54:54,700 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:54:54,700 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:54:54,701 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:54:54,701 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:54:54,701 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:54:54,701 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:54:54,701 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:54:54,702 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:54:54,702 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:54:54,702 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:54:54,703 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:54:54,703 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:54:54,703 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:54:54,755 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:54:54,768 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:54:54,772 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:54:54,774 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:54:54,774 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:54:54,775 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call2_ground.i [2018-11-23 09:54:54,836 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb8ddacb/48dbfc711b9c4c97bd6fc8c6854f144d/FLAGe6044983f [2018-11-23 09:54:55,389 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:54:55,390 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/sorting_selectionsort_false-unreach-call2_ground.i [2018-11-23 09:54:55,397 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb8ddacb/48dbfc711b9c4c97bd6fc8c6854f144d/FLAGe6044983f [2018-11-23 09:54:55,710 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb8ddacb/48dbfc711b9c4c97bd6fc8c6854f144d [2018-11-23 09:54:55,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:54:55,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:54:55,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:55,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:54:55,728 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:54:55,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:55" (1/1) ... [2018-11-23 09:54:55,732 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b138f55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:55, skipping insertion in model container [2018-11-23 09:54:55,733 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:54:55" (1/1) ... [2018-11-23 09:54:55,743 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:54:55,763 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:54:56,074 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,086 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:54:56,134 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:54:56,160 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:54:56,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56 WrapperNode [2018-11-23 09:54:56,161 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:54:56,162 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,162 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:54:56,163 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:54:56,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,187 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,198 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:54:56,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:54:56,199 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:54:56,209 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,209 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,220 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,260 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,272 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,274 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... [2018-11-23 09:54:56,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:54:56,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:54:56,279 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:54:56,279 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:54:56,280 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:54:56,420 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:54:56,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:54:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:54:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:54:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:54:56,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:54:56,421 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:54:56,422 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:54:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:54:56,422 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:54:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:54:56,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:54:57,264 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:54:57,265 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-11-23 09:54:57,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57 BoogieIcfgContainer [2018-11-23 09:54:57,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:54:57,266 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:54:57,266 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:54:57,270 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:54:57,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:54:55" (1/3) ... [2018-11-23 09:54:57,271 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b786578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:54:56" (2/3) ... [2018-11-23 09:54:57,272 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b786578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:54:57, skipping insertion in model container [2018-11-23 09:54:57,272 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:54:57" (3/3) ... [2018-11-23 09:54:57,274 INFO L112 eAbstractionObserver]: Analyzing ICFG sorting_selectionsort_false-unreach-call2_ground.i [2018-11-23 09:54:57,284 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:54:57,293 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:54:57,311 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:54:57,345 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:54:57,346 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:54:57,346 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:54:57,346 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:54:57,347 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:54:57,347 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:54:57,347 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:54:57,347 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:54:57,348 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:54:57,367 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 09:54:57,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 09:54:57,374 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:57,375 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:57,377 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:57,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:57,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1945224924, now seen corresponding path program 1 times [2018-11-23 09:54:57,389 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:57,390 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:54:57,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:57,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:57,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:57,527 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:57,639 INFO L256 TraceCheckUtils]: 0: Hoare triple {45#true} call ULTIMATE.init(); {45#true} is VALID [2018-11-23 09:54:57,643 INFO L273 TraceCheckUtils]: 1: Hoare triple {45#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {45#true} is VALID [2018-11-23 09:54:57,643 INFO L273 TraceCheckUtils]: 2: Hoare triple {45#true} assume true; {45#true} is VALID [2018-11-23 09:54:57,644 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {45#true} {45#true} #130#return; {45#true} is VALID [2018-11-23 09:54:57,644 INFO L256 TraceCheckUtils]: 4: Hoare triple {45#true} call #t~ret15 := main(); {45#true} is VALID [2018-11-23 09:54:57,644 INFO L273 TraceCheckUtils]: 5: Hoare triple {45#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {45#true} is VALID [2018-11-23 09:54:57,646 INFO L273 TraceCheckUtils]: 6: Hoare triple {45#true} assume !true; {46#false} is VALID [2018-11-23 09:54:57,646 INFO L273 TraceCheckUtils]: 7: Hoare triple {46#false} ~x~0 := 0bv32; {46#false} is VALID [2018-11-23 09:54:57,646 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#false} assume !!~bvslt32(~x~0, 100000bv32);~y~0 := ~bvadd32(1bv32, ~x~0); {46#false} is VALID [2018-11-23 09:54:57,647 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#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); {46#false} is VALID [2018-11-23 09:54:57,647 INFO L256 TraceCheckUtils]: 10: Hoare triple {46#false} call __VERIFIER_assert((if ~bvsle32(#t~mem13, #t~mem14) then 1bv32 else 0bv32)); {46#false} is VALID [2018-11-23 09:54:57,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {46#false} ~cond := #in~cond; {46#false} is VALID [2018-11-23 09:54:57,648 INFO L273 TraceCheckUtils]: 12: Hoare triple {46#false} assume 0bv32 == ~cond; {46#false} is VALID [2018-11-23 09:54:57,648 INFO L273 TraceCheckUtils]: 13: Hoare triple {46#false} assume !false; {46#false} is VALID [2018-11-23 09:54:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:54:57,651 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:54:57,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:57,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:54:57,668 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 09:54:57,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:57,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:54:57,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:57,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:54:57,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:54:57,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:54:57,751 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 09:54:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:57,940 INFO L93 Difference]: Finished difference Result 78 states and 117 transitions. [2018-11-23 09:54:57,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:54:57,941 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-23 09:54:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:54:57,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:57,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 09:54:57,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:54:57,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 09:54:57,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 117 transitions. [2018-11-23 09:54:58,625 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:58,640 INFO L225 Difference]: With dead ends: 78 [2018-11-23 09:54:58,640 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 09:54:58,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:54:58,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 09:54:58,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-23 09:54:58,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:54:58,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 37 states. [2018-11-23 09:54:58,880 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 09:54:58,881 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 09:54:58,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,888 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 09:54:58,888 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 09:54:58,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:58,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:58,890 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 37 states. [2018-11-23 09:54:58,890 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 37 states. [2018-11-23 09:54:58,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:58,896 INFO L93 Difference]: Finished difference Result 37 states and 47 transitions. [2018-11-23 09:54:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 09:54:58,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:58,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:58,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:54:58,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:54:58,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-23 09:54:58,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 47 transitions. [2018-11-23 09:54:58,906 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 47 transitions. Word has length 14 [2018-11-23 09:54:58,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:54:58,906 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 47 transitions. [2018-11-23 09:54:58,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:54:58,907 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 47 transitions. [2018-11-23 09:54:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 09:54:58,908 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:58,909 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:58,909 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:58,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:58,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1826279014, now seen corresponding path program 1 times [2018-11-23 09:54:58,911 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:58,911 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:54:58,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:54:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:58,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:54:58,985 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:54:59,052 INFO L256 TraceCheckUtils]: 0: Hoare triple {318#true} call ULTIMATE.init(); {318#true} is VALID [2018-11-23 09:54:59,053 INFO L273 TraceCheckUtils]: 1: Hoare triple {318#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {318#true} is VALID [2018-11-23 09:54:59,053 INFO L273 TraceCheckUtils]: 2: Hoare triple {318#true} assume true; {318#true} is VALID [2018-11-23 09:54:59,053 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {318#true} {318#true} #130#return; {318#true} is VALID [2018-11-23 09:54:59,053 INFO L256 TraceCheckUtils]: 4: Hoare triple {318#true} call #t~ret15 := main(); {318#true} is VALID [2018-11-23 09:54:59,055 INFO L273 TraceCheckUtils]: 5: Hoare triple {318#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {338#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:54:59,057 INFO L273 TraceCheckUtils]: 6: Hoare triple {338#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {319#false} is VALID [2018-11-23 09:54:59,057 INFO L273 TraceCheckUtils]: 7: Hoare triple {319#false} ~x~0 := 0bv32; {319#false} is VALID [2018-11-23 09:54:59,057 INFO L273 TraceCheckUtils]: 8: Hoare triple {319#false} assume !!~bvslt32(~x~0, 100000bv32);~y~0 := ~bvadd32(1bv32, ~x~0); {319#false} is VALID [2018-11-23 09:54:59,058 INFO L273 TraceCheckUtils]: 9: Hoare triple {319#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); {319#false} is VALID [2018-11-23 09:54:59,058 INFO L256 TraceCheckUtils]: 10: Hoare triple {319#false} call __VERIFIER_assert((if ~bvsle32(#t~mem13, #t~mem14) then 1bv32 else 0bv32)); {319#false} is VALID [2018-11-23 09:54:59,058 INFO L273 TraceCheckUtils]: 11: Hoare triple {319#false} ~cond := #in~cond; {319#false} is VALID [2018-11-23 09:54:59,059 INFO L273 TraceCheckUtils]: 12: Hoare triple {319#false} assume 0bv32 == ~cond; {319#false} is VALID [2018-11-23 09:54:59,060 INFO L273 TraceCheckUtils]: 13: Hoare triple {319#false} assume !false; {319#false} is VALID [2018-11-23 09:54:59,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:54:59,061 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 09:54:59,066 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:54:59,066 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:54:59,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 09:54:59,068 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:54:59,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:54:59,129 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:59,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:54:59,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:54:59,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:54:59,130 INFO L87 Difference]: Start difference. First operand 37 states and 47 transitions. Second operand 3 states. [2018-11-23 09:54:59,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,617 INFO L93 Difference]: Finished difference Result 68 states and 88 transitions. [2018-11-23 09:54:59,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:54:59,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-23 09:54:59,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:54:59,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:54:59,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 09:54:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:54:59,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2018-11-23 09:54:59,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 88 transitions. [2018-11-23 09:54:59,888 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:54:59,891 INFO L225 Difference]: With dead ends: 68 [2018-11-23 09:54:59,892 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 09:54:59,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:54:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 09:54:59,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2018-11-23 09:54:59,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:54:59,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 38 states. [2018-11-23 09:54:59,923 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 38 states. [2018-11-23 09:54:59,923 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 38 states. [2018-11-23 09:54:59,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,928 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2018-11-23 09:54:59,929 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2018-11-23 09:54:59,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:59,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:59,930 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 55 states. [2018-11-23 09:54:59,930 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 55 states. [2018-11-23 09:54:59,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:54:59,935 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2018-11-23 09:54:59,936 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 73 transitions. [2018-11-23 09:54:59,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:54:59,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:54:59,937 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:54:59,937 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:54:59,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 09:54:59,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2018-11-23 09:54:59,941 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 14 [2018-11-23 09:54:59,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:54:59,941 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2018-11-23 09:54:59,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:54:59,942 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2018-11-23 09:54:59,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 09:54:59,942 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:54:59,943 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:54:59,943 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:54:59,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:54:59,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1905148503, now seen corresponding path program 1 times [2018-11-23 09:54:59,944 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:54:59,944 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:54:59,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:55:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,025 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:00,111 INFO L256 TraceCheckUtils]: 0: Hoare triple {620#true} call ULTIMATE.init(); {620#true} is VALID [2018-11-23 09:55:00,111 INFO L273 TraceCheckUtils]: 1: Hoare triple {620#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {620#true} is VALID [2018-11-23 09:55:00,112 INFO L273 TraceCheckUtils]: 2: Hoare triple {620#true} assume true; {620#true} is VALID [2018-11-23 09:55:00,112 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {620#true} {620#true} #130#return; {620#true} is VALID [2018-11-23 09:55:00,112 INFO L256 TraceCheckUtils]: 4: Hoare triple {620#true} call #t~ret15 := main(); {620#true} is VALID [2018-11-23 09:55:00,113 INFO L273 TraceCheckUtils]: 5: Hoare triple {620#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {640#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:00,114 INFO L273 TraceCheckUtils]: 6: Hoare triple {640#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {644#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:55:00,115 INFO L273 TraceCheckUtils]: 7: Hoare triple {644#(= main_~k~0 (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {621#false} is VALID [2018-11-23 09:55:00,115 INFO L273 TraceCheckUtils]: 8: Hoare triple {621#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); {621#false} is VALID [2018-11-23 09:55:00,116 INFO L273 TraceCheckUtils]: 9: Hoare triple {621#false} ~x~0 := 0bv32; {621#false} is VALID [2018-11-23 09:55:00,116 INFO L273 TraceCheckUtils]: 10: Hoare triple {621#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {621#false} is VALID [2018-11-23 09:55:00,117 INFO L273 TraceCheckUtils]: 11: Hoare triple {621#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); {621#false} is VALID [2018-11-23 09:55:00,118 INFO L256 TraceCheckUtils]: 12: Hoare triple {621#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {621#false} is VALID [2018-11-23 09:55:00,118 INFO L273 TraceCheckUtils]: 13: Hoare triple {621#false} ~cond := #in~cond; {621#false} is VALID [2018-11-23 09:55:00,118 INFO L273 TraceCheckUtils]: 14: Hoare triple {621#false} assume 0bv32 == ~cond; {621#false} is VALID [2018-11-23 09:55:00,119 INFO L273 TraceCheckUtils]: 15: Hoare triple {621#false} assume !false; {621#false} is VALID [2018-11-23 09:55:00,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:00,120 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:55:00,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:55:00,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:55:00,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 09:55:00,125 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:00,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 09:55:00,157 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-23 09:55:00,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:55:00,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:55:00,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:55:00,159 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand 4 states. [2018-11-23 09:55:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,622 INFO L93 Difference]: Finished difference Result 89 states and 119 transitions. [2018-11-23 09:55:00,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:55:00,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 09:55:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:00,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 09:55:00,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-23 09:55:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 09:55:00,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 119 transitions. [2018-11-23 09:55:00,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 119 transitions. [2018-11-23 09:55:00,856 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:00,860 INFO L225 Difference]: With dead ends: 89 [2018-11-23 09:55:00,860 INFO L226 Difference]: Without dead ends: 58 [2018-11-23 09:55:00,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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-23 09:55:00,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-11-23 09:55:00,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 39. [2018-11-23 09:55:00,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:00,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 39 states. [2018-11-23 09:55:00,897 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 39 states. [2018-11-23 09:55:00,897 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 39 states. [2018-11-23 09:55:00,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,902 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-23 09:55:00,902 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2018-11-23 09:55:00,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,903 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 58 states. [2018-11-23 09:55:00,904 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 58 states. [2018-11-23 09:55:00,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:00,908 INFO L93 Difference]: Finished difference Result 58 states and 77 transitions. [2018-11-23 09:55:00,908 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 77 transitions. [2018-11-23 09:55:00,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:00,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:00,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:00,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:00,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 09:55:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 49 transitions. [2018-11-23 09:55:00,913 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 49 transitions. Word has length 16 [2018-11-23 09:55:00,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:00,913 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 49 transitions. [2018-11-23 09:55:00,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:55:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 49 transitions. [2018-11-23 09:55:00,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 09:55:00,914 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:00,915 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:00,915 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:00,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:00,915 INFO L82 PathProgramCache]: Analyzing trace with hash -1505214684, now seen corresponding path program 1 times [2018-11-23 09:55:00,916 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:00,916 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:00,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:55:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:00,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:01,034 INFO L256 TraceCheckUtils]: 0: Hoare triple {968#true} call ULTIMATE.init(); {968#true} is VALID [2018-11-23 09:55:01,035 INFO L273 TraceCheckUtils]: 1: Hoare triple {968#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {968#true} is VALID [2018-11-23 09:55:01,036 INFO L273 TraceCheckUtils]: 2: Hoare triple {968#true} assume true; {968#true} is VALID [2018-11-23 09:55:01,036 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {968#true} {968#true} #130#return; {968#true} is VALID [2018-11-23 09:55:01,037 INFO L256 TraceCheckUtils]: 4: Hoare triple {968#true} call #t~ret15 := main(); {968#true} is VALID [2018-11-23 09:55:01,037 INFO L273 TraceCheckUtils]: 5: Hoare triple {968#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {968#true} is VALID [2018-11-23 09:55:01,047 INFO L273 TraceCheckUtils]: 6: Hoare triple {968#true} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {991#(= main_~k~0 main_~i~0)} is VALID [2018-11-23 09:55:01,051 INFO L273 TraceCheckUtils]: 7: Hoare triple {991#(= main_~k~0 main_~i~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {991#(= main_~k~0 main_~i~0)} is VALID [2018-11-23 09:55:01,052 INFO L273 TraceCheckUtils]: 8: Hoare triple {991#(= main_~k~0 main_~i~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {998#(= main_~s~0 main_~i~0)} is VALID [2018-11-23 09:55:01,052 INFO L273 TraceCheckUtils]: 9: Hoare triple {998#(= main_~s~0 main_~i~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {998#(= main_~s~0 main_~i~0)} is VALID [2018-11-23 09:55:01,054 INFO L273 TraceCheckUtils]: 10: Hoare triple {998#(= main_~s~0 main_~i~0)} assume !~bvslt32(~k~0, 100000bv32); {998#(= main_~s~0 main_~i~0)} is VALID [2018-11-23 09:55:01,054 INFO L273 TraceCheckUtils]: 11: Hoare triple {998#(= 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); {969#false} is VALID [2018-11-23 09:55:01,055 INFO L273 TraceCheckUtils]: 12: Hoare triple {969#false} ~x~0 := 0bv32; {969#false} is VALID [2018-11-23 09:55:01,055 INFO L273 TraceCheckUtils]: 13: Hoare triple {969#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {969#false} is VALID [2018-11-23 09:55:01,055 INFO L273 TraceCheckUtils]: 14: Hoare triple {969#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); {969#false} is VALID [2018-11-23 09:55:01,055 INFO L256 TraceCheckUtils]: 15: Hoare triple {969#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {969#false} is VALID [2018-11-23 09:55:01,056 INFO L273 TraceCheckUtils]: 16: Hoare triple {969#false} ~cond := #in~cond; {969#false} is VALID [2018-11-23 09:55:01,056 INFO L273 TraceCheckUtils]: 17: Hoare triple {969#false} assume 0bv32 == ~cond; {969#false} is VALID [2018-11-23 09:55:01,057 INFO L273 TraceCheckUtils]: 18: Hoare triple {969#false} assume !false; {969#false} is VALID [2018-11-23 09:55:01,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:01,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:01,140 INFO L273 TraceCheckUtils]: 18: Hoare triple {969#false} assume !false; {969#false} is VALID [2018-11-23 09:55:01,141 INFO L273 TraceCheckUtils]: 17: Hoare triple {969#false} assume 0bv32 == ~cond; {969#false} is VALID [2018-11-23 09:55:01,141 INFO L273 TraceCheckUtils]: 16: Hoare triple {969#false} ~cond := #in~cond; {969#false} is VALID [2018-11-23 09:55:01,141 INFO L256 TraceCheckUtils]: 15: Hoare triple {969#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {969#false} is VALID [2018-11-23 09:55:01,141 INFO L273 TraceCheckUtils]: 14: Hoare triple {969#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); {969#false} is VALID [2018-11-23 09:55:01,142 INFO L273 TraceCheckUtils]: 13: Hoare triple {969#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {969#false} is VALID [2018-11-23 09:55:01,142 INFO L273 TraceCheckUtils]: 12: Hoare triple {969#false} ~x~0 := 0bv32; {969#false} is VALID [2018-11-23 09:55:01,143 INFO L273 TraceCheckUtils]: 11: Hoare triple {998#(= 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); {969#false} is VALID [2018-11-23 09:55:01,144 INFO L273 TraceCheckUtils]: 10: Hoare triple {998#(= main_~s~0 main_~i~0)} assume !~bvslt32(~k~0, 100000bv32); {998#(= main_~s~0 main_~i~0)} is VALID [2018-11-23 09:55:01,144 INFO L273 TraceCheckUtils]: 9: Hoare triple {998#(= main_~s~0 main_~i~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {998#(= main_~s~0 main_~i~0)} is VALID [2018-11-23 09:55:01,145 INFO L273 TraceCheckUtils]: 8: Hoare triple {991#(= main_~k~0 main_~i~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {998#(= main_~s~0 main_~i~0)} is VALID [2018-11-23 09:55:01,145 INFO L273 TraceCheckUtils]: 7: Hoare triple {991#(= main_~k~0 main_~i~0)} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {991#(= main_~k~0 main_~i~0)} is VALID [2018-11-23 09:55:01,146 INFO L273 TraceCheckUtils]: 6: Hoare triple {968#true} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {991#(= main_~k~0 main_~i~0)} is VALID [2018-11-23 09:55:01,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {968#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {968#true} is VALID [2018-11-23 09:55:01,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {968#true} call #t~ret15 := main(); {968#true} is VALID [2018-11-23 09:55:01,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {968#true} {968#true} #130#return; {968#true} is VALID [2018-11-23 09:55:01,148 INFO L273 TraceCheckUtils]: 2: Hoare triple {968#true} assume true; {968#true} is VALID [2018-11-23 09:55:01,148 INFO L273 TraceCheckUtils]: 1: Hoare triple {968#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {968#true} is VALID [2018-11-23 09:55:01,149 INFO L256 TraceCheckUtils]: 0: Hoare triple {968#true} call ULTIMATE.init(); {968#true} is VALID [2018-11-23 09:55:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:01,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:01,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 09:55:01,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 09:55:01,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:01,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 09:55:01,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:01,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:55:01,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:55:01,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:55:01,210 INFO L87 Difference]: Start difference. First operand 39 states and 49 transitions. Second operand 4 states. [2018-11-23 09:55:01,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:01,986 INFO L93 Difference]: Finished difference Result 118 states and 159 transitions. [2018-11-23 09:55:01,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 09:55:01,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-11-23 09:55:01,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:01,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 09:55:01,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2018-11-23 09:55:01,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 09:55:01,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2018-11-23 09:55:01,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 157 transitions. [2018-11-23 09:55:02,272 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:02,276 INFO L225 Difference]: With dead ends: 118 [2018-11-23 09:55:02,276 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 09:55:02,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 35 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-23 09:55:02,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 09:55:02,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 45. [2018-11-23 09:55:02,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:02,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand 45 states. [2018-11-23 09:55:02,307 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand 45 states. [2018-11-23 09:55:02,307 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 45 states. [2018-11-23 09:55:02,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:02,313 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2018-11-23 09:55:02,313 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2018-11-23 09:55:02,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:02,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:02,315 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 87 states. [2018-11-23 09:55:02,315 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 87 states. [2018-11-23 09:55:02,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:02,320 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2018-11-23 09:55:02,321 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2018-11-23 09:55:02,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:02,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:02,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:02,322 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:02,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 09:55:02,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 59 transitions. [2018-11-23 09:55:02,325 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 59 transitions. Word has length 19 [2018-11-23 09:55:02,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:02,326 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 59 transitions. [2018-11-23 09:55:02,326 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:55:02,326 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 59 transitions. [2018-11-23 09:55:02,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 09:55:02,327 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:02,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:02,327 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:02,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:02,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1980405986, now seen corresponding path program 1 times [2018-11-23 09:55:02,328 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:02,328 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:02,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:55:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:02,408 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:02,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {1488#true} call ULTIMATE.init(); {1488#true} is VALID [2018-11-23 09:55:02,490 INFO L273 TraceCheckUtils]: 1: Hoare triple {1488#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1488#true} is VALID [2018-11-23 09:55:02,490 INFO L273 TraceCheckUtils]: 2: Hoare triple {1488#true} assume true; {1488#true} is VALID [2018-11-23 09:55:02,491 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1488#true} {1488#true} #130#return; {1488#true} is VALID [2018-11-23 09:55:02,492 INFO L256 TraceCheckUtils]: 4: Hoare triple {1488#true} call #t~ret15 := main(); {1488#true} is VALID [2018-11-23 09:55:02,499 INFO L273 TraceCheckUtils]: 5: Hoare triple {1488#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {1508#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:02,501 INFO L273 TraceCheckUtils]: 6: Hoare triple {1508#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {1512#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:55:02,504 INFO L273 TraceCheckUtils]: 7: Hoare triple {1512#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {1512#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:55:02,504 INFO L273 TraceCheckUtils]: 8: Hoare triple {1512#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1512#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:55:02,507 INFO L273 TraceCheckUtils]: 9: Hoare triple {1512#(= main_~k~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {1522#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:02,507 INFO L273 TraceCheckUtils]: 10: Hoare triple {1522#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {1489#false} is VALID [2018-11-23 09:55:02,508 INFO L273 TraceCheckUtils]: 11: Hoare triple {1489#false} assume !(~s~0 != ~i~0); {1489#false} is VALID [2018-11-23 09:55:02,508 INFO L273 TraceCheckUtils]: 12: Hoare triple {1489#false} ~x~0 := 0bv32; {1489#false} is VALID [2018-11-23 09:55:02,508 INFO L273 TraceCheckUtils]: 13: Hoare triple {1489#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {1489#false} is VALID [2018-11-23 09:55:02,508 INFO L273 TraceCheckUtils]: 14: Hoare triple {1489#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); {1489#false} is VALID [2018-11-23 09:55:02,509 INFO L256 TraceCheckUtils]: 15: Hoare triple {1489#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {1489#false} is VALID [2018-11-23 09:55:02,509 INFO L273 TraceCheckUtils]: 16: Hoare triple {1489#false} ~cond := #in~cond; {1489#false} is VALID [2018-11-23 09:55:02,509 INFO L273 TraceCheckUtils]: 17: Hoare triple {1489#false} assume 0bv32 == ~cond; {1489#false} is VALID [2018-11-23 09:55:02,509 INFO L273 TraceCheckUtils]: 18: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2018-11-23 09:55:02,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:02,510 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:02,594 INFO L273 TraceCheckUtils]: 18: Hoare triple {1489#false} assume !false; {1489#false} is VALID [2018-11-23 09:55:02,594 INFO L273 TraceCheckUtils]: 17: Hoare triple {1489#false} assume 0bv32 == ~cond; {1489#false} is VALID [2018-11-23 09:55:02,595 INFO L273 TraceCheckUtils]: 16: Hoare triple {1489#false} ~cond := #in~cond; {1489#false} is VALID [2018-11-23 09:55:02,595 INFO L256 TraceCheckUtils]: 15: Hoare triple {1489#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {1489#false} is VALID [2018-11-23 09:55:02,595 INFO L273 TraceCheckUtils]: 14: Hoare triple {1489#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); {1489#false} is VALID [2018-11-23 09:55:02,596 INFO L273 TraceCheckUtils]: 13: Hoare triple {1489#false} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {1489#false} is VALID [2018-11-23 09:55:02,596 INFO L273 TraceCheckUtils]: 12: Hoare triple {1489#false} ~x~0 := 0bv32; {1489#false} is VALID [2018-11-23 09:55:02,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {1489#false} assume !(~s~0 != ~i~0); {1489#false} is VALID [2018-11-23 09:55:02,601 INFO L273 TraceCheckUtils]: 10: Hoare triple {1574#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {1489#false} is VALID [2018-11-23 09:55:02,603 INFO L273 TraceCheckUtils]: 9: Hoare triple {1578#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {1574#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:02,603 INFO L273 TraceCheckUtils]: 8: Hoare triple {1578#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {1578#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,604 INFO L273 TraceCheckUtils]: 7: Hoare triple {1578#(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); {1578#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,616 INFO L273 TraceCheckUtils]: 6: Hoare triple {1588#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {1578#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,617 INFO L273 TraceCheckUtils]: 5: Hoare triple {1488#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {1588#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:02,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {1488#true} call #t~ret15 := main(); {1488#true} is VALID [2018-11-23 09:55:02,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1488#true} {1488#true} #130#return; {1488#true} is VALID [2018-11-23 09:55:02,617 INFO L273 TraceCheckUtils]: 2: Hoare triple {1488#true} assume true; {1488#true} is VALID [2018-11-23 09:55:02,618 INFO L273 TraceCheckUtils]: 1: Hoare triple {1488#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1488#true} is VALID [2018-11-23 09:55:02,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {1488#true} call ULTIMATE.init(); {1488#true} is VALID [2018-11-23 09:55:02,619 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:02,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:02,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 09:55:02,621 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 09:55:02,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:02,621 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 09:55:02,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:02,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 09:55:02,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 09:55:02,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-11-23 09:55:02,657 INFO L87 Difference]: Start difference. First operand 45 states and 59 transitions. Second operand 8 states. [2018-11-23 09:55:03,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:03,967 INFO L93 Difference]: Finished difference Result 155 states and 221 transitions. [2018-11-23 09:55:03,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 09:55:03,968 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-23 09:55:03,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:03,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 09:55:03,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2018-11-23 09:55:03,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 09:55:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 175 transitions. [2018-11-23 09:55:03,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 175 transitions. [2018-11-23 09:55:04,332 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:04,336 INFO L225 Difference]: With dead ends: 155 [2018-11-23 09:55:04,337 INFO L226 Difference]: Without dead ends: 118 [2018-11-23 09:55:04,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 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-23 09:55:04,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-11-23 09:55:04,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2018-11-23 09:55:04,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:04,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand 90 states. [2018-11-23 09:55:04,419 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand 90 states. [2018-11-23 09:55:04,419 INFO L87 Difference]: Start difference. First operand 118 states. Second operand 90 states. [2018-11-23 09:55:04,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:04,426 INFO L93 Difference]: Finished difference Result 118 states and 160 transitions. [2018-11-23 09:55:04,427 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 160 transitions. [2018-11-23 09:55:04,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:04,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:04,428 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 118 states. [2018-11-23 09:55:04,428 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 118 states. [2018-11-23 09:55:04,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:04,434 INFO L93 Difference]: Finished difference Result 118 states and 160 transitions. [2018-11-23 09:55:04,434 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 160 transitions. [2018-11-23 09:55:04,435 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:04,435 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:04,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:04,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:04,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 09:55:04,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 120 transitions. [2018-11-23 09:55:04,440 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 120 transitions. Word has length 19 [2018-11-23 09:55:04,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:04,440 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 120 transitions. [2018-11-23 09:55:04,441 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 09:55:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 120 transitions. [2018-11-23 09:55:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-11-23 09:55:04,442 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:04,442 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:04,442 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:04,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:04,442 INFO L82 PathProgramCache]: Analyzing trace with hash 965884393, now seen corresponding path program 2 times [2018-11-23 09:55:04,443 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:04,443 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:04,465 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:04,499 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 09:55:04,500 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:04,515 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:04,618 INFO L256 TraceCheckUtils]: 0: Hoare triple {2197#true} call ULTIMATE.init(); {2197#true} is VALID [2018-11-23 09:55:04,619 INFO L273 TraceCheckUtils]: 1: Hoare triple {2197#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2197#true} is VALID [2018-11-23 09:55:04,619 INFO L273 TraceCheckUtils]: 2: Hoare triple {2197#true} assume true; {2197#true} is VALID [2018-11-23 09:55:04,619 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2197#true} {2197#true} #130#return; {2197#true} is VALID [2018-11-23 09:55:04,620 INFO L256 TraceCheckUtils]: 4: Hoare triple {2197#true} call #t~ret15 := main(); {2197#true} is VALID [2018-11-23 09:55:04,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {2197#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,636 INFO L273 TraceCheckUtils]: 6: Hoare triple {2217#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,637 INFO L273 TraceCheckUtils]: 7: Hoare triple {2217#(= 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); {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,640 INFO L273 TraceCheckUtils]: 8: Hoare triple {2217#(= main_~i~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,641 INFO L273 TraceCheckUtils]: 9: Hoare triple {2217#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,642 INFO L273 TraceCheckUtils]: 10: Hoare triple {2217#(= 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); {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,643 INFO L273 TraceCheckUtils]: 11: Hoare triple {2217#(= main_~i~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,643 INFO L273 TraceCheckUtils]: 12: Hoare triple {2217#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,644 INFO L273 TraceCheckUtils]: 13: Hoare triple {2217#(= 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); {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,645 INFO L273 TraceCheckUtils]: 14: Hoare triple {2217#(= main_~i~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,646 INFO L273 TraceCheckUtils]: 15: Hoare triple {2217#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,646 INFO L273 TraceCheckUtils]: 16: Hoare triple {2217#(= 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); {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,648 INFO L273 TraceCheckUtils]: 17: Hoare triple {2217#(= main_~i~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,648 INFO L273 TraceCheckUtils]: 18: Hoare triple {2217#(= main_~i~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,650 INFO L273 TraceCheckUtils]: 19: Hoare triple {2217#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,650 INFO L273 TraceCheckUtils]: 20: Hoare triple {2217#(= 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); {2217#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:04,652 INFO L273 TraceCheckUtils]: 21: Hoare triple {2217#(= main_~i~0 (_ bv0 32))} ~x~0 := 0bv32; {2266#(and (= main_~x~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:04,655 INFO L273 TraceCheckUtils]: 22: Hoare triple {2266#(and (= main_~x~0 (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~x~0, ~i~0);~y~0 := ~bvadd32(1bv32, ~x~0); {2198#false} is VALID [2018-11-23 09:55:04,655 INFO L273 TraceCheckUtils]: 23: Hoare triple {2198#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); {2198#false} is VALID [2018-11-23 09:55:04,656 INFO L256 TraceCheckUtils]: 24: Hoare triple {2198#false} call __VERIFIER_assert((if ~bvsle32(#t~mem6, #t~mem7) then 1bv32 else 0bv32)); {2198#false} is VALID [2018-11-23 09:55:04,656 INFO L273 TraceCheckUtils]: 25: Hoare triple {2198#false} ~cond := #in~cond; {2198#false} is VALID [2018-11-23 09:55:04,656 INFO L273 TraceCheckUtils]: 26: Hoare triple {2198#false} assume 0bv32 == ~cond; {2198#false} is VALID [2018-11-23 09:55:04,657 INFO L273 TraceCheckUtils]: 27: Hoare triple {2198#false} assume !false; {2198#false} is VALID [2018-11-23 09:55:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-11-23 09:55:04,660 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:55:04,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:55:04,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 09:55:04,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 09:55:04,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:04,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 09:55:04,716 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:04,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 09:55:04,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 09:55:04,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 09:55:04,717 INFO L87 Difference]: Start difference. First operand 90 states and 120 transitions. Second operand 4 states. [2018-11-23 09:55:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:05,061 INFO L93 Difference]: Finished difference Result 141 states and 189 transitions. [2018-11-23 09:55:05,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 09:55:05,061 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2018-11-23 09:55:05,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 09:55:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2018-11-23 09:55:05,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 09:55:05,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 107 transitions. [2018-11-23 09:55:05,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 107 transitions. [2018-11-23 09:55:05,258 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:05,261 INFO L225 Difference]: With dead ends: 141 [2018-11-23 09:55:05,261 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 09:55:05,262 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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-23 09:55:05,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 09:55:05,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-11-23 09:55:05,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:05,348 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand 85 states. [2018-11-23 09:55:05,348 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2018-11-23 09:55:05,348 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2018-11-23 09:55:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:05,353 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2018-11-23 09:55:05,353 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2018-11-23 09:55:05,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:05,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:05,354 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand 85 states. [2018-11-23 09:55:05,354 INFO L87 Difference]: Start difference. First operand 85 states. Second operand 85 states. [2018-11-23 09:55:05,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:05,357 INFO L93 Difference]: Finished difference Result 85 states and 112 transitions. [2018-11-23 09:55:05,357 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2018-11-23 09:55:05,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:05,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:05,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:05,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-11-23 09:55:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 112 transitions. [2018-11-23 09:55:05,362 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 112 transitions. Word has length 28 [2018-11-23 09:55:05,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:05,362 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 112 transitions. [2018-11-23 09:55:05,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 09:55:05,362 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 112 transitions. [2018-11-23 09:55:05,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 09:55:05,363 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:05,363 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:05,363 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:05,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:05,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1605949511, now seen corresponding path program 1 times [2018-11-23 09:55:05,364 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:05,364 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:05,393 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:55:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:05,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:05,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:05,595 INFO L256 TraceCheckUtils]: 0: Hoare triple {2770#true} call ULTIMATE.init(); {2770#true} is VALID [2018-11-23 09:55:05,595 INFO L273 TraceCheckUtils]: 1: Hoare triple {2770#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2770#true} is VALID [2018-11-23 09:55:05,595 INFO L273 TraceCheckUtils]: 2: Hoare triple {2770#true} assume true; {2770#true} is VALID [2018-11-23 09:55:05,596 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2770#true} {2770#true} #130#return; {2770#true} is VALID [2018-11-23 09:55:05,596 INFO L256 TraceCheckUtils]: 4: Hoare triple {2770#true} call #t~ret15 := main(); {2770#true} is VALID [2018-11-23 09:55:05,597 INFO L273 TraceCheckUtils]: 5: Hoare triple {2770#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {2790#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:05,597 INFO L273 TraceCheckUtils]: 6: Hoare triple {2790#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {2794#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:55:05,598 INFO L273 TraceCheckUtils]: 7: Hoare triple {2794#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {2794#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:55:05,617 INFO L273 TraceCheckUtils]: 8: Hoare triple {2794#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2794#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:55:05,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {2794#(= main_~k~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2804#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,638 INFO L273 TraceCheckUtils]: 10: Hoare triple {2804#(= (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); {2804#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,639 INFO L273 TraceCheckUtils]: 11: Hoare triple {2804#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2804#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,639 INFO L273 TraceCheckUtils]: 12: Hoare triple {2804#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2814#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:55:05,640 INFO L273 TraceCheckUtils]: 13: Hoare triple {2814#(= (_ 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); {2814#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:55:05,640 INFO L273 TraceCheckUtils]: 14: Hoare triple {2814#(= (_ bv2 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2814#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:55:05,641 INFO L273 TraceCheckUtils]: 15: Hoare triple {2814#(= (_ bv2 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {2824#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,641 INFO L273 TraceCheckUtils]: 16: Hoare triple {2824#(= (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); {2824#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,641 INFO L273 TraceCheckUtils]: 17: Hoare triple {2824#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2824#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,642 INFO L273 TraceCheckUtils]: 18: Hoare triple {2824#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2834#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:05,643 INFO L273 TraceCheckUtils]: 19: Hoare triple {2834#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {2771#false} is VALID [2018-11-23 09:55:05,643 INFO L273 TraceCheckUtils]: 20: Hoare triple {2771#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); {2771#false} is VALID [2018-11-23 09:55:05,644 INFO L273 TraceCheckUtils]: 21: Hoare triple {2771#false} ~x~0 := 0bv32; {2771#false} is VALID [2018-11-23 09:55:05,644 INFO L273 TraceCheckUtils]: 22: Hoare triple {2771#false} assume !~bvslt32(~x~0, ~i~0); {2771#false} is VALID [2018-11-23 09:55:05,644 INFO L273 TraceCheckUtils]: 23: Hoare triple {2771#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {2771#false} is VALID [2018-11-23 09:55:05,644 INFO L273 TraceCheckUtils]: 24: Hoare triple {2771#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); {2771#false} is VALID [2018-11-23 09:55:05,645 INFO L256 TraceCheckUtils]: 25: Hoare triple {2771#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {2771#false} is VALID [2018-11-23 09:55:05,645 INFO L273 TraceCheckUtils]: 26: Hoare triple {2771#false} ~cond := #in~cond; {2771#false} is VALID [2018-11-23 09:55:05,645 INFO L273 TraceCheckUtils]: 27: Hoare triple {2771#false} assume 0bv32 == ~cond; {2771#false} is VALID [2018-11-23 09:55:05,645 INFO L273 TraceCheckUtils]: 28: Hoare triple {2771#false} assume !false; {2771#false} is VALID [2018-11-23 09:55:05,647 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:05,647 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:05,831 INFO L273 TraceCheckUtils]: 28: Hoare triple {2771#false} assume !false; {2771#false} is VALID [2018-11-23 09:55:05,831 INFO L273 TraceCheckUtils]: 27: Hoare triple {2771#false} assume 0bv32 == ~cond; {2771#false} is VALID [2018-11-23 09:55:05,832 INFO L273 TraceCheckUtils]: 26: Hoare triple {2771#false} ~cond := #in~cond; {2771#false} is VALID [2018-11-23 09:55:05,832 INFO L256 TraceCheckUtils]: 25: Hoare triple {2771#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {2771#false} is VALID [2018-11-23 09:55:05,832 INFO L273 TraceCheckUtils]: 24: Hoare triple {2771#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); {2771#false} is VALID [2018-11-23 09:55:05,833 INFO L273 TraceCheckUtils]: 23: Hoare triple {2771#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {2771#false} is VALID [2018-11-23 09:55:05,833 INFO L273 TraceCheckUtils]: 22: Hoare triple {2771#false} assume !~bvslt32(~x~0, ~i~0); {2771#false} is VALID [2018-11-23 09:55:05,833 INFO L273 TraceCheckUtils]: 21: Hoare triple {2771#false} ~x~0 := 0bv32; {2771#false} is VALID [2018-11-23 09:55:05,833 INFO L273 TraceCheckUtils]: 20: Hoare triple {2771#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); {2771#false} is VALID [2018-11-23 09:55:05,833 INFO L273 TraceCheckUtils]: 19: Hoare triple {2892#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {2771#false} is VALID [2018-11-23 09:55:05,834 INFO L273 TraceCheckUtils]: 18: Hoare triple {2896#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2892#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:05,836 INFO L273 TraceCheckUtils]: 17: Hoare triple {2896#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2896#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,836 INFO L273 TraceCheckUtils]: 16: Hoare triple {2896#(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); {2896#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,841 INFO L273 TraceCheckUtils]: 15: Hoare triple {2906#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2896#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,841 INFO L273 TraceCheckUtils]: 14: Hoare triple {2906#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2906#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,842 INFO L273 TraceCheckUtils]: 13: Hoare triple {2906#(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); {2906#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,850 INFO L273 TraceCheckUtils]: 12: Hoare triple {2916#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2906#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,851 INFO L273 TraceCheckUtils]: 11: Hoare triple {2916#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2916#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,851 INFO L273 TraceCheckUtils]: 10: Hoare triple {2916#(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); {2916#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,858 INFO L273 TraceCheckUtils]: 9: Hoare triple {2926#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {2916#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,858 INFO L273 TraceCheckUtils]: 8: Hoare triple {2926#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {2926#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,859 INFO L273 TraceCheckUtils]: 7: Hoare triple {2926#(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); {2926#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,859 INFO L273 TraceCheckUtils]: 6: Hoare triple {2936#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {2926#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,860 INFO L273 TraceCheckUtils]: 5: Hoare triple {2770#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {2936#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:05,860 INFO L256 TraceCheckUtils]: 4: Hoare triple {2770#true} call #t~ret15 := main(); {2770#true} is VALID [2018-11-23 09:55:05,860 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2770#true} {2770#true} #130#return; {2770#true} is VALID [2018-11-23 09:55:05,860 INFO L273 TraceCheckUtils]: 2: Hoare triple {2770#true} assume true; {2770#true} is VALID [2018-11-23 09:55:05,860 INFO L273 TraceCheckUtils]: 1: Hoare triple {2770#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2770#true} is VALID [2018-11-23 09:55:05,861 INFO L256 TraceCheckUtils]: 0: Hoare triple {2770#true} call ULTIMATE.init(); {2770#true} is VALID [2018-11-23 09:55:05,863 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:05,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:05,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2018-11-23 09:55:05,866 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-23 09:55:05,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:05,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states. [2018-11-23 09:55:05,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:05,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 09:55:05,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 09:55:05,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-23 09:55:05,941 INFO L87 Difference]: Start difference. First operand 85 states and 112 transitions. Second operand 14 states. [2018-11-23 09:55:08,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:08,555 INFO L93 Difference]: Finished difference Result 221 states and 314 transitions. [2018-11-23 09:55:08,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 09:55:08,555 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 29 [2018-11-23 09:55:08,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:08,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 09:55:08,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 206 transitions. [2018-11-23 09:55:08,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 09:55:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 206 transitions. [2018-11-23 09:55:08,563 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 206 transitions. [2018-11-23 09:55:09,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:09,220 INFO L225 Difference]: With dead ends: 221 [2018-11-23 09:55:09,220 INFO L226 Difference]: Without dead ends: 167 [2018-11-23 09:55:09,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=251, Invalid=561, Unknown=0, NotChecked=0, Total=812 [2018-11-23 09:55:09,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-11-23 09:55:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2018-11-23 09:55:09,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:09,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand 139 states. [2018-11-23 09:55:09,300 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand 139 states. [2018-11-23 09:55:09,300 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 139 states. [2018-11-23 09:55:09,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:09,306 INFO L93 Difference]: Finished difference Result 167 states and 224 transitions. [2018-11-23 09:55:09,306 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 224 transitions. [2018-11-23 09:55:09,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:09,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:09,307 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand 167 states. [2018-11-23 09:55:09,307 INFO L87 Difference]: Start difference. First operand 139 states. Second operand 167 states. [2018-11-23 09:55:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:09,314 INFO L93 Difference]: Finished difference Result 167 states and 224 transitions. [2018-11-23 09:55:09,314 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 224 transitions. [2018-11-23 09:55:09,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:09,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:09,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:09,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:09,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-11-23 09:55:09,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 184 transitions. [2018-11-23 09:55:09,320 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 184 transitions. Word has length 29 [2018-11-23 09:55:09,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:09,320 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 184 transitions. [2018-11-23 09:55:09,320 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 09:55:09,321 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 184 transitions. [2018-11-23 09:55:09,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 09:55:09,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:09,322 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:09,322 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:09,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:09,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1339551065, now seen corresponding path program 2 times [2018-11-23 09:55:09,323 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:09,323 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:55:09,351 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:55:09,463 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:55:09,464 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:09,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:09,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:09,775 INFO L256 TraceCheckUtils]: 0: Hoare triple {3815#true} call ULTIMATE.init(); {3815#true} is VALID [2018-11-23 09:55:09,775 INFO L273 TraceCheckUtils]: 1: Hoare triple {3815#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3815#true} is VALID [2018-11-23 09:55:09,776 INFO L273 TraceCheckUtils]: 2: Hoare triple {3815#true} assume true; {3815#true} is VALID [2018-11-23 09:55:09,776 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3815#true} {3815#true} #130#return; {3815#true} is VALID [2018-11-23 09:55:09,776 INFO L256 TraceCheckUtils]: 4: Hoare triple {3815#true} call #t~ret15 := main(); {3815#true} is VALID [2018-11-23 09:55:09,777 INFO L273 TraceCheckUtils]: 5: Hoare triple {3815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {3835#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:55:09,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {3835#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {3839#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:55:09,778 INFO L273 TraceCheckUtils]: 7: Hoare triple {3839#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {3839#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:55:09,779 INFO L273 TraceCheckUtils]: 8: Hoare triple {3839#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3839#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:55:09,779 INFO L273 TraceCheckUtils]: 9: Hoare triple {3839#(= main_~k~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3849#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,780 INFO L273 TraceCheckUtils]: 10: Hoare triple {3849#(= (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); {3849#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,784 INFO L273 TraceCheckUtils]: 11: Hoare triple {3849#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3849#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,784 INFO L273 TraceCheckUtils]: 12: Hoare triple {3849#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3859#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:55:09,785 INFO L273 TraceCheckUtils]: 13: Hoare triple {3859#(= (_ 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); {3859#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:55:09,785 INFO L273 TraceCheckUtils]: 14: Hoare triple {3859#(= (_ bv2 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3859#(= (_ bv2 32) main_~k~0)} is VALID [2018-11-23 09:55:09,786 INFO L273 TraceCheckUtils]: 15: Hoare triple {3859#(= (_ bv2 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {3869#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,786 INFO L273 TraceCheckUtils]: 16: Hoare triple {3869#(= (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); {3869#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,787 INFO L273 TraceCheckUtils]: 17: Hoare triple {3869#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3869#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,787 INFO L273 TraceCheckUtils]: 18: Hoare triple {3869#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3879#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,788 INFO L273 TraceCheckUtils]: 19: Hoare triple {3879#(= (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); {3879#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,788 INFO L273 TraceCheckUtils]: 20: Hoare triple {3879#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3879#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,789 INFO L273 TraceCheckUtils]: 21: Hoare triple {3879#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3889#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,790 INFO L273 TraceCheckUtils]: 22: Hoare triple {3889#(= (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); {3889#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,790 INFO L273 TraceCheckUtils]: 23: Hoare triple {3889#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3889#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,791 INFO L273 TraceCheckUtils]: 24: Hoare triple {3889#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3899#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:55:09,792 INFO L273 TraceCheckUtils]: 25: Hoare triple {3899#(= (_ 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); {3899#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:55:09,793 INFO L273 TraceCheckUtils]: 26: Hoare triple {3899#(= (_ bv6 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3899#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:55:09,794 INFO L273 TraceCheckUtils]: 27: Hoare triple {3899#(= (_ bv6 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {3909#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,794 INFO L273 TraceCheckUtils]: 28: Hoare triple {3909#(= (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); {3909#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,794 INFO L273 TraceCheckUtils]: 29: Hoare triple {3909#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3909#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,795 INFO L273 TraceCheckUtils]: 30: Hoare triple {3909#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3919#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,795 INFO L273 TraceCheckUtils]: 31: Hoare triple {3919#(= (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); {3919#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,796 INFO L273 TraceCheckUtils]: 32: Hoare triple {3919#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3919#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,796 INFO L273 TraceCheckUtils]: 33: Hoare triple {3919#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3929#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 09:55:09,797 INFO L273 TraceCheckUtils]: 34: Hoare triple {3929#(= (_ 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); {3929#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 09:55:09,797 INFO L273 TraceCheckUtils]: 35: Hoare triple {3929#(= (_ bv9 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {3929#(= (_ bv9 32) main_~k~0)} is VALID [2018-11-23 09:55:09,798 INFO L273 TraceCheckUtils]: 36: Hoare triple {3929#(= (_ bv9 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {3939#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:55:09,799 INFO L273 TraceCheckUtils]: 37: Hoare triple {3939#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {3816#false} is VALID [2018-11-23 09:55:09,799 INFO L273 TraceCheckUtils]: 38: Hoare triple {3816#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); {3816#false} is VALID [2018-11-23 09:55:09,799 INFO L273 TraceCheckUtils]: 39: Hoare triple {3816#false} ~x~0 := 0bv32; {3816#false} is VALID [2018-11-23 09:55:09,800 INFO L273 TraceCheckUtils]: 40: Hoare triple {3816#false} assume !~bvslt32(~x~0, ~i~0); {3816#false} is VALID [2018-11-23 09:55:09,800 INFO L273 TraceCheckUtils]: 41: Hoare triple {3816#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {3816#false} is VALID [2018-11-23 09:55:09,800 INFO L273 TraceCheckUtils]: 42: Hoare triple {3816#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); {3816#false} is VALID [2018-11-23 09:55:09,800 INFO L256 TraceCheckUtils]: 43: Hoare triple {3816#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {3816#false} is VALID [2018-11-23 09:55:09,801 INFO L273 TraceCheckUtils]: 44: Hoare triple {3816#false} ~cond := #in~cond; {3816#false} is VALID [2018-11-23 09:55:09,801 INFO L273 TraceCheckUtils]: 45: Hoare triple {3816#false} assume 0bv32 == ~cond; {3816#false} is VALID [2018-11-23 09:55:09,801 INFO L273 TraceCheckUtils]: 46: Hoare triple {3816#false} assume !false; {3816#false} is VALID [2018-11-23 09:55:09,804 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:09,805 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:10,348 INFO L273 TraceCheckUtils]: 46: Hoare triple {3816#false} assume !false; {3816#false} is VALID [2018-11-23 09:55:10,349 INFO L273 TraceCheckUtils]: 45: Hoare triple {3816#false} assume 0bv32 == ~cond; {3816#false} is VALID [2018-11-23 09:55:10,349 INFO L273 TraceCheckUtils]: 44: Hoare triple {3816#false} ~cond := #in~cond; {3816#false} is VALID [2018-11-23 09:55:10,349 INFO L256 TraceCheckUtils]: 43: Hoare triple {3816#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {3816#false} is VALID [2018-11-23 09:55:10,350 INFO L273 TraceCheckUtils]: 42: Hoare triple {3816#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); {3816#false} is VALID [2018-11-23 09:55:10,350 INFO L273 TraceCheckUtils]: 41: Hoare triple {3816#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {3816#false} is VALID [2018-11-23 09:55:10,351 INFO L273 TraceCheckUtils]: 40: Hoare triple {3816#false} assume !~bvslt32(~x~0, ~i~0); {3816#false} is VALID [2018-11-23 09:55:10,351 INFO L273 TraceCheckUtils]: 39: Hoare triple {3816#false} ~x~0 := 0bv32; {3816#false} is VALID [2018-11-23 09:55:10,351 INFO L273 TraceCheckUtils]: 38: Hoare triple {3816#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); {3816#false} is VALID [2018-11-23 09:55:10,353 INFO L273 TraceCheckUtils]: 37: Hoare triple {3997#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {3816#false} is VALID [2018-11-23 09:55:10,355 INFO L273 TraceCheckUtils]: 36: Hoare triple {4001#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {3997#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-23 09:55:10,355 INFO L273 TraceCheckUtils]: 35: Hoare triple {4001#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4001#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,355 INFO L273 TraceCheckUtils]: 34: Hoare triple {4001#(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); {4001#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,360 INFO L273 TraceCheckUtils]: 33: Hoare triple {4011#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4001#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,362 INFO L273 TraceCheckUtils]: 32: Hoare triple {4011#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4011#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,362 INFO L273 TraceCheckUtils]: 31: Hoare triple {4011#(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); {4011#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,369 INFO L273 TraceCheckUtils]: 30: Hoare triple {4021#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4011#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,377 INFO L273 TraceCheckUtils]: 29: Hoare triple {4021#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4021#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,377 INFO L273 TraceCheckUtils]: 28: Hoare triple {4021#(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); {4021#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,383 INFO L273 TraceCheckUtils]: 27: Hoare triple {4031#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4021#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,384 INFO L273 TraceCheckUtils]: 26: Hoare triple {4031#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4031#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,384 INFO L273 TraceCheckUtils]: 25: Hoare triple {4031#(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); {4031#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,390 INFO L273 TraceCheckUtils]: 24: Hoare triple {4041#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4031#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,391 INFO L273 TraceCheckUtils]: 23: Hoare triple {4041#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4041#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,391 INFO L273 TraceCheckUtils]: 22: Hoare triple {4041#(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); {4041#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,399 INFO L273 TraceCheckUtils]: 21: Hoare triple {4051#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4041#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,399 INFO L273 TraceCheckUtils]: 20: Hoare triple {4051#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4051#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,399 INFO L273 TraceCheckUtils]: 19: Hoare triple {4051#(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); {4051#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,404 INFO L273 TraceCheckUtils]: 18: Hoare triple {4061#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4051#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,405 INFO L273 TraceCheckUtils]: 17: Hoare triple {4061#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4061#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,405 INFO L273 TraceCheckUtils]: 16: Hoare triple {4061#(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); {4061#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,411 INFO L273 TraceCheckUtils]: 15: Hoare triple {4071#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4061#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,411 INFO L273 TraceCheckUtils]: 14: Hoare triple {4071#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4071#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {4071#(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); {4071#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,417 INFO L273 TraceCheckUtils]: 12: Hoare triple {4081#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4071#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,418 INFO L273 TraceCheckUtils]: 11: Hoare triple {4081#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4081#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,418 INFO L273 TraceCheckUtils]: 10: Hoare triple {4081#(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); {4081#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,426 INFO L273 TraceCheckUtils]: 9: Hoare triple {4091#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {4081#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,427 INFO L273 TraceCheckUtils]: 8: Hoare triple {4091#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {4091#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,427 INFO L273 TraceCheckUtils]: 7: Hoare triple {4091#(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); {4091#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,429 INFO L273 TraceCheckUtils]: 6: Hoare triple {4101#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {4091#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,429 INFO L273 TraceCheckUtils]: 5: Hoare triple {3815#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {4101#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:55:10,429 INFO L256 TraceCheckUtils]: 4: Hoare triple {3815#true} call #t~ret15 := main(); {3815#true} is VALID [2018-11-23 09:55:10,430 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3815#true} {3815#true} #130#return; {3815#true} is VALID [2018-11-23 09:55:10,430 INFO L273 TraceCheckUtils]: 2: Hoare triple {3815#true} assume true; {3815#true} is VALID [2018-11-23 09:55:10,430 INFO L273 TraceCheckUtils]: 1: Hoare triple {3815#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3815#true} is VALID [2018-11-23 09:55:10,430 INFO L256 TraceCheckUtils]: 0: Hoare triple {3815#true} call ULTIMATE.init(); {3815#true} is VALID [2018-11-23 09:55:10,434 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:55:10,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:10,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2018-11-23 09:55:10,437 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2018-11-23 09:55:10,438 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:10,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states. [2018-11-23 09:55:10,606 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:10,606 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-11-23 09:55:10,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-11-23 09:55:10,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=479, Unknown=0, NotChecked=0, Total=650 [2018-11-23 09:55:10,607 INFO L87 Difference]: Start difference. First operand 139 states and 184 transitions. Second operand 26 states. [2018-11-23 09:55:16,286 WARN L180 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 10 [2018-11-23 09:55:19,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:19,816 INFO L93 Difference]: Finished difference Result 347 states and 500 transitions. [2018-11-23 09:55:19,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-11-23 09:55:19,816 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 47 [2018-11-23 09:55:19,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:19,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 09:55:19,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 287 transitions. [2018-11-23 09:55:19,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 09:55:19,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 287 transitions. [2018-11-23 09:55:19,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 38 states and 287 transitions. [2018-11-23 09:55:20,389 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:20,396 INFO L225 Difference]: With dead ends: 347 [2018-11-23 09:55:20,396 INFO L226 Difference]: Without dead ends: 275 [2018-11-23 09:55:20,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=974, Invalid=2448, Unknown=0, NotChecked=0, Total=3422 [2018-11-23 09:55:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-11-23 09:55:20,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 247. [2018-11-23 09:55:20,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:20,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand 247 states. [2018-11-23 09:55:20,653 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand 247 states. [2018-11-23 09:55:20,654 INFO L87 Difference]: Start difference. First operand 275 states. Second operand 247 states. [2018-11-23 09:55:20,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:20,665 INFO L93 Difference]: Finished difference Result 275 states and 368 transitions. [2018-11-23 09:55:20,665 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 368 transitions. [2018-11-23 09:55:20,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:20,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:20,666 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 275 states. [2018-11-23 09:55:20,666 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 275 states. [2018-11-23 09:55:20,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:20,677 INFO L93 Difference]: Finished difference Result 275 states and 368 transitions. [2018-11-23 09:55:20,677 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 368 transitions. [2018-11-23 09:55:20,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:20,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:20,679 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:20,679 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-11-23 09:55:20,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 328 transitions. [2018-11-23 09:55:20,688 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 328 transitions. Word has length 47 [2018-11-23 09:55:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:20,688 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 328 transitions. [2018-11-23 09:55:20,688 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-11-23 09:55:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 328 transitions. [2018-11-23 09:55:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 09:55:20,690 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:20,691 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:20,691 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:20,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:20,691 INFO L82 PathProgramCache]: Analyzing trace with hash 2035613849, now seen corresponding path program 3 times [2018-11-23 09:55:20,692 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:20,692 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-23 09:55:20,722 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:55:21,228 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 09:55:21,228 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:55:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:21,301 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:55:21,773 INFO L478 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 26 treesize of output 18 [2018-11-23 09:55:21,799 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 09:55:21,800 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 8 [2018-11-23 09:55:21,824 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:55:21,840 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:55:21,843 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-23 09:55:21,843 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:26, output treesize:3 [2018-11-23 09:55:21,854 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 09:55:21,854 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse2 (select |#memory_int| |main_~#a~0.base|))) (let ((.cse1 (select .cse2 (_ bv0 32))) (.cse0 (select .cse2 (_ bv4 32)))) (and (= |main_#t~mem0| .cse0) (= .cse1 |main_#t~mem1|) (bvsgt .cse1 .cse0)))) [2018-11-23 09:55:21,854 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (bvsgt |main_#t~mem1| |main_#t~mem0|) [2018-11-23 09:55:22,414 INFO L256 TraceCheckUtils]: 0: Hoare triple {5544#true} call ULTIMATE.init(); {5544#true} is VALID [2018-11-23 09:55:22,415 INFO L273 TraceCheckUtils]: 1: Hoare triple {5544#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5544#true} is VALID [2018-11-23 09:55:22,415 INFO L273 TraceCheckUtils]: 2: Hoare triple {5544#true} assume true; {5544#true} is VALID [2018-11-23 09:55:22,415 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5544#true} {5544#true} #130#return; {5544#true} is VALID [2018-11-23 09:55:22,415 INFO L256 TraceCheckUtils]: 4: Hoare triple {5544#true} call #t~ret15 := main(); {5544#true} is VALID [2018-11-23 09:55:22,416 INFO L273 TraceCheckUtils]: 5: Hoare triple {5544#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {5564#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:22,424 INFO L273 TraceCheckUtils]: 6: Hoare triple {5564#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~i~0 (_ bv0 32)))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {5568#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)) (= (bvadd main_~s~0 (_ bv4294967295 32)) main_~k~0))} is VALID [2018-11-23 09:55:22,431 INFO L273 TraceCheckUtils]: 7: Hoare triple {5568#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)) (= (bvadd main_~s~0 (_ bv4294967295 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); {5572#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) |main_#t~mem0|) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32))) |main_#t~mem1|) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} is VALID [2018-11-23 09:55:22,433 INFO L273 TraceCheckUtils]: 8: Hoare triple {5572#(and (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) |main_#t~mem0|) (= (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32))) |main_#t~mem1|) (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5576#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)) (= main_~k~0 main_~s~0) (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)))))} is VALID [2018-11-23 09:55:22,434 INFO L273 TraceCheckUtils]: 9: Hoare triple {5576#(and (= |main_~#a~0.offset| (_ bv0 32)) (= main_~k~0 (_ bv0 32)) (= main_~k~0 main_~s~0) (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {5580#(and (= main_~s~0 (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 09:55:22,451 INFO L273 TraceCheckUtils]: 10: Hoare triple {5580#(and (= main_~s~0 (_ bv0 32)) (= |main_~#a~0.offset| (_ bv0 32)) (bvsgt (select (select |#memory_int| |main_~#a~0.base|) |main_~#a~0.offset|) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (_ bv4 32)))) (= (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); {5584#(bvsgt |main_#t~mem1| |main_#t~mem0|)} is VALID [2018-11-23 09:55:22,465 INFO L273 TraceCheckUtils]: 11: Hoare triple {5584#(bvsgt |main_#t~mem1| |main_#t~mem0|)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,465 INFO L273 TraceCheckUtils]: 12: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,466 INFO L273 TraceCheckUtils]: 13: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,466 INFO L273 TraceCheckUtils]: 15: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,466 INFO L273 TraceCheckUtils]: 16: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,467 INFO L273 TraceCheckUtils]: 17: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,467 INFO L273 TraceCheckUtils]: 18: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,467 INFO L273 TraceCheckUtils]: 19: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,467 INFO L273 TraceCheckUtils]: 20: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,467 INFO L273 TraceCheckUtils]: 21: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,467 INFO L273 TraceCheckUtils]: 22: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,468 INFO L273 TraceCheckUtils]: 23: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,468 INFO L273 TraceCheckUtils]: 24: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,468 INFO L273 TraceCheckUtils]: 25: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,468 INFO L273 TraceCheckUtils]: 26: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,468 INFO L273 TraceCheckUtils]: 27: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,468 INFO L273 TraceCheckUtils]: 28: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,468 INFO L273 TraceCheckUtils]: 29: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,469 INFO L273 TraceCheckUtils]: 30: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,469 INFO L273 TraceCheckUtils]: 31: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,469 INFO L273 TraceCheckUtils]: 32: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,469 INFO L273 TraceCheckUtils]: 33: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,470 INFO L273 TraceCheckUtils]: 34: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,470 INFO L273 TraceCheckUtils]: 35: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,470 INFO L273 TraceCheckUtils]: 36: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,470 INFO L273 TraceCheckUtils]: 37: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,470 INFO L273 TraceCheckUtils]: 38: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,470 INFO L273 TraceCheckUtils]: 39: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,471 INFO L273 TraceCheckUtils]: 40: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,471 INFO L273 TraceCheckUtils]: 41: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,471 INFO L273 TraceCheckUtils]: 42: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,471 INFO L273 TraceCheckUtils]: 43: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,472 INFO L273 TraceCheckUtils]: 44: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,472 INFO L273 TraceCheckUtils]: 45: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,472 INFO L273 TraceCheckUtils]: 46: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,472 INFO L273 TraceCheckUtils]: 47: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,472 INFO L273 TraceCheckUtils]: 48: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,473 INFO L273 TraceCheckUtils]: 49: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,473 INFO L273 TraceCheckUtils]: 50: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,473 INFO L273 TraceCheckUtils]: 51: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,473 INFO L273 TraceCheckUtils]: 52: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,473 INFO L273 TraceCheckUtils]: 53: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,474 INFO L273 TraceCheckUtils]: 54: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,474 INFO L273 TraceCheckUtils]: 55: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,474 INFO L273 TraceCheckUtils]: 56: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,474 INFO L273 TraceCheckUtils]: 57: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,474 INFO L273 TraceCheckUtils]: 58: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,475 INFO L273 TraceCheckUtils]: 59: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,475 INFO L273 TraceCheckUtils]: 60: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,475 INFO L273 TraceCheckUtils]: 61: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,475 INFO L273 TraceCheckUtils]: 62: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,475 INFO L273 TraceCheckUtils]: 63: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,476 INFO L273 TraceCheckUtils]: 64: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,476 INFO L273 TraceCheckUtils]: 65: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,476 INFO L273 TraceCheckUtils]: 66: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,476 INFO L273 TraceCheckUtils]: 67: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,476 INFO L273 TraceCheckUtils]: 68: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,477 INFO L273 TraceCheckUtils]: 69: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,477 INFO L273 TraceCheckUtils]: 70: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:22,477 INFO L273 TraceCheckUtils]: 71: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:22,477 INFO L273 TraceCheckUtils]: 72: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:22,477 INFO L273 TraceCheckUtils]: 73: Hoare triple {5545#false} assume !~bvslt32(~k~0, 100000bv32); {5545#false} is VALID [2018-11-23 09:55:22,478 INFO L273 TraceCheckUtils]: 74: Hoare triple {5545#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); {5545#false} is VALID [2018-11-23 09:55:22,478 INFO L273 TraceCheckUtils]: 75: Hoare triple {5545#false} ~x~0 := 0bv32; {5545#false} is VALID [2018-11-23 09:55:22,478 INFO L273 TraceCheckUtils]: 76: Hoare triple {5545#false} assume !~bvslt32(~x~0, ~i~0); {5545#false} is VALID [2018-11-23 09:55:22,478 INFO L273 TraceCheckUtils]: 77: Hoare triple {5545#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {5545#false} is VALID [2018-11-23 09:55:22,478 INFO L273 TraceCheckUtils]: 78: Hoare triple {5545#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); {5545#false} is VALID [2018-11-23 09:55:22,478 INFO L256 TraceCheckUtils]: 79: Hoare triple {5545#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {5545#false} is VALID [2018-11-23 09:55:22,479 INFO L273 TraceCheckUtils]: 80: Hoare triple {5545#false} ~cond := #in~cond; {5545#false} is VALID [2018-11-23 09:55:22,479 INFO L273 TraceCheckUtils]: 81: Hoare triple {5545#false} assume 0bv32 == ~cond; {5545#false} is VALID [2018-11-23 09:55:22,479 INFO L273 TraceCheckUtils]: 82: Hoare triple {5545#false} assume !false; {5545#false} is VALID [2018-11-23 09:55:22,486 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 103 proven. 2 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-11-23 09:55:22,486 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:55:24,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 34 [2018-11-23 09:55:24,934 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:55:26,954 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0)) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|)) [2018-11-23 09:55:28,968 WARN L670 Elim1Store]: solver failed to check if following equality is implied: (= (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|)) [2018-11-23 09:55:28,976 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:55:28,981 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:55:28,985 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 09:55:28,986 INFO L303 Elim1Store]: Index analysis took 4077 ms [2018-11-23 09:55:28,987 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 53 [2018-11-23 09:55:28,996 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 09:55:29,036 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 09:55:29,074 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-23 09:55:29,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:24 [2018-11-23 09:55:29,098 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 09:55:29,099 WARN L384 uantifierElimination]: Input elimination task: ∀ [|#memory_int|, |main_~#a~0.base|]. (let ((.cse0 (select |#memory_int| |main_~#a~0.base|)) (.cse1 (bvmul (_ bv4 32) main_~k~0))) (let ((.cse2 (select .cse0 (bvadd |main_~#a~0.offset| .cse1)))) (or (not (bvsgt (select .cse0 (bvadd |main_~#a~0.offset| .cse1 (_ bv4 32))) .cse2)) (not (bvsgt .cse2 (select .cse0 (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|))))))) [2018-11-23 09:55:29,099 WARN L385 uantifierElimination]: ElimStorePlain result: ∀ []. (let ((.cse0 (bvmul (_ bv4 32) main_~k~0)) (.cse1 (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|))) (or (= (bvadd |main_~#a~0.offset| .cse0) .cse1) (= (bvadd |main_~#a~0.offset| .cse0 (_ bv4 32)) .cse1))) [2018-11-23 09:55:29,271 INFO L273 TraceCheckUtils]: 82: Hoare triple {5545#false} assume !false; {5545#false} is VALID [2018-11-23 09:55:29,271 INFO L273 TraceCheckUtils]: 81: Hoare triple {5545#false} assume 0bv32 == ~cond; {5545#false} is VALID [2018-11-23 09:55:29,271 INFO L273 TraceCheckUtils]: 80: Hoare triple {5545#false} ~cond := #in~cond; {5545#false} is VALID [2018-11-23 09:55:29,272 INFO L256 TraceCheckUtils]: 79: Hoare triple {5545#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {5545#false} is VALID [2018-11-23 09:55:29,272 INFO L273 TraceCheckUtils]: 78: Hoare triple {5545#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); {5545#false} is VALID [2018-11-23 09:55:29,272 INFO L273 TraceCheckUtils]: 77: Hoare triple {5545#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {5545#false} is VALID [2018-11-23 09:55:29,272 INFO L273 TraceCheckUtils]: 76: Hoare triple {5545#false} assume !~bvslt32(~x~0, ~i~0); {5545#false} is VALID [2018-11-23 09:55:29,272 INFO L273 TraceCheckUtils]: 75: Hoare triple {5545#false} ~x~0 := 0bv32; {5545#false} is VALID [2018-11-23 09:55:29,273 INFO L273 TraceCheckUtils]: 74: Hoare triple {5545#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); {5545#false} is VALID [2018-11-23 09:55:29,273 INFO L273 TraceCheckUtils]: 73: Hoare triple {5545#false} assume !~bvslt32(~k~0, 100000bv32); {5545#false} is VALID [2018-11-23 09:55:29,273 INFO L273 TraceCheckUtils]: 72: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,273 INFO L273 TraceCheckUtils]: 71: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,273 INFO L273 TraceCheckUtils]: 70: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,274 INFO L273 TraceCheckUtils]: 69: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,274 INFO L273 TraceCheckUtils]: 68: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,274 INFO L273 TraceCheckUtils]: 67: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,274 INFO L273 TraceCheckUtils]: 66: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,274 INFO L273 TraceCheckUtils]: 65: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,274 INFO L273 TraceCheckUtils]: 64: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,275 INFO L273 TraceCheckUtils]: 63: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,275 INFO L273 TraceCheckUtils]: 62: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,275 INFO L273 TraceCheckUtils]: 61: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,275 INFO L273 TraceCheckUtils]: 60: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,275 INFO L273 TraceCheckUtils]: 59: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,276 INFO L273 TraceCheckUtils]: 58: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,276 INFO L273 TraceCheckUtils]: 57: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,276 INFO L273 TraceCheckUtils]: 56: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,276 INFO L273 TraceCheckUtils]: 55: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,276 INFO L273 TraceCheckUtils]: 54: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,277 INFO L273 TraceCheckUtils]: 53: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,277 INFO L273 TraceCheckUtils]: 52: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,277 INFO L273 TraceCheckUtils]: 51: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,277 INFO L273 TraceCheckUtils]: 50: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,277 INFO L273 TraceCheckUtils]: 49: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,278 INFO L273 TraceCheckUtils]: 48: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,278 INFO L273 TraceCheckUtils]: 47: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,278 INFO L273 TraceCheckUtils]: 46: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,278 INFO L273 TraceCheckUtils]: 45: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,278 INFO L273 TraceCheckUtils]: 44: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,279 INFO L273 TraceCheckUtils]: 43: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,279 INFO L273 TraceCheckUtils]: 42: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,279 INFO L273 TraceCheckUtils]: 41: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,279 INFO L273 TraceCheckUtils]: 40: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,279 INFO L273 TraceCheckUtils]: 39: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,280 INFO L273 TraceCheckUtils]: 38: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,280 INFO L273 TraceCheckUtils]: 37: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,280 INFO L273 TraceCheckUtils]: 36: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,280 INFO L273 TraceCheckUtils]: 35: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,280 INFO L273 TraceCheckUtils]: 34: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,280 INFO L273 TraceCheckUtils]: 33: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,281 INFO L273 TraceCheckUtils]: 32: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,281 INFO L273 TraceCheckUtils]: 31: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,281 INFO L273 TraceCheckUtils]: 30: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,281 INFO L273 TraceCheckUtils]: 29: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,281 INFO L273 TraceCheckUtils]: 28: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,282 INFO L273 TraceCheckUtils]: 27: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,282 INFO L273 TraceCheckUtils]: 26: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,282 INFO L273 TraceCheckUtils]: 25: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,282 INFO L273 TraceCheckUtils]: 24: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,282 INFO L273 TraceCheckUtils]: 23: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,283 INFO L273 TraceCheckUtils]: 22: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,283 INFO L273 TraceCheckUtils]: 21: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,283 INFO L273 TraceCheckUtils]: 20: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,283 INFO L273 TraceCheckUtils]: 19: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,283 INFO L273 TraceCheckUtils]: 18: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,284 INFO L273 TraceCheckUtils]: 17: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,284 INFO L273 TraceCheckUtils]: 16: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,284 INFO L273 TraceCheckUtils]: 15: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,284 INFO L273 TraceCheckUtils]: 14: Hoare triple {5545#false} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,284 INFO L273 TraceCheckUtils]: 13: Hoare triple {5545#false} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {5545#false} is VALID [2018-11-23 09:55:29,285 INFO L273 TraceCheckUtils]: 12: Hoare triple {5545#false} ~k~0 := ~bvadd32(1bv32, ~k~0); {5545#false} is VALID [2018-11-23 09:55:29,297 INFO L273 TraceCheckUtils]: 11: Hoare triple {6014#(not (bvsgt |main_#t~mem0| |main_#t~mem1|))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {5545#false} is VALID [2018-11-23 09:55:29,299 INFO L273 TraceCheckUtils]: 10: Hoare triple {6018#(not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|))))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6014#(not (bvsgt |main_#t~mem0| |main_#t~mem1|))} is VALID [2018-11-23 09:55:31,333 INFO L273 TraceCheckUtils]: 9: Hoare triple {6022#(not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|))))} ~k~0 := ~bvadd32(1bv32, ~k~0); {6018#(not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|))))} is UNKNOWN [2018-11-23 09:55:31,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {6026#(or (not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))))) (not (bvsgt |main_#t~mem0| |main_#t~mem1|)))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {6022#(not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd (bvmul (_ bv4 32) main_~s~0) |main_~#a~0.offset|))))} is VALID [2018-11-23 09:55:33,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {6030#(or (= (bvmul (_ bv4 32) main_~k~0) (bvmul (_ bv4 32) main_~s~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvmul (_ bv4 32) main_~s~0)))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {6026#(or (not (bvsgt (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0) (_ bv4 32))) (select (select |#memory_int| |main_~#a~0.base|) (bvadd |main_~#a~0.offset| (bvmul (_ bv4 32) main_~k~0))))) (not (bvsgt |main_#t~mem0| |main_#t~mem1|)))} is UNKNOWN [2018-11-23 09:55:33,358 INFO L273 TraceCheckUtils]: 6: Hoare triple {5544#true} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {6030#(or (= (bvmul (_ bv4 32) main_~k~0) (bvmul (_ bv4 32) main_~s~0)) (= (bvadd (bvmul (_ bv4 32) main_~k~0) (_ bv4 32)) (bvmul (_ bv4 32) main_~s~0)))} is VALID [2018-11-23 09:55:33,359 INFO L273 TraceCheckUtils]: 5: Hoare triple {5544#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {5544#true} is VALID [2018-11-23 09:55:33,359 INFO L256 TraceCheckUtils]: 4: Hoare triple {5544#true} call #t~ret15 := main(); {5544#true} is VALID [2018-11-23 09:55:33,359 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {5544#true} {5544#true} #130#return; {5544#true} is VALID [2018-11-23 09:55:33,359 INFO L273 TraceCheckUtils]: 2: Hoare triple {5544#true} assume true; {5544#true} is VALID [2018-11-23 09:55:33,359 INFO L273 TraceCheckUtils]: 1: Hoare triple {5544#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {5544#true} is VALID [2018-11-23 09:55:33,359 INFO L256 TraceCheckUtils]: 0: Hoare triple {5544#true} call ULTIMATE.init(); {5544#true} is VALID [2018-11-23 09:55:33,363 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 104 proven. 1 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2018-11-23 09:55:33,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:55:33,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2018-11-23 09:55:33,368 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2018-11-23 09:55:33,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:55:33,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 09:55:37,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 30 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:37,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 09:55:37,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 09:55:37,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-11-23 09:55:37,466 INFO L87 Difference]: Start difference. First operand 247 states and 328 transitions. Second operand 13 states. [2018-11-23 09:55:38,055 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-11-23 09:55:45,160 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-11-23 09:55:52,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:52,325 INFO L93 Difference]: Finished difference Result 473 states and 621 transitions. [2018-11-23 09:55:52,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 09:55:52,325 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 83 [2018-11-23 09:55:52,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:55:52,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 09:55:52,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 160 transitions. [2018-11-23 09:55:52,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 09:55:52,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 160 transitions. [2018-11-23 09:55:52,333 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 160 transitions. [2018-11-23 09:55:58,781 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 157 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2018-11-23 09:55:58,790 INFO L225 Difference]: With dead ends: 473 [2018-11-23 09:55:58,790 INFO L226 Difference]: Without dead ends: 304 [2018-11-23 09:55:58,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=128, Invalid=472, Unknown=0, NotChecked=0, Total=600 [2018-11-23 09:55:58,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-11-23 09:55:59,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 250. [2018-11-23 09:55:59,031 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:55:59,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 304 states. Second operand 250 states. [2018-11-23 09:55:59,031 INFO L74 IsIncluded]: Start isIncluded. First operand 304 states. Second operand 250 states. [2018-11-23 09:55:59,031 INFO L87 Difference]: Start difference. First operand 304 states. Second operand 250 states. [2018-11-23 09:55:59,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:59,044 INFO L93 Difference]: Finished difference Result 304 states and 391 transitions. [2018-11-23 09:55:59,044 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 391 transitions. [2018-11-23 09:55:59,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:59,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:59,045 INFO L74 IsIncluded]: Start isIncluded. First operand 250 states. Second operand 304 states. [2018-11-23 09:55:59,046 INFO L87 Difference]: Start difference. First operand 250 states. Second operand 304 states. [2018-11-23 09:55:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:55:59,058 INFO L93 Difference]: Finished difference Result 304 states and 391 transitions. [2018-11-23 09:55:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 391 transitions. [2018-11-23 09:55:59,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:55:59,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:55:59,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:55:59,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:55:59,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-11-23 09:55:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 329 transitions. [2018-11-23 09:55:59,068 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 329 transitions. Word has length 83 [2018-11-23 09:55:59,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:55:59,069 INFO L480 AbstractCegarLoop]: Abstraction has 250 states and 329 transitions. [2018-11-23 09:55:59,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 09:55:59,069 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 329 transitions. [2018-11-23 09:55:59,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-11-23 09:55:59,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:55:59,071 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:55:59,071 INFO L423 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:55:59,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:55:59,071 INFO L82 PathProgramCache]: Analyzing trace with hash 2112514647, now seen corresponding path program 1 times [2018-11-23 09:55:59,072 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:55:59,072 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-23 09:55:59,102 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 09:55:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:59,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:55:59,433 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:56:01,012 INFO L256 TraceCheckUtils]: 0: Hoare triple {7655#true} call ULTIMATE.init(); {7655#true} is VALID [2018-11-23 09:56:01,013 INFO L273 TraceCheckUtils]: 1: Hoare triple {7655#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {7655#true} is VALID [2018-11-23 09:56:01,013 INFO L273 TraceCheckUtils]: 2: Hoare triple {7655#true} assume true; {7655#true} is VALID [2018-11-23 09:56:01,013 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7655#true} {7655#true} #130#return; {7655#true} is VALID [2018-11-23 09:56:01,013 INFO L256 TraceCheckUtils]: 4: Hoare triple {7655#true} call #t~ret15 := main(); {7655#true} is VALID [2018-11-23 09:56:01,014 INFO L273 TraceCheckUtils]: 5: Hoare triple {7655#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {7675#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:56:01,015 INFO L273 TraceCheckUtils]: 6: Hoare triple {7675#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {7679#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:56:01,015 INFO L273 TraceCheckUtils]: 7: Hoare triple {7679#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {7679#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:56:01,016 INFO L273 TraceCheckUtils]: 8: Hoare triple {7679#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7679#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:56:01,016 INFO L273 TraceCheckUtils]: 9: Hoare triple {7679#(= main_~k~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7689#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,017 INFO L273 TraceCheckUtils]: 10: Hoare triple {7689#(= (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); {7689#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,018 INFO L273 TraceCheckUtils]: 11: Hoare triple {7689#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1; {7689#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,018 INFO L273 TraceCheckUtils]: 12: Hoare triple {7689#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7699#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,019 INFO L273 TraceCheckUtils]: 13: Hoare triple {7699#(= (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); {7699#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,020 INFO L273 TraceCheckUtils]: 14: Hoare triple {7699#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7699#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,020 INFO L273 TraceCheckUtils]: 15: Hoare triple {7699#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7709#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,021 INFO L273 TraceCheckUtils]: 16: Hoare triple {7709#(= (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); {7709#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,021 INFO L273 TraceCheckUtils]: 17: Hoare triple {7709#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7709#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {7709#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7719#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,023 INFO L273 TraceCheckUtils]: 19: Hoare triple {7719#(= (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); {7719#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,023 INFO L273 TraceCheckUtils]: 20: Hoare triple {7719#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7719#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,024 INFO L273 TraceCheckUtils]: 21: Hoare triple {7719#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7729#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,025 INFO L273 TraceCheckUtils]: 22: Hoare triple {7729#(= (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); {7729#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,025 INFO L273 TraceCheckUtils]: 23: Hoare triple {7729#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7729#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,026 INFO L273 TraceCheckUtils]: 24: Hoare triple {7729#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7739#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:56:01,027 INFO L273 TraceCheckUtils]: 25: Hoare triple {7739#(= (_ 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); {7739#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:56:01,028 INFO L273 TraceCheckUtils]: 26: Hoare triple {7739#(= (_ bv6 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7739#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:56:01,028 INFO L273 TraceCheckUtils]: 27: Hoare triple {7739#(= (_ bv6 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {7749#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,029 INFO L273 TraceCheckUtils]: 28: Hoare triple {7749#(= (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); {7749#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,029 INFO L273 TraceCheckUtils]: 29: Hoare triple {7749#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7749#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,030 INFO L273 TraceCheckUtils]: 30: Hoare triple {7749#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7759#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,031 INFO L273 TraceCheckUtils]: 31: Hoare triple {7759#(= (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); {7759#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,031 INFO L273 TraceCheckUtils]: 32: Hoare triple {7759#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7759#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,032 INFO L273 TraceCheckUtils]: 33: Hoare triple {7759#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7769#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,032 INFO L273 TraceCheckUtils]: 34: Hoare triple {7769#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {7769#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,033 INFO L273 TraceCheckUtils]: 35: Hoare triple {7769#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7769#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,034 INFO L273 TraceCheckUtils]: 36: Hoare triple {7769#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7779#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,034 INFO L273 TraceCheckUtils]: 37: Hoare triple {7779#(= (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); {7779#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,035 INFO L273 TraceCheckUtils]: 38: Hoare triple {7779#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7779#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,036 INFO L273 TraceCheckUtils]: 39: Hoare triple {7779#(= (bvadd main_~k~0 (_ bv4294967286 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7789#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 09:56:01,036 INFO L273 TraceCheckUtils]: 40: Hoare triple {7789#(= (_ 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); {7789#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 09:56:01,037 INFO L273 TraceCheckUtils]: 41: Hoare triple {7789#(= (_ bv11 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7789#(= (_ bv11 32) main_~k~0)} is VALID [2018-11-23 09:56:01,037 INFO L273 TraceCheckUtils]: 42: Hoare triple {7789#(= (_ bv11 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {7799#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,038 INFO L273 TraceCheckUtils]: 43: Hoare triple {7799#(= (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); {7799#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,039 INFO L273 TraceCheckUtils]: 44: Hoare triple {7799#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7799#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,040 INFO L273 TraceCheckUtils]: 45: Hoare triple {7799#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7809#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,058 INFO L273 TraceCheckUtils]: 46: Hoare triple {7809#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {7809#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,059 INFO L273 TraceCheckUtils]: 47: Hoare triple {7809#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7809#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,060 INFO L273 TraceCheckUtils]: 48: Hoare triple {7809#(= (bvadd main_~k~0 (_ bv4294967283 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7819#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,060 INFO L273 TraceCheckUtils]: 49: Hoare triple {7819#(= (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); {7819#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,060 INFO L273 TraceCheckUtils]: 50: Hoare triple {7819#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7819#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,061 INFO L273 TraceCheckUtils]: 51: Hoare triple {7819#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7829#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-23 09:56:01,061 INFO L273 TraceCheckUtils]: 52: Hoare triple {7829#(= (_ 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); {7829#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-23 09:56:01,061 INFO L273 TraceCheckUtils]: 53: Hoare triple {7829#(= (_ bv15 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7829#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-23 09:56:01,062 INFO L273 TraceCheckUtils]: 54: Hoare triple {7829#(= (_ bv15 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {7839#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,062 INFO L273 TraceCheckUtils]: 55: Hoare triple {7839#(= (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); {7839#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,063 INFO L273 TraceCheckUtils]: 56: Hoare triple {7839#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7839#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,064 INFO L273 TraceCheckUtils]: 57: Hoare triple {7839#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7849#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,064 INFO L273 TraceCheckUtils]: 58: Hoare triple {7849#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {7849#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,065 INFO L273 TraceCheckUtils]: 59: Hoare triple {7849#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7849#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,066 INFO L273 TraceCheckUtils]: 60: Hoare triple {7849#(= (bvadd main_~k~0 (_ bv4294967279 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7859#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,066 INFO L273 TraceCheckUtils]: 61: Hoare triple {7859#(= (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); {7859#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,067 INFO L273 TraceCheckUtils]: 62: Hoare triple {7859#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7859#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,067 INFO L273 TraceCheckUtils]: 63: Hoare triple {7859#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7869#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-23 09:56:01,068 INFO L273 TraceCheckUtils]: 64: Hoare triple {7869#(= (_ 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); {7869#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-23 09:56:01,068 INFO L273 TraceCheckUtils]: 65: Hoare triple {7869#(= (_ bv19 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7869#(= (_ bv19 32) main_~k~0)} is VALID [2018-11-23 09:56:01,069 INFO L273 TraceCheckUtils]: 66: Hoare triple {7869#(= (_ bv19 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {7879#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,070 INFO L273 TraceCheckUtils]: 67: Hoare triple {7879#(= (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); {7879#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,070 INFO L273 TraceCheckUtils]: 68: Hoare triple {7879#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7879#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,071 INFO L273 TraceCheckUtils]: 69: Hoare triple {7879#(= (bvadd main_~k~0 (_ bv4294967276 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7889#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,071 INFO L273 TraceCheckUtils]: 70: Hoare triple {7889#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {7889#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,072 INFO L273 TraceCheckUtils]: 71: Hoare triple {7889#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7889#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,073 INFO L273 TraceCheckUtils]: 72: Hoare triple {7889#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7899#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:01,073 INFO L273 TraceCheckUtils]: 73: Hoare triple {7899#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {7656#false} is VALID [2018-11-23 09:56:01,074 INFO L273 TraceCheckUtils]: 74: Hoare triple {7656#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); {7656#false} is VALID [2018-11-23 09:56:01,074 INFO L273 TraceCheckUtils]: 75: Hoare triple {7656#false} ~x~0 := 0bv32; {7656#false} is VALID [2018-11-23 09:56:01,074 INFO L273 TraceCheckUtils]: 76: Hoare triple {7656#false} assume !~bvslt32(~x~0, ~i~0); {7656#false} is VALID [2018-11-23 09:56:01,074 INFO L273 TraceCheckUtils]: 77: Hoare triple {7656#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {7656#false} is VALID [2018-11-23 09:56:01,075 INFO L273 TraceCheckUtils]: 78: Hoare triple {7656#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); {7656#false} is VALID [2018-11-23 09:56:01,075 INFO L256 TraceCheckUtils]: 79: Hoare triple {7656#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {7656#false} is VALID [2018-11-23 09:56:01,075 INFO L273 TraceCheckUtils]: 80: Hoare triple {7656#false} ~cond := #in~cond; {7656#false} is VALID [2018-11-23 09:56:01,075 INFO L273 TraceCheckUtils]: 81: Hoare triple {7656#false} assume 0bv32 == ~cond; {7656#false} is VALID [2018-11-23 09:56:01,075 INFO L273 TraceCheckUtils]: 82: Hoare triple {7656#false} assume !false; {7656#false} is VALID [2018-11-23 09:56:01,083 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:56:01,083 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:56:02,897 INFO L273 TraceCheckUtils]: 82: Hoare triple {7656#false} assume !false; {7656#false} is VALID [2018-11-23 09:56:02,898 INFO L273 TraceCheckUtils]: 81: Hoare triple {7656#false} assume 0bv32 == ~cond; {7656#false} is VALID [2018-11-23 09:56:02,898 INFO L273 TraceCheckUtils]: 80: Hoare triple {7656#false} ~cond := #in~cond; {7656#false} is VALID [2018-11-23 09:56:02,898 INFO L256 TraceCheckUtils]: 79: Hoare triple {7656#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {7656#false} is VALID [2018-11-23 09:56:02,898 INFO L273 TraceCheckUtils]: 78: Hoare triple {7656#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); {7656#false} is VALID [2018-11-23 09:56:02,898 INFO L273 TraceCheckUtils]: 77: Hoare triple {7656#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {7656#false} is VALID [2018-11-23 09:56:02,898 INFO L273 TraceCheckUtils]: 76: Hoare triple {7656#false} assume !~bvslt32(~x~0, ~i~0); {7656#false} is VALID [2018-11-23 09:56:02,899 INFO L273 TraceCheckUtils]: 75: Hoare triple {7656#false} ~x~0 := 0bv32; {7656#false} is VALID [2018-11-23 09:56:02,899 INFO L273 TraceCheckUtils]: 74: Hoare triple {7656#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); {7656#false} is VALID [2018-11-23 09:56:02,899 INFO L273 TraceCheckUtils]: 73: Hoare triple {7957#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {7656#false} is VALID [2018-11-23 09:56:02,900 INFO L273 TraceCheckUtils]: 72: Hoare triple {7961#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7957#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-23 09:56:02,900 INFO L273 TraceCheckUtils]: 71: Hoare triple {7961#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7961#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,901 INFO L273 TraceCheckUtils]: 70: Hoare triple {7961#(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); {7961#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,906 INFO L273 TraceCheckUtils]: 69: Hoare triple {7971#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7961#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,906 INFO L273 TraceCheckUtils]: 68: Hoare triple {7971#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7971#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,906 INFO L273 TraceCheckUtils]: 67: Hoare triple {7971#(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); {7971#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,912 INFO L273 TraceCheckUtils]: 66: Hoare triple {7981#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7971#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,913 INFO L273 TraceCheckUtils]: 65: Hoare triple {7981#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7981#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,913 INFO L273 TraceCheckUtils]: 64: Hoare triple {7981#(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); {7981#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,923 INFO L273 TraceCheckUtils]: 63: Hoare triple {7991#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7981#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,923 INFO L273 TraceCheckUtils]: 62: Hoare triple {7991#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {7991#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,924 INFO L273 TraceCheckUtils]: 61: Hoare triple {7991#(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); {7991#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,930 INFO L273 TraceCheckUtils]: 60: Hoare triple {8001#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {7991#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,930 INFO L273 TraceCheckUtils]: 59: Hoare triple {8001#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8001#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,931 INFO L273 TraceCheckUtils]: 58: Hoare triple {8001#(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); {8001#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,935 INFO L273 TraceCheckUtils]: 57: Hoare triple {8011#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8001#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,935 INFO L273 TraceCheckUtils]: 56: Hoare triple {8011#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8011#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,936 INFO L273 TraceCheckUtils]: 55: Hoare triple {8011#(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); {8011#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,941 INFO L273 TraceCheckUtils]: 54: Hoare triple {8021#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8011#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,942 INFO L273 TraceCheckUtils]: 53: Hoare triple {8021#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8021#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,942 INFO L273 TraceCheckUtils]: 52: Hoare triple {8021#(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); {8021#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,950 INFO L273 TraceCheckUtils]: 51: Hoare triple {8031#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8021#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,951 INFO L273 TraceCheckUtils]: 50: Hoare triple {8031#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8031#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,951 INFO L273 TraceCheckUtils]: 49: Hoare triple {8031#(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); {8031#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,956 INFO L273 TraceCheckUtils]: 48: Hoare triple {8041#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8031#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,957 INFO L273 TraceCheckUtils]: 47: Hoare triple {8041#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8041#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,957 INFO L273 TraceCheckUtils]: 46: Hoare triple {8041#(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); {8041#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,963 INFO L273 TraceCheckUtils]: 45: Hoare triple {8051#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8041#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,964 INFO L273 TraceCheckUtils]: 44: Hoare triple {8051#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8051#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,964 INFO L273 TraceCheckUtils]: 43: Hoare triple {8051#(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); {8051#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,970 INFO L273 TraceCheckUtils]: 42: Hoare triple {8061#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8051#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,970 INFO L273 TraceCheckUtils]: 41: Hoare triple {8061#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8061#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,971 INFO L273 TraceCheckUtils]: 40: Hoare triple {8061#(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); {8061#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,977 INFO L273 TraceCheckUtils]: 39: Hoare triple {8071#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8061#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,977 INFO L273 TraceCheckUtils]: 38: Hoare triple {8071#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8071#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,977 INFO L273 TraceCheckUtils]: 37: Hoare triple {8071#(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); {8071#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,985 INFO L273 TraceCheckUtils]: 36: Hoare triple {8081#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8071#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,985 INFO L273 TraceCheckUtils]: 35: Hoare triple {8081#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8081#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,986 INFO L273 TraceCheckUtils]: 34: Hoare triple {8081#(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); {8081#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,990 INFO L273 TraceCheckUtils]: 33: Hoare triple {8091#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8081#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,990 INFO L273 TraceCheckUtils]: 32: Hoare triple {8091#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8091#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,991 INFO L273 TraceCheckUtils]: 31: Hoare triple {8091#(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); {8091#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,997 INFO L273 TraceCheckUtils]: 30: Hoare triple {8101#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8091#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,998 INFO L273 TraceCheckUtils]: 29: Hoare triple {8101#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8101#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:02,998 INFO L273 TraceCheckUtils]: 28: Hoare triple {8101#(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); {8101#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,002 INFO L273 TraceCheckUtils]: 27: Hoare triple {8111#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8101#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,002 INFO L273 TraceCheckUtils]: 26: Hoare triple {8111#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8111#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,003 INFO L273 TraceCheckUtils]: 25: Hoare triple {8111#(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); {8111#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,007 INFO L273 TraceCheckUtils]: 24: Hoare triple {8121#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8111#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,007 INFO L273 TraceCheckUtils]: 23: Hoare triple {8121#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8121#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,007 INFO L273 TraceCheckUtils]: 22: Hoare triple {8121#(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); {8121#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,012 INFO L273 TraceCheckUtils]: 21: Hoare triple {8131#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8121#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,012 INFO L273 TraceCheckUtils]: 20: Hoare triple {8131#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8131#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,012 INFO L273 TraceCheckUtils]: 19: Hoare triple {8131#(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); {8131#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,022 INFO L273 TraceCheckUtils]: 18: Hoare triple {8141#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8131#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,022 INFO L273 TraceCheckUtils]: 17: Hoare triple {8141#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8141#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,022 INFO L273 TraceCheckUtils]: 16: Hoare triple {8141#(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); {8141#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,027 INFO L273 TraceCheckUtils]: 15: Hoare triple {8151#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8141#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,027 INFO L273 TraceCheckUtils]: 14: Hoare triple {8151#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8151#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,027 INFO L273 TraceCheckUtils]: 13: Hoare triple {8151#(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); {8151#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,035 INFO L273 TraceCheckUtils]: 12: Hoare triple {8161#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8151#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,036 INFO L273 TraceCheckUtils]: 11: Hoare triple {8161#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} assume !~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1; {8161#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,036 INFO L273 TraceCheckUtils]: 10: Hoare triple {8161#(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); {8161#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,045 INFO L273 TraceCheckUtils]: 9: Hoare triple {8171#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {8161#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,045 INFO L273 TraceCheckUtils]: 8: Hoare triple {8171#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {8171#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,046 INFO L273 TraceCheckUtils]: 7: Hoare triple {8171#(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); {8171#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,047 INFO L273 TraceCheckUtils]: 6: Hoare triple {8181#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {8171#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,048 INFO L273 TraceCheckUtils]: 5: Hoare triple {7655#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {8181#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:03,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {7655#true} call #t~ret15 := main(); {7655#true} is VALID [2018-11-23 09:56:03,048 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {7655#true} {7655#true} #130#return; {7655#true} is VALID [2018-11-23 09:56:03,049 INFO L273 TraceCheckUtils]: 2: Hoare triple {7655#true} assume true; {7655#true} is VALID [2018-11-23 09:56:03,049 INFO L273 TraceCheckUtils]: 1: Hoare triple {7655#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {7655#true} is VALID [2018-11-23 09:56:03,049 INFO L256 TraceCheckUtils]: 0: Hoare triple {7655#true} call ULTIMATE.init(); {7655#true} is VALID [2018-11-23 09:56:03,058 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:56:03,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:56:03,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 50 [2018-11-23 09:56:03,061 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 83 [2018-11-23 09:56:03,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:56:03,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 50 states. [2018-11-23 09:56:03,425 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:56:03,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-11-23 09:56:03,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-11-23 09:56:03,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=627, Invalid=1823, Unknown=0, NotChecked=0, Total=2450 [2018-11-23 09:56:03,427 INFO L87 Difference]: Start difference. First operand 250 states and 329 transitions. Second operand 50 states. [2018-11-23 09:56:13,011 WARN L180 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 10 [2018-11-23 09:56:13,573 WARN L180 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 10 [2018-11-23 09:56:14,175 WARN L180 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 10 [2018-11-23 09:56:14,805 WARN L180 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 10 [2018-11-23 09:56:15,479 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 10 [2018-11-23 09:56:16,132 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 10 [2018-11-23 09:56:16,801 WARN L180 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 10 [2018-11-23 09:56:17,500 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 10 [2018-11-23 09:56:18,159 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 10 [2018-11-23 09:56:26,611 WARN L180 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 10 [2018-11-23 09:56:27,773 WARN L180 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 11 [2018-11-23 09:56:28,787 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 11 [2018-11-23 09:56:30,003 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 11 [2018-11-23 09:56:30,885 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 11 [2018-11-23 09:56:31,787 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 11 [2018-11-23 09:56:32,702 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 11 [2018-11-23 09:56:33,625 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 11 [2018-11-23 09:56:34,574 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 11 [2018-11-23 09:56:35,506 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 11 [2018-11-23 09:56:36,436 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 11 [2018-11-23 09:56:44,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:56:44,892 INFO L93 Difference]: Finished difference Result 605 states and 876 transitions. [2018-11-23 09:56:44,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-11-23 09:56:44,892 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 83 [2018-11-23 09:56:44,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:56:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 09:56:44,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 448 transitions. [2018-11-23 09:56:44,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-23 09:56:44,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 448 transitions. [2018-11-23 09:56:44,903 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 74 states and 448 transitions. [2018-11-23 09:56:47,048 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:56:47,064 INFO L225 Difference]: With dead ends: 605 [2018-11-23 09:56:47,064 INFO L226 Difference]: Without dead ends: 494 [2018-11-23 09:56:47,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2369 ImplicationChecksByTransitivity, 29.1s TimeCoverageRelationStatistics Valid=3824, Invalid=10218, Unknown=0, NotChecked=0, Total=14042 [2018-11-23 09:56:47,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2018-11-23 09:56:47,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 466. [2018-11-23 09:56:47,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:56:47,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 494 states. Second operand 466 states. [2018-11-23 09:56:47,525 INFO L74 IsIncluded]: Start isIncluded. First operand 494 states. Second operand 466 states. [2018-11-23 09:56:47,525 INFO L87 Difference]: Start difference. First operand 494 states. Second operand 466 states. [2018-11-23 09:56:47,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:56:47,543 INFO L93 Difference]: Finished difference Result 494 states and 657 transitions. [2018-11-23 09:56:47,543 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 657 transitions. [2018-11-23 09:56:47,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:56:47,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:56:47,545 INFO L74 IsIncluded]: Start isIncluded. First operand 466 states. Second operand 494 states. [2018-11-23 09:56:47,545 INFO L87 Difference]: Start difference. First operand 466 states. Second operand 494 states. [2018-11-23 09:56:47,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:56:47,564 INFO L93 Difference]: Finished difference Result 494 states and 657 transitions. [2018-11-23 09:56:47,564 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 657 transitions. [2018-11-23 09:56:47,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:56:47,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:56:47,567 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:56:47,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:56:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 466 states. [2018-11-23 09:56:47,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 617 transitions. [2018-11-23 09:56:47,583 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 617 transitions. Word has length 83 [2018-11-23 09:56:47,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:56:47,584 INFO L480 AbstractCegarLoop]: Abstraction has 466 states and 617 transitions. [2018-11-23 09:56:47,584 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-11-23 09:56:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 617 transitions. [2018-11-23 09:56:47,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-11-23 09:56:47,586 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:56:47,587 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:56:47,587 INFO L423 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:56:47,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:56:47,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1958683351, now seen corresponding path program 2 times [2018-11-23 09:56:47,588 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:56:47,588 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-23 09:56:47,614 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:56:48,079 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:56:48,080 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:56:48,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:56:48,251 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:56:49,923 INFO L256 TraceCheckUtils]: 0: Hoare triple {10770#true} call ULTIMATE.init(); {10770#true} is VALID [2018-11-23 09:56:49,923 INFO L273 TraceCheckUtils]: 1: Hoare triple {10770#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {10770#true} is VALID [2018-11-23 09:56:49,923 INFO L273 TraceCheckUtils]: 2: Hoare triple {10770#true} assume true; {10770#true} is VALID [2018-11-23 09:56:49,924 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10770#true} {10770#true} #130#return; {10770#true} is VALID [2018-11-23 09:56:49,924 INFO L256 TraceCheckUtils]: 4: Hoare triple {10770#true} call #t~ret15 := main(); {10770#true} is VALID [2018-11-23 09:56:49,924 INFO L273 TraceCheckUtils]: 5: Hoare triple {10770#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {10790#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:56:49,925 INFO L273 TraceCheckUtils]: 6: Hoare triple {10790#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {10794#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:56:49,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {10794#(= main_~k~0 (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10794#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:56:49,925 INFO L273 TraceCheckUtils]: 8: Hoare triple {10794#(= main_~k~0 (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10794#(= main_~k~0 (_ bv0 32))} is VALID [2018-11-23 09:56:49,926 INFO L273 TraceCheckUtils]: 9: Hoare triple {10794#(= main_~k~0 (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10804#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,926 INFO L273 TraceCheckUtils]: 10: Hoare triple {10804#(= (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); {10804#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,926 INFO L273 TraceCheckUtils]: 11: Hoare triple {10804#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1; {10804#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,927 INFO L273 TraceCheckUtils]: 12: Hoare triple {10804#(= (bvadd main_~k~0 (_ bv4294967295 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10814#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,927 INFO L273 TraceCheckUtils]: 13: Hoare triple {10814#(= (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); {10814#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,928 INFO L273 TraceCheckUtils]: 14: Hoare triple {10814#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10814#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,928 INFO L273 TraceCheckUtils]: 15: Hoare triple {10814#(= (bvadd main_~k~0 (_ bv4294967294 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10824#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,929 INFO L273 TraceCheckUtils]: 16: Hoare triple {10824#(= (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); {10824#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,929 INFO L273 TraceCheckUtils]: 17: Hoare triple {10824#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10824#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,930 INFO L273 TraceCheckUtils]: 18: Hoare triple {10824#(= (bvadd main_~k~0 (_ bv4294967293 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10834#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,931 INFO L273 TraceCheckUtils]: 19: Hoare triple {10834#(= (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); {10834#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,931 INFO L273 TraceCheckUtils]: 20: Hoare triple {10834#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10834#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,932 INFO L273 TraceCheckUtils]: 21: Hoare triple {10834#(= (bvadd main_~k~0 (_ bv4294967292 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10844#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,933 INFO L273 TraceCheckUtils]: 22: Hoare triple {10844#(= (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); {10844#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,933 INFO L273 TraceCheckUtils]: 23: Hoare triple {10844#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10844#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,934 INFO L273 TraceCheckUtils]: 24: Hoare triple {10844#(= (bvadd main_~k~0 (_ bv4294967291 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10854#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:56:49,935 INFO L273 TraceCheckUtils]: 25: Hoare triple {10854#(= (_ 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); {10854#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:56:49,935 INFO L273 TraceCheckUtils]: 26: Hoare triple {10854#(= (_ bv6 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10854#(= (_ bv6 32) main_~k~0)} is VALID [2018-11-23 09:56:49,936 INFO L273 TraceCheckUtils]: 27: Hoare triple {10854#(= (_ bv6 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {10864#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,936 INFO L273 TraceCheckUtils]: 28: Hoare triple {10864#(= (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); {10864#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,937 INFO L273 TraceCheckUtils]: 29: Hoare triple {10864#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10864#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,938 INFO L273 TraceCheckUtils]: 30: Hoare triple {10864#(= (bvadd main_~k~0 (_ bv4294967289 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10874#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,960 INFO L273 TraceCheckUtils]: 31: Hoare triple {10874#(= (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); {10874#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,961 INFO L273 TraceCheckUtils]: 32: Hoare triple {10874#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10874#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,961 INFO L273 TraceCheckUtils]: 33: Hoare triple {10874#(= (bvadd main_~k~0 (_ bv4294967288 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10884#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,962 INFO L273 TraceCheckUtils]: 34: Hoare triple {10884#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {10884#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,962 INFO L273 TraceCheckUtils]: 35: Hoare triple {10884#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10884#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,962 INFO L273 TraceCheckUtils]: 36: Hoare triple {10884#(= (bvadd main_~k~0 (_ bv4294967287 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10894#(= (_ bv10 32) main_~k~0)} is VALID [2018-11-23 09:56:49,963 INFO L273 TraceCheckUtils]: 37: Hoare triple {10894#(= (_ bv10 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); {10894#(= (_ bv10 32) main_~k~0)} is VALID [2018-11-23 09:56:49,963 INFO L273 TraceCheckUtils]: 38: Hoare triple {10894#(= (_ bv10 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10894#(= (_ bv10 32) main_~k~0)} is VALID [2018-11-23 09:56:49,964 INFO L273 TraceCheckUtils]: 39: Hoare triple {10894#(= (_ bv10 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {10904#(= (bvadd main_~k~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,964 INFO L273 TraceCheckUtils]: 40: Hoare triple {10904#(= (bvadd main_~k~0 (_ bv4294967285 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); {10904#(= (bvadd main_~k~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,964 INFO L273 TraceCheckUtils]: 41: Hoare triple {10904#(= (bvadd main_~k~0 (_ bv4294967285 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10904#(= (bvadd main_~k~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,965 INFO L273 TraceCheckUtils]: 42: Hoare triple {10904#(= (bvadd main_~k~0 (_ bv4294967285 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10914#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,965 INFO L273 TraceCheckUtils]: 43: Hoare triple {10914#(= (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); {10914#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,965 INFO L273 TraceCheckUtils]: 44: Hoare triple {10914#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10914#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,966 INFO L273 TraceCheckUtils]: 45: Hoare triple {10914#(= (bvadd main_~k~0 (_ bv4294967284 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10924#(= (_ bv13 32) main_~k~0)} is VALID [2018-11-23 09:56:49,967 INFO L273 TraceCheckUtils]: 46: Hoare triple {10924#(= (_ 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); {10924#(= (_ bv13 32) main_~k~0)} is VALID [2018-11-23 09:56:49,967 INFO L273 TraceCheckUtils]: 47: Hoare triple {10924#(= (_ bv13 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10924#(= (_ bv13 32) main_~k~0)} is VALID [2018-11-23 09:56:49,968 INFO L273 TraceCheckUtils]: 48: Hoare triple {10924#(= (_ bv13 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {10934#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,968 INFO L273 TraceCheckUtils]: 49: Hoare triple {10934#(= (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); {10934#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,969 INFO L273 TraceCheckUtils]: 50: Hoare triple {10934#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10934#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,970 INFO L273 TraceCheckUtils]: 51: Hoare triple {10934#(= (bvadd main_~k~0 (_ bv4294967282 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10944#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-23 09:56:49,970 INFO L273 TraceCheckUtils]: 52: Hoare triple {10944#(= (_ 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); {10944#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-23 09:56:49,971 INFO L273 TraceCheckUtils]: 53: Hoare triple {10944#(= (_ bv15 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10944#(= (_ bv15 32) main_~k~0)} is VALID [2018-11-23 09:56:49,971 INFO L273 TraceCheckUtils]: 54: Hoare triple {10944#(= (_ bv15 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {10954#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,972 INFO L273 TraceCheckUtils]: 55: Hoare triple {10954#(= (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); {10954#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,972 INFO L273 TraceCheckUtils]: 56: Hoare triple {10954#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10954#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,973 INFO L273 TraceCheckUtils]: 57: Hoare triple {10954#(= (bvadd main_~k~0 (_ bv4294967280 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10964#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-23 09:56:49,974 INFO L273 TraceCheckUtils]: 58: Hoare triple {10964#(= (_ 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); {10964#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-23 09:56:49,974 INFO L273 TraceCheckUtils]: 59: Hoare triple {10964#(= (_ bv17 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10964#(= (_ bv17 32) main_~k~0)} is VALID [2018-11-23 09:56:49,975 INFO L273 TraceCheckUtils]: 60: Hoare triple {10964#(= (_ bv17 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {10974#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,975 INFO L273 TraceCheckUtils]: 61: Hoare triple {10974#(= (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); {10974#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,976 INFO L273 TraceCheckUtils]: 62: Hoare triple {10974#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10974#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,977 INFO L273 TraceCheckUtils]: 63: Hoare triple {10974#(= (bvadd main_~k~0 (_ bv4294967278 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10984#(= (bvadd main_~k~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,977 INFO L273 TraceCheckUtils]: 64: Hoare triple {10984#(= (bvadd main_~k~0 (_ bv4294967277 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); {10984#(= (bvadd main_~k~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,978 INFO L273 TraceCheckUtils]: 65: Hoare triple {10984#(= (bvadd main_~k~0 (_ bv4294967277 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10984#(= (bvadd main_~k~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,979 INFO L273 TraceCheckUtils]: 66: Hoare triple {10984#(= (bvadd main_~k~0 (_ bv4294967277 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {10994#(= (_ bv20 32) main_~k~0)} is VALID [2018-11-23 09:56:49,979 INFO L273 TraceCheckUtils]: 67: Hoare triple {10994#(= (_ bv20 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); {10994#(= (_ bv20 32) main_~k~0)} is VALID [2018-11-23 09:56:49,980 INFO L273 TraceCheckUtils]: 68: Hoare triple {10994#(= (_ bv20 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {10994#(= (_ bv20 32) main_~k~0)} is VALID [2018-11-23 09:56:49,981 INFO L273 TraceCheckUtils]: 69: Hoare triple {10994#(= (_ bv20 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {11004#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,981 INFO L273 TraceCheckUtils]: 70: Hoare triple {11004#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~k~0, 100000bv32);call #t~mem0 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~k~0)), 4bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~s~0)), 4bv32); {11004#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,982 INFO L273 TraceCheckUtils]: 71: Hoare triple {11004#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11004#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,982 INFO L273 TraceCheckUtils]: 72: Hoare triple {11004#(= (bvadd main_~k~0 (_ bv4294967275 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11014#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,983 INFO L273 TraceCheckUtils]: 73: Hoare triple {11014#(= (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); {11014#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,983 INFO L273 TraceCheckUtils]: 74: Hoare triple {11014#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11014#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,984 INFO L273 TraceCheckUtils]: 75: Hoare triple {11014#(= (bvadd main_~k~0 (_ bv4294967274 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11024#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 09:56:49,985 INFO L273 TraceCheckUtils]: 76: Hoare triple {11024#(= (_ bv23 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); {11024#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 09:56:49,985 INFO L273 TraceCheckUtils]: 77: Hoare triple {11024#(= (_ bv23 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11024#(= (_ bv23 32) main_~k~0)} is VALID [2018-11-23 09:56:49,986 INFO L273 TraceCheckUtils]: 78: Hoare triple {11024#(= (_ bv23 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {11034#(= (bvadd main_~k~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,986 INFO L273 TraceCheckUtils]: 79: Hoare triple {11034#(= (bvadd main_~k~0 (_ bv4294967272 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); {11034#(= (bvadd main_~k~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,987 INFO L273 TraceCheckUtils]: 80: Hoare triple {11034#(= (bvadd main_~k~0 (_ bv4294967272 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11034#(= (bvadd main_~k~0 (_ bv4294967272 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,988 INFO L273 TraceCheckUtils]: 81: Hoare triple {11034#(= (bvadd main_~k~0 (_ bv4294967272 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11044#(= (_ bv25 32) main_~k~0)} is VALID [2018-11-23 09:56:49,988 INFO L273 TraceCheckUtils]: 82: Hoare triple {11044#(= (_ bv25 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); {11044#(= (_ bv25 32) main_~k~0)} is VALID [2018-11-23 09:56:49,989 INFO L273 TraceCheckUtils]: 83: Hoare triple {11044#(= (_ bv25 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11044#(= (_ bv25 32) main_~k~0)} is VALID [2018-11-23 09:56:49,990 INFO L273 TraceCheckUtils]: 84: Hoare triple {11044#(= (_ bv25 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {11054#(= (bvadd main_~k~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,990 INFO L273 TraceCheckUtils]: 85: Hoare triple {11054#(= (bvadd main_~k~0 (_ bv4294967270 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); {11054#(= (bvadd main_~k~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,991 INFO L273 TraceCheckUtils]: 86: Hoare triple {11054#(= (bvadd main_~k~0 (_ bv4294967270 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11054#(= (bvadd main_~k~0 (_ bv4294967270 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,991 INFO L273 TraceCheckUtils]: 87: Hoare triple {11054#(= (bvadd main_~k~0 (_ bv4294967270 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11064#(= (_ bv27 32) main_~k~0)} is VALID [2018-11-23 09:56:49,992 INFO L273 TraceCheckUtils]: 88: Hoare triple {11064#(= (_ bv27 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); {11064#(= (_ bv27 32) main_~k~0)} is VALID [2018-11-23 09:56:49,992 INFO L273 TraceCheckUtils]: 89: Hoare triple {11064#(= (_ bv27 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11064#(= (_ bv27 32) main_~k~0)} is VALID [2018-11-23 09:56:49,993 INFO L273 TraceCheckUtils]: 90: Hoare triple {11064#(= (_ bv27 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {11074#(= (bvadd main_~k~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,994 INFO L273 TraceCheckUtils]: 91: Hoare triple {11074#(= (bvadd main_~k~0 (_ bv4294967268 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); {11074#(= (bvadd main_~k~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,994 INFO L273 TraceCheckUtils]: 92: Hoare triple {11074#(= (bvadd main_~k~0 (_ bv4294967268 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11074#(= (bvadd main_~k~0 (_ bv4294967268 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,995 INFO L273 TraceCheckUtils]: 93: Hoare triple {11074#(= (bvadd main_~k~0 (_ bv4294967268 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11084#(= (bvadd main_~k~0 (_ bv4294967267 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,995 INFO L273 TraceCheckUtils]: 94: Hoare triple {11084#(= (bvadd main_~k~0 (_ bv4294967267 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); {11084#(= (bvadd main_~k~0 (_ bv4294967267 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,996 INFO L273 TraceCheckUtils]: 95: Hoare triple {11084#(= (bvadd main_~k~0 (_ bv4294967267 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11084#(= (bvadd main_~k~0 (_ bv4294967267 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,997 INFO L273 TraceCheckUtils]: 96: Hoare triple {11084#(= (bvadd main_~k~0 (_ bv4294967267 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11094#(= (bvadd main_~k~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,997 INFO L273 TraceCheckUtils]: 97: Hoare triple {11094#(= (bvadd main_~k~0 (_ bv4294967266 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); {11094#(= (bvadd main_~k~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,998 INFO L273 TraceCheckUtils]: 98: Hoare triple {11094#(= (bvadd main_~k~0 (_ bv4294967266 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11094#(= (bvadd main_~k~0 (_ bv4294967266 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,998 INFO L273 TraceCheckUtils]: 99: Hoare triple {11094#(= (bvadd main_~k~0 (_ bv4294967266 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11104#(= (bvadd main_~k~0 (_ bv4294967265 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:49,999 INFO L273 TraceCheckUtils]: 100: Hoare triple {11104#(= (bvadd main_~k~0 (_ bv4294967265 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); {11104#(= (bvadd main_~k~0 (_ bv4294967265 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,000 INFO L273 TraceCheckUtils]: 101: Hoare triple {11104#(= (bvadd main_~k~0 (_ bv4294967265 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11104#(= (bvadd main_~k~0 (_ bv4294967265 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,000 INFO L273 TraceCheckUtils]: 102: Hoare triple {11104#(= (bvadd main_~k~0 (_ bv4294967265 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11114#(= (bvadd main_~k~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,001 INFO L273 TraceCheckUtils]: 103: Hoare triple {11114#(= (bvadd main_~k~0 (_ bv4294967264 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); {11114#(= (bvadd main_~k~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,002 INFO L273 TraceCheckUtils]: 104: Hoare triple {11114#(= (bvadd main_~k~0 (_ bv4294967264 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11114#(= (bvadd main_~k~0 (_ bv4294967264 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,002 INFO L273 TraceCheckUtils]: 105: Hoare triple {11114#(= (bvadd main_~k~0 (_ bv4294967264 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11124#(= (bvadd main_~k~0 (_ bv4294967263 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,003 INFO L273 TraceCheckUtils]: 106: Hoare triple {11124#(= (bvadd main_~k~0 (_ bv4294967263 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); {11124#(= (bvadd main_~k~0 (_ bv4294967263 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,003 INFO L273 TraceCheckUtils]: 107: Hoare triple {11124#(= (bvadd main_~k~0 (_ bv4294967263 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11124#(= (bvadd main_~k~0 (_ bv4294967263 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,004 INFO L273 TraceCheckUtils]: 108: Hoare triple {11124#(= (bvadd main_~k~0 (_ bv4294967263 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11134#(= (bvadd main_~k~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,005 INFO L273 TraceCheckUtils]: 109: Hoare triple {11134#(= (bvadd main_~k~0 (_ bv4294967262 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); {11134#(= (bvadd main_~k~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,005 INFO L273 TraceCheckUtils]: 110: Hoare triple {11134#(= (bvadd main_~k~0 (_ bv4294967262 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11134#(= (bvadd main_~k~0 (_ bv4294967262 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,006 INFO L273 TraceCheckUtils]: 111: Hoare triple {11134#(= (bvadd main_~k~0 (_ bv4294967262 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11144#(= (bvadd main_~k~0 (_ bv4294967261 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,006 INFO L273 TraceCheckUtils]: 112: Hoare triple {11144#(= (bvadd main_~k~0 (_ bv4294967261 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); {11144#(= (bvadd main_~k~0 (_ bv4294967261 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,007 INFO L273 TraceCheckUtils]: 113: Hoare triple {11144#(= (bvadd main_~k~0 (_ bv4294967261 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11144#(= (bvadd main_~k~0 (_ bv4294967261 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,008 INFO L273 TraceCheckUtils]: 114: Hoare triple {11144#(= (bvadd main_~k~0 (_ bv4294967261 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11154#(= (bvadd main_~k~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,008 INFO L273 TraceCheckUtils]: 115: Hoare triple {11154#(= (bvadd main_~k~0 (_ bv4294967260 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); {11154#(= (bvadd main_~k~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,009 INFO L273 TraceCheckUtils]: 116: Hoare triple {11154#(= (bvadd main_~k~0 (_ bv4294967260 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11154#(= (bvadd main_~k~0 (_ bv4294967260 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,010 INFO L273 TraceCheckUtils]: 117: Hoare triple {11154#(= (bvadd main_~k~0 (_ bv4294967260 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11164#(= (bvadd main_~k~0 (_ bv4294967259 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,010 INFO L273 TraceCheckUtils]: 118: Hoare triple {11164#(= (bvadd main_~k~0 (_ bv4294967259 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); {11164#(= (bvadd main_~k~0 (_ bv4294967259 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,011 INFO L273 TraceCheckUtils]: 119: Hoare triple {11164#(= (bvadd main_~k~0 (_ bv4294967259 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11164#(= (bvadd main_~k~0 (_ bv4294967259 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,011 INFO L273 TraceCheckUtils]: 120: Hoare triple {11164#(= (bvadd main_~k~0 (_ bv4294967259 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11174#(= (_ bv38 32) main_~k~0)} is VALID [2018-11-23 09:56:50,012 INFO L273 TraceCheckUtils]: 121: Hoare triple {11174#(= (_ bv38 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); {11174#(= (_ bv38 32) main_~k~0)} is VALID [2018-11-23 09:56:50,012 INFO L273 TraceCheckUtils]: 122: Hoare triple {11174#(= (_ bv38 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11174#(= (_ bv38 32) main_~k~0)} is VALID [2018-11-23 09:56:50,013 INFO L273 TraceCheckUtils]: 123: Hoare triple {11174#(= (_ bv38 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {11184#(= (bvadd main_~k~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,013 INFO L273 TraceCheckUtils]: 124: Hoare triple {11184#(= (bvadd main_~k~0 (_ bv4294967257 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); {11184#(= (bvadd main_~k~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,014 INFO L273 TraceCheckUtils]: 125: Hoare triple {11184#(= (bvadd main_~k~0 (_ bv4294967257 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11184#(= (bvadd main_~k~0 (_ bv4294967257 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,015 INFO L273 TraceCheckUtils]: 126: Hoare triple {11184#(= (bvadd main_~k~0 (_ bv4294967257 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11194#(= (bvadd main_~k~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,015 INFO L273 TraceCheckUtils]: 127: Hoare triple {11194#(= (bvadd main_~k~0 (_ bv4294967256 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); {11194#(= (bvadd main_~k~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,016 INFO L273 TraceCheckUtils]: 128: Hoare triple {11194#(= (bvadd main_~k~0 (_ bv4294967256 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11194#(= (bvadd main_~k~0 (_ bv4294967256 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,017 INFO L273 TraceCheckUtils]: 129: Hoare triple {11194#(= (bvadd main_~k~0 (_ bv4294967256 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11204#(= (_ bv41 32) main_~k~0)} is VALID [2018-11-23 09:56:50,017 INFO L273 TraceCheckUtils]: 130: Hoare triple {11204#(= (_ bv41 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); {11204#(= (_ bv41 32) main_~k~0)} is VALID [2018-11-23 09:56:50,018 INFO L273 TraceCheckUtils]: 131: Hoare triple {11204#(= (_ bv41 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11204#(= (_ bv41 32) main_~k~0)} is VALID [2018-11-23 09:56:50,019 INFO L273 TraceCheckUtils]: 132: Hoare triple {11204#(= (_ bv41 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {11214#(= (bvadd main_~k~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,019 INFO L273 TraceCheckUtils]: 133: Hoare triple {11214#(= (bvadd main_~k~0 (_ bv4294967254 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); {11214#(= (bvadd main_~k~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,020 INFO L273 TraceCheckUtils]: 134: Hoare triple {11214#(= (bvadd main_~k~0 (_ bv4294967254 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11214#(= (bvadd main_~k~0 (_ bv4294967254 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,020 INFO L273 TraceCheckUtils]: 135: Hoare triple {11214#(= (bvadd main_~k~0 (_ bv4294967254 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11224#(= (_ bv43 32) main_~k~0)} is VALID [2018-11-23 09:56:50,021 INFO L273 TraceCheckUtils]: 136: Hoare triple {11224#(= (_ bv43 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); {11224#(= (_ bv43 32) main_~k~0)} is VALID [2018-11-23 09:56:50,021 INFO L273 TraceCheckUtils]: 137: Hoare triple {11224#(= (_ bv43 32) main_~k~0)} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11224#(= (_ bv43 32) main_~k~0)} is VALID [2018-11-23 09:56:50,022 INFO L273 TraceCheckUtils]: 138: Hoare triple {11224#(= (_ bv43 32) main_~k~0)} ~k~0 := ~bvadd32(1bv32, ~k~0); {11234#(= (bvadd main_~k~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,023 INFO L273 TraceCheckUtils]: 139: Hoare triple {11234#(= (bvadd main_~k~0 (_ bv4294967252 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); {11234#(= (bvadd main_~k~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,023 INFO L273 TraceCheckUtils]: 140: Hoare triple {11234#(= (bvadd main_~k~0 (_ bv4294967252 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11234#(= (bvadd main_~k~0 (_ bv4294967252 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,024 INFO L273 TraceCheckUtils]: 141: Hoare triple {11234#(= (bvadd main_~k~0 (_ bv4294967252 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11244#(= (bvadd main_~k~0 (_ bv4294967251 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,025 INFO L273 TraceCheckUtils]: 142: Hoare triple {11244#(= (bvadd main_~k~0 (_ bv4294967251 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); {11244#(= (bvadd main_~k~0 (_ bv4294967251 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,025 INFO L273 TraceCheckUtils]: 143: Hoare triple {11244#(= (bvadd main_~k~0 (_ bv4294967251 32)) (_ bv0 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11244#(= (bvadd main_~k~0 (_ bv4294967251 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,026 INFO L273 TraceCheckUtils]: 144: Hoare triple {11244#(= (bvadd main_~k~0 (_ bv4294967251 32)) (_ bv0 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11254#(= (bvadd main_~k~0 (_ bv4294967250 32)) (_ bv0 32))} is VALID [2018-11-23 09:56:50,047 INFO L273 TraceCheckUtils]: 145: Hoare triple {11254#(= (bvadd main_~k~0 (_ bv4294967250 32)) (_ bv0 32))} assume !~bvslt32(~k~0, 100000bv32); {10771#false} is VALID [2018-11-23 09:56:50,047 INFO L273 TraceCheckUtils]: 146: Hoare triple {10771#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); {10771#false} is VALID [2018-11-23 09:56:50,047 INFO L273 TraceCheckUtils]: 147: Hoare triple {10771#false} ~x~0 := 0bv32; {10771#false} is VALID [2018-11-23 09:56:50,047 INFO L273 TraceCheckUtils]: 148: Hoare triple {10771#false} assume !~bvslt32(~x~0, ~i~0); {10771#false} is VALID [2018-11-23 09:56:50,048 INFO L273 TraceCheckUtils]: 149: Hoare triple {10771#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {10771#false} is VALID [2018-11-23 09:56:50,048 INFO L273 TraceCheckUtils]: 150: Hoare triple {10771#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); {10771#false} is VALID [2018-11-23 09:56:50,048 INFO L256 TraceCheckUtils]: 151: Hoare triple {10771#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {10771#false} is VALID [2018-11-23 09:56:50,048 INFO L273 TraceCheckUtils]: 152: Hoare triple {10771#false} ~cond := #in~cond; {10771#false} is VALID [2018-11-23 09:56:50,048 INFO L273 TraceCheckUtils]: 153: Hoare triple {10771#false} assume 0bv32 == ~cond; {10771#false} is VALID [2018-11-23 09:56:50,048 INFO L273 TraceCheckUtils]: 154: Hoare triple {10771#false} assume !false; {10771#false} is VALID [2018-11-23 09:56:50,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:56:50,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:56:57,132 INFO L273 TraceCheckUtils]: 154: Hoare triple {10771#false} assume !false; {10771#false} is VALID [2018-11-23 09:56:57,132 INFO L273 TraceCheckUtils]: 153: Hoare triple {10771#false} assume 0bv32 == ~cond; {10771#false} is VALID [2018-11-23 09:56:57,133 INFO L273 TraceCheckUtils]: 152: Hoare triple {10771#false} ~cond := #in~cond; {10771#false} is VALID [2018-11-23 09:56:57,133 INFO L256 TraceCheckUtils]: 151: Hoare triple {10771#false} call __VERIFIER_assert((if ~bvsge32(#t~mem9, #t~mem10) then 1bv32 else 0bv32)); {10771#false} is VALID [2018-11-23 09:56:57,133 INFO L273 TraceCheckUtils]: 150: Hoare triple {10771#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); {10771#false} is VALID [2018-11-23 09:56:57,133 INFO L273 TraceCheckUtils]: 149: Hoare triple {10771#false} ~x~0 := ~bvadd32(1bv32, ~i~0); {10771#false} is VALID [2018-11-23 09:56:57,134 INFO L273 TraceCheckUtils]: 148: Hoare triple {10771#false} assume !~bvslt32(~x~0, ~i~0); {10771#false} is VALID [2018-11-23 09:56:57,134 INFO L273 TraceCheckUtils]: 147: Hoare triple {10771#false} ~x~0 := 0bv32; {10771#false} is VALID [2018-11-23 09:56:57,134 INFO L273 TraceCheckUtils]: 146: Hoare triple {10771#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); {10771#false} is VALID [2018-11-23 09:56:57,145 INFO L273 TraceCheckUtils]: 145: Hoare triple {11312#(bvslt main_~k~0 (_ bv100000 32))} assume !~bvslt32(~k~0, 100000bv32); {10771#false} is VALID [2018-11-23 09:56:57,147 INFO L273 TraceCheckUtils]: 144: Hoare triple {11316#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11312#(bvslt main_~k~0 (_ bv100000 32))} is VALID [2018-11-23 09:56:57,147 INFO L273 TraceCheckUtils]: 143: Hoare triple {11316#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11316#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,147 INFO L273 TraceCheckUtils]: 142: Hoare triple {11316#(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); {11316#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,153 INFO L273 TraceCheckUtils]: 141: Hoare triple {11326#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11316#(bvslt (bvadd main_~k~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,153 INFO L273 TraceCheckUtils]: 140: Hoare triple {11326#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11326#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,154 INFO L273 TraceCheckUtils]: 139: Hoare triple {11326#(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); {11326#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,162 INFO L273 TraceCheckUtils]: 138: Hoare triple {11336#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11326#(bvslt (bvadd main_~k~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,162 INFO L273 TraceCheckUtils]: 137: Hoare triple {11336#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11336#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,163 INFO L273 TraceCheckUtils]: 136: Hoare triple {11336#(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); {11336#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,169 INFO L273 TraceCheckUtils]: 135: Hoare triple {11346#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11336#(bvslt (bvadd main_~k~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,170 INFO L273 TraceCheckUtils]: 134: Hoare triple {11346#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11346#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,170 INFO L273 TraceCheckUtils]: 133: Hoare triple {11346#(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); {11346#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,177 INFO L273 TraceCheckUtils]: 132: Hoare triple {11356#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11346#(bvslt (bvadd main_~k~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,178 INFO L273 TraceCheckUtils]: 131: Hoare triple {11356#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11356#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,178 INFO L273 TraceCheckUtils]: 130: Hoare triple {11356#(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); {11356#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,182 INFO L273 TraceCheckUtils]: 129: Hoare triple {11366#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11356#(bvslt (bvadd main_~k~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,183 INFO L273 TraceCheckUtils]: 128: Hoare triple {11366#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11366#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,183 INFO L273 TraceCheckUtils]: 127: Hoare triple {11366#(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); {11366#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,189 INFO L273 TraceCheckUtils]: 126: Hoare triple {11376#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11366#(bvslt (bvadd main_~k~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,190 INFO L273 TraceCheckUtils]: 125: Hoare triple {11376#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11376#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,190 INFO L273 TraceCheckUtils]: 124: Hoare triple {11376#(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); {11376#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,195 INFO L273 TraceCheckUtils]: 123: Hoare triple {11386#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11376#(bvslt (bvadd main_~k~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,195 INFO L273 TraceCheckUtils]: 122: Hoare triple {11386#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11386#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,195 INFO L273 TraceCheckUtils]: 121: Hoare triple {11386#(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); {11386#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,200 INFO L273 TraceCheckUtils]: 120: Hoare triple {11396#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11386#(bvslt (bvadd main_~k~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,201 INFO L273 TraceCheckUtils]: 119: Hoare triple {11396#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11396#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,201 INFO L273 TraceCheckUtils]: 118: Hoare triple {11396#(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); {11396#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,208 INFO L273 TraceCheckUtils]: 117: Hoare triple {11406#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11396#(bvslt (bvadd main_~k~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,208 INFO L273 TraceCheckUtils]: 116: Hoare triple {11406#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11406#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,209 INFO L273 TraceCheckUtils]: 115: Hoare triple {11406#(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); {11406#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,217 INFO L273 TraceCheckUtils]: 114: Hoare triple {11416#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11406#(bvslt (bvadd main_~k~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,218 INFO L273 TraceCheckUtils]: 113: Hoare triple {11416#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11416#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,218 INFO L273 TraceCheckUtils]: 112: Hoare triple {11416#(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); {11416#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,223 INFO L273 TraceCheckUtils]: 111: Hoare triple {11426#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11416#(bvslt (bvadd main_~k~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,223 INFO L273 TraceCheckUtils]: 110: Hoare triple {11426#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11426#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,224 INFO L273 TraceCheckUtils]: 109: Hoare triple {11426#(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); {11426#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,231 INFO L273 TraceCheckUtils]: 108: Hoare triple {11436#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11426#(bvslt (bvadd main_~k~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,232 INFO L273 TraceCheckUtils]: 107: Hoare triple {11436#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11436#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,232 INFO L273 TraceCheckUtils]: 106: Hoare triple {11436#(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); {11436#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,239 INFO L273 TraceCheckUtils]: 105: Hoare triple {11446#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11436#(bvslt (bvadd main_~k~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,239 INFO L273 TraceCheckUtils]: 104: Hoare triple {11446#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11446#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,240 INFO L273 TraceCheckUtils]: 103: Hoare triple {11446#(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); {11446#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,247 INFO L273 TraceCheckUtils]: 102: Hoare triple {11456#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11446#(bvslt (bvadd main_~k~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,247 INFO L273 TraceCheckUtils]: 101: Hoare triple {11456#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11456#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,247 INFO L273 TraceCheckUtils]: 100: Hoare triple {11456#(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); {11456#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,252 INFO L273 TraceCheckUtils]: 99: Hoare triple {11466#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11456#(bvslt (bvadd main_~k~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,253 INFO L273 TraceCheckUtils]: 98: Hoare triple {11466#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11466#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,253 INFO L273 TraceCheckUtils]: 97: Hoare triple {11466#(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); {11466#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,258 INFO L273 TraceCheckUtils]: 96: Hoare triple {11476#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11466#(bvslt (bvadd main_~k~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,258 INFO L273 TraceCheckUtils]: 95: Hoare triple {11476#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11476#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,259 INFO L273 TraceCheckUtils]: 94: Hoare triple {11476#(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); {11476#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,265 INFO L273 TraceCheckUtils]: 93: Hoare triple {11486#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11476#(bvslt (bvadd main_~k~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,265 INFO L273 TraceCheckUtils]: 92: Hoare triple {11486#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11486#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,266 INFO L273 TraceCheckUtils]: 91: Hoare triple {11486#(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); {11486#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,273 INFO L273 TraceCheckUtils]: 90: Hoare triple {11496#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11486#(bvslt (bvadd main_~k~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,273 INFO L273 TraceCheckUtils]: 89: Hoare triple {11496#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11496#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,274 INFO L273 TraceCheckUtils]: 88: Hoare triple {11496#(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); {11496#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,278 INFO L273 TraceCheckUtils]: 87: Hoare triple {11506#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11496#(bvslt (bvadd main_~k~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,279 INFO L273 TraceCheckUtils]: 86: Hoare triple {11506#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11506#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,279 INFO L273 TraceCheckUtils]: 85: Hoare triple {11506#(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); {11506#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,286 INFO L273 TraceCheckUtils]: 84: Hoare triple {11516#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11506#(bvslt (bvadd main_~k~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,287 INFO L273 TraceCheckUtils]: 83: Hoare triple {11516#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11516#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,287 INFO L273 TraceCheckUtils]: 82: Hoare triple {11516#(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); {11516#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,294 INFO L273 TraceCheckUtils]: 81: Hoare triple {11526#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11516#(bvslt (bvadd main_~k~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,294 INFO L273 TraceCheckUtils]: 80: Hoare triple {11526#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11526#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,295 INFO L273 TraceCheckUtils]: 79: Hoare triple {11526#(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); {11526#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,301 INFO L273 TraceCheckUtils]: 78: Hoare triple {11536#(bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11526#(bvslt (bvadd main_~k~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,302 INFO L273 TraceCheckUtils]: 77: Hoare triple {11536#(bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11536#(bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,302 INFO L273 TraceCheckUtils]: 76: Hoare triple {11536#(bvslt (bvadd main_~k~0 (_ bv23 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); {11536#(bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,308 INFO L273 TraceCheckUtils]: 75: Hoare triple {11546#(bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11536#(bvslt (bvadd main_~k~0 (_ bv23 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,308 INFO L273 TraceCheckUtils]: 74: Hoare triple {11546#(bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11546#(bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,309 INFO L273 TraceCheckUtils]: 73: Hoare triple {11546#(bvslt (bvadd main_~k~0 (_ bv24 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); {11546#(bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,317 INFO L273 TraceCheckUtils]: 72: Hoare triple {11556#(bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11546#(bvslt (bvadd main_~k~0 (_ bv24 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,318 INFO L273 TraceCheckUtils]: 71: Hoare triple {11556#(bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11556#(bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,318 INFO L273 TraceCheckUtils]: 70: Hoare triple {11556#(bvslt (bvadd main_~k~0 (_ bv25 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); {11556#(bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,322 INFO L273 TraceCheckUtils]: 69: Hoare triple {11566#(bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11556#(bvslt (bvadd main_~k~0 (_ bv25 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,322 INFO L273 TraceCheckUtils]: 68: Hoare triple {11566#(bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11566#(bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,323 INFO L273 TraceCheckUtils]: 67: Hoare triple {11566#(bvslt (bvadd main_~k~0 (_ bv26 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); {11566#(bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,331 INFO L273 TraceCheckUtils]: 66: Hoare triple {11576#(bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11566#(bvslt (bvadd main_~k~0 (_ bv26 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,332 INFO L273 TraceCheckUtils]: 65: Hoare triple {11576#(bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11576#(bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,332 INFO L273 TraceCheckUtils]: 64: Hoare triple {11576#(bvslt (bvadd main_~k~0 (_ bv27 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); {11576#(bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,339 INFO L273 TraceCheckUtils]: 63: Hoare triple {11586#(bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11576#(bvslt (bvadd main_~k~0 (_ bv27 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,340 INFO L273 TraceCheckUtils]: 62: Hoare triple {11586#(bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11586#(bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,340 INFO L273 TraceCheckUtils]: 61: Hoare triple {11586#(bvslt (bvadd main_~k~0 (_ bv28 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); {11586#(bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,349 INFO L273 TraceCheckUtils]: 60: Hoare triple {11596#(bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11586#(bvslt (bvadd main_~k~0 (_ bv28 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,349 INFO L273 TraceCheckUtils]: 59: Hoare triple {11596#(bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11596#(bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,350 INFO L273 TraceCheckUtils]: 58: Hoare triple {11596#(bvslt (bvadd main_~k~0 (_ bv29 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); {11596#(bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,356 INFO L273 TraceCheckUtils]: 57: Hoare triple {11606#(bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11596#(bvslt (bvadd main_~k~0 (_ bv29 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,357 INFO L273 TraceCheckUtils]: 56: Hoare triple {11606#(bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11606#(bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,357 INFO L273 TraceCheckUtils]: 55: Hoare triple {11606#(bvslt (bvadd main_~k~0 (_ bv30 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); {11606#(bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,365 INFO L273 TraceCheckUtils]: 54: Hoare triple {11616#(bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11606#(bvslt (bvadd main_~k~0 (_ bv30 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,366 INFO L273 TraceCheckUtils]: 53: Hoare triple {11616#(bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11616#(bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,366 INFO L273 TraceCheckUtils]: 52: Hoare triple {11616#(bvslt (bvadd main_~k~0 (_ bv31 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); {11616#(bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,370 INFO L273 TraceCheckUtils]: 51: Hoare triple {11626#(bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11616#(bvslt (bvadd main_~k~0 (_ bv31 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,371 INFO L273 TraceCheckUtils]: 50: Hoare triple {11626#(bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11626#(bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,371 INFO L273 TraceCheckUtils]: 49: Hoare triple {11626#(bvslt (bvadd main_~k~0 (_ bv32 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); {11626#(bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,378 INFO L273 TraceCheckUtils]: 48: Hoare triple {11636#(bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11626#(bvslt (bvadd main_~k~0 (_ bv32 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,379 INFO L273 TraceCheckUtils]: 47: Hoare triple {11636#(bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11636#(bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,379 INFO L273 TraceCheckUtils]: 46: Hoare triple {11636#(bvslt (bvadd main_~k~0 (_ bv33 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); {11636#(bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,385 INFO L273 TraceCheckUtils]: 45: Hoare triple {11646#(bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11636#(bvslt (bvadd main_~k~0 (_ bv33 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,385 INFO L273 TraceCheckUtils]: 44: Hoare triple {11646#(bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11646#(bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,386 INFO L273 TraceCheckUtils]: 43: Hoare triple {11646#(bvslt (bvadd main_~k~0 (_ bv34 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); {11646#(bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,391 INFO L273 TraceCheckUtils]: 42: Hoare triple {11656#(bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11646#(bvslt (bvadd main_~k~0 (_ bv34 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,392 INFO L273 TraceCheckUtils]: 41: Hoare triple {11656#(bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11656#(bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,392 INFO L273 TraceCheckUtils]: 40: Hoare triple {11656#(bvslt (bvadd main_~k~0 (_ bv35 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); {11656#(bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,399 INFO L273 TraceCheckUtils]: 39: Hoare triple {11666#(bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11656#(bvslt (bvadd main_~k~0 (_ bv35 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,400 INFO L273 TraceCheckUtils]: 38: Hoare triple {11666#(bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11666#(bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,400 INFO L273 TraceCheckUtils]: 37: Hoare triple {11666#(bvslt (bvadd main_~k~0 (_ bv36 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); {11666#(bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,405 INFO L273 TraceCheckUtils]: 36: Hoare triple {11676#(bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11666#(bvslt (bvadd main_~k~0 (_ bv36 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,406 INFO L273 TraceCheckUtils]: 35: Hoare triple {11676#(bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11676#(bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,406 INFO L273 TraceCheckUtils]: 34: Hoare triple {11676#(bvslt (bvadd main_~k~0 (_ bv37 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); {11676#(bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,412 INFO L273 TraceCheckUtils]: 33: Hoare triple {11686#(bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11676#(bvslt (bvadd main_~k~0 (_ bv37 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,412 INFO L273 TraceCheckUtils]: 32: Hoare triple {11686#(bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11686#(bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,412 INFO L273 TraceCheckUtils]: 31: Hoare triple {11686#(bvslt (bvadd main_~k~0 (_ bv38 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); {11686#(bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,419 INFO L273 TraceCheckUtils]: 30: Hoare triple {11696#(bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11686#(bvslt (bvadd main_~k~0 (_ bv38 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,419 INFO L273 TraceCheckUtils]: 29: Hoare triple {11696#(bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11696#(bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,420 INFO L273 TraceCheckUtils]: 28: Hoare triple {11696#(bvslt (bvadd main_~k~0 (_ bv39 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); {11696#(bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,426 INFO L273 TraceCheckUtils]: 27: Hoare triple {11706#(bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11696#(bvslt (bvadd main_~k~0 (_ bv39 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,426 INFO L273 TraceCheckUtils]: 26: Hoare triple {11706#(bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11706#(bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,427 INFO L273 TraceCheckUtils]: 25: Hoare triple {11706#(bvslt (bvadd main_~k~0 (_ bv40 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); {11706#(bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,433 INFO L273 TraceCheckUtils]: 24: Hoare triple {11716#(bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11706#(bvslt (bvadd main_~k~0 (_ bv40 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,434 INFO L273 TraceCheckUtils]: 23: Hoare triple {11716#(bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11716#(bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,434 INFO L273 TraceCheckUtils]: 22: Hoare triple {11716#(bvslt (bvadd main_~k~0 (_ bv41 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); {11716#(bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,439 INFO L273 TraceCheckUtils]: 21: Hoare triple {11726#(bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11716#(bvslt (bvadd main_~k~0 (_ bv41 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,440 INFO L273 TraceCheckUtils]: 20: Hoare triple {11726#(bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11726#(bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {11726#(bvslt (bvadd main_~k~0 (_ bv42 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); {11726#(bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,446 INFO L273 TraceCheckUtils]: 18: Hoare triple {11736#(bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11726#(bvslt (bvadd main_~k~0 (_ bv42 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,447 INFO L273 TraceCheckUtils]: 17: Hoare triple {11736#(bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11736#(bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,447 INFO L273 TraceCheckUtils]: 16: Hoare triple {11736#(bvslt (bvadd main_~k~0 (_ bv43 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); {11736#(bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,451 INFO L273 TraceCheckUtils]: 15: Hoare triple {11746#(bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11736#(bvslt (bvadd main_~k~0 (_ bv43 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,452 INFO L273 TraceCheckUtils]: 14: Hoare triple {11746#(bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11746#(bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,452 INFO L273 TraceCheckUtils]: 13: Hoare triple {11746#(bvslt (bvadd main_~k~0 (_ bv44 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); {11746#(bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,457 INFO L273 TraceCheckUtils]: 12: Hoare triple {11756#(bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11746#(bvslt (bvadd main_~k~0 (_ bv44 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {11756#(bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32))} assume !~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1; {11756#(bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,458 INFO L273 TraceCheckUtils]: 10: Hoare triple {11756#(bvslt (bvadd main_~k~0 (_ bv45 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); {11756#(bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,464 INFO L273 TraceCheckUtils]: 9: Hoare triple {11766#(bvslt (bvadd main_~k~0 (_ bv46 32)) (_ bv100000 32))} ~k~0 := ~bvadd32(1bv32, ~k~0); {11756#(bvslt (bvadd main_~k~0 (_ bv45 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,465 INFO L273 TraceCheckUtils]: 8: Hoare triple {11766#(bvslt (bvadd main_~k~0 (_ bv46 32)) (_ bv100000 32))} assume ~bvsgt32(#t~mem0, #t~mem1);havoc #t~mem0;havoc #t~mem1;~s~0 := ~k~0; {11766#(bvslt (bvadd main_~k~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,465 INFO L273 TraceCheckUtils]: 7: Hoare triple {11766#(bvslt (bvadd main_~k~0 (_ bv46 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); {11766#(bvslt (bvadd main_~k~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,466 INFO L273 TraceCheckUtils]: 6: Hoare triple {11776#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);~k~0 := ~i~0;~s~0 := ~bvadd32(1bv32, ~i~0); {11766#(bvslt (bvadd main_~k~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,467 INFO L273 TraceCheckUtils]: 5: Hoare triple {10770#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32;havoc ~x~0;havoc ~y~0; {11776#(bvslt (bvadd main_~i~0 (_ bv46 32)) (_ bv100000 32))} is VALID [2018-11-23 09:56:57,467 INFO L256 TraceCheckUtils]: 4: Hoare triple {10770#true} call #t~ret15 := main(); {10770#true} is VALID [2018-11-23 09:56:57,467 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {10770#true} {10770#true} #130#return; {10770#true} is VALID [2018-11-23 09:56:57,468 INFO L273 TraceCheckUtils]: 2: Hoare triple {10770#true} assume true; {10770#true} is VALID [2018-11-23 09:56:57,468 INFO L273 TraceCheckUtils]: 1: Hoare triple {10770#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {10770#true} is VALID [2018-11-23 09:56:57,468 INFO L256 TraceCheckUtils]: 0: Hoare triple {10770#true} call ULTIMATE.init(); {10770#true} is VALID [2018-11-23 09:56:57,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:56:57,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:56:57,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 98 [2018-11-23 09:56:57,501 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 155 [2018-11-23 09:56:57,503 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:56:57,503 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 98 states. [2018-11-23 09:56:58,304 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:56:58,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-11-23 09:56:58,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-11-23 09:56:58,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2403, Invalid=7103, Unknown=0, NotChecked=0, Total=9506 [2018-11-23 09:56:58,309 INFO L87 Difference]: Start difference. First operand 466 states and 617 transitions. Second operand 98 states. [2018-11-23 09:57:33,535 WARN L180 SmtUtils]: Spent 470.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 10 [2018-11-23 09:57:35,674 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 10 [2018-11-23 09:57:37,917 WARN L180 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 10 [2018-11-23 09:57:40,298 WARN L180 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 10 [2018-11-23 09:57:42,765 WARN L180 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 10 [2018-11-23 09:57:45,328 WARN L180 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 10 [2018-11-23 09:57:48,166 WARN L180 SmtUtils]: Spent 575.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 10 [2018-11-23 09:57:50,850 WARN L180 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 10 [2018-11-23 09:57:53,595 WARN L180 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 10 [2018-11-23 09:57:56,417 WARN L180 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 10 [2018-11-23 09:57:59,187 WARN L180 SmtUtils]: Spent 322.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 10 [2018-11-23 09:58:02,079 WARN L180 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 10 [2018-11-23 09:58:04,897 WARN L180 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 10 [2018-11-23 09:58:07,738 WARN L180 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 10 [2018-11-23 09:58:10,618 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 10 [2018-11-23 09:58:13,379 WARN L180 SmtUtils]: Spent 257.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 10 [2018-11-23 09:58:16,198 WARN L180 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 10 [2018-11-23 09:58:19,004 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 10 [2018-11-23 09:58:21,775 WARN L180 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 10 [2018-11-23 09:58:24,507 WARN L180 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 10