java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/array-examples/standard_copy7_true-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 10:02:30,488 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 10:02:30,492 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 10:02:30,508 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 10:02:30,508 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 10:02:30,509 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 10:02:30,512 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 10:02:30,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 10:02:30,517 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 10:02:30,519 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 10:02:30,521 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 10:02:30,522 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 10:02:30,523 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 10:02:30,524 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 10:02:30,527 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 10:02:30,528 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 10:02:30,529 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 10:02:30,538 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 10:02:30,540 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 10:02:30,545 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 10:02:30,546 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 10:02:30,549 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 10:02:30,551 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 10:02:30,551 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 10:02:30,554 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 10:02:30,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 10:02:30,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 10:02:30,558 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 10:02:30,559 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 10:02:30,560 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 10:02:30,560 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 10:02:30,562 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 10:02:30,563 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 10:02:30,563 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 10:02:30,565 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 10:02:30,566 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 10:02:30,566 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 10:02:30,589 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 10:02:30,590 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 10:02:30,591 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 10:02:30,591 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 10:02:30,592 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 10:02:30,592 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 10:02:30,592 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 10:02:30,592 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 10:02:30,592 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 10:02:30,593 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 10:02:30,593 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 10:02:30,594 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 10:02:30,594 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 10:02:30,594 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 10:02:30,594 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 10:02:30,595 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 10:02:30,595 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 10:02:30,596 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 10:02:30,596 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 10:02:30,596 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 10:02:30,596 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 10:02:30,596 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 10:02:30,597 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 10:02:30,597 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 10:02:30,597 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 10:02:30,597 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 10:02:30,597 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 10:02:30,598 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 10:02:30,598 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 10:02:30,598 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 10:02:30,598 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 10:02:30,599 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 10:02:30,599 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 10:02:30,653 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 10:02:30,666 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 10:02:30,669 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 10:02:30,671 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 10:02:30,671 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 10:02:30,672 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copy7_true-unreach-call_ground.i [2018-11-23 10:02:30,730 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b386962e/37aa5a2f387642db9c9b5df17efd5d65/FLAG3dfa49cb1 [2018-11-23 10:02:31,251 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 10:02:31,252 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copy7_true-unreach-call_ground.i [2018-11-23 10:02:31,261 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b386962e/37aa5a2f387642db9c9b5df17efd5d65/FLAG3dfa49cb1 [2018-11-23 10:02:31,577 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b386962e/37aa5a2f387642db9c9b5df17efd5d65 [2018-11-23 10:02:31,588 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 10:02:31,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 10:02:31,591 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:31,591 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 10:02:31,598 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 10:02:31,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,603 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47287552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:31, skipping insertion in model container [2018-11-23 10:02:31,604 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:02:31" (1/1) ... [2018-11-23 10:02:31,615 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 10:02:31,642 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 10:02:31,946 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:31,958 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 10:02:32,001 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 10:02:32,034 INFO L195 MainTranslator]: Completed translation [2018-11-23 10:02:32,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:32 WrapperNode [2018-11-23 10:02:32,035 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 10:02:32,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:32,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 10:02:32,036 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 10:02:32,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:32" (1/1) ... [2018-11-23 10:02:32,061 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:32" (1/1) ... [2018-11-23 10:02:32,073 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 10:02:32,074 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 10:02:32,074 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 10:02:32,074 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 10:02:32,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:32" (1/1) ... [2018-11-23 10:02:32,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:32" (1/1) ... [2018-11-23 10:02:32,096 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:32" (1/1) ... [2018-11-23 10:02:32,101 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:32" (1/1) ... [2018-11-23 10:02:32,131 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:32" (1/1) ... [2018-11-23 10:02:32,215 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:32" (1/1) ... [2018-11-23 10:02:32,217 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:32" (1/1) ... [2018-11-23 10:02:32,221 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 10:02:32,222 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 10:02:32,222 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 10:02:32,222 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 10:02:32,223 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:32" (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 10:02:32,288 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 10:02:32,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 10:02:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 10:02:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 10:02:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 10:02:32,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 10:02:32,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 10:02:32,290 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 10:02:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 10:02:32,290 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 10:02:32,290 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 10:02:32,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 10:02:33,393 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 10:02:33,394 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2018-11-23 10:02:33,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:33 BoogieIcfgContainer [2018-11-23 10:02:33,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 10:02:33,395 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 10:02:33,396 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 10:02:33,399 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 10:02:33,399 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:02:31" (1/3) ... [2018-11-23 10:02:33,400 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a7be18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:33, skipping insertion in model container [2018-11-23 10:02:33,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:02:32" (2/3) ... [2018-11-23 10:02:33,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64a7be18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:02:33, skipping insertion in model container [2018-11-23 10:02:33,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:02:33" (3/3) ... [2018-11-23 10:02:33,403 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copy7_true-unreach-call_ground.i [2018-11-23 10:02:33,411 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 10:02:33,419 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 10:02:33,438 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 10:02:33,472 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 10:02:33,473 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 10:02:33,473 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 10:02:33,473 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 10:02:33,474 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 10:02:33,474 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 10:02:33,474 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 10:02:33,474 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 10:02:33,474 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 10:02:33,494 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2018-11-23 10:02:33,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:02:33,502 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:33,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:33,506 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:33,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:33,513 INFO L82 PathProgramCache]: Analyzing trace with hash -2029657296, now seen corresponding path program 1 times [2018-11-23 10:02:33,518 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:33,519 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 10:02:33,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:33,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:33,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:33,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:33,897 INFO L256 TraceCheckUtils]: 0: Hoare triple {48#true} call ULTIMATE.init(); {48#true} is VALID [2018-11-23 10:02:33,902 INFO L273 TraceCheckUtils]: 1: Hoare triple {48#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {48#true} is VALID [2018-11-23 10:02:33,903 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#true} assume true; {48#true} is VALID [2018-11-23 10:02:33,903 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {48#true} {48#true} #147#return; {48#true} is VALID [2018-11-23 10:02:33,904 INFO L256 TraceCheckUtils]: 4: Hoare triple {48#true} call #t~ret19 := main(); {48#true} is VALID [2018-11-23 10:02:33,904 INFO L273 TraceCheckUtils]: 5: Hoare triple {48#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {48#true} is VALID [2018-11-23 10:02:33,917 INFO L273 TraceCheckUtils]: 6: Hoare triple {48#true} assume !true; {49#false} is VALID [2018-11-23 10:02:33,917 INFO L273 TraceCheckUtils]: 7: Hoare triple {49#false} havoc ~i~0;~i~0 := 0bv32; {49#false} is VALID [2018-11-23 10:02:33,918 INFO L273 TraceCheckUtils]: 8: Hoare triple {49#false} assume !~bvslt32(~i~0, 100000bv32); {49#false} is VALID [2018-11-23 10:02:33,918 INFO L273 TraceCheckUtils]: 9: Hoare triple {49#false} ~i~0 := 0bv32; {49#false} is VALID [2018-11-23 10:02:33,919 INFO L273 TraceCheckUtils]: 10: Hoare triple {49#false} assume !~bvslt32(~i~0, 100000bv32); {49#false} is VALID [2018-11-23 10:02:33,919 INFO L273 TraceCheckUtils]: 11: Hoare triple {49#false} ~i~0 := 0bv32; {49#false} is VALID [2018-11-23 10:02:33,919 INFO L273 TraceCheckUtils]: 12: Hoare triple {49#false} assume !~bvslt32(~i~0, 100000bv32); {49#false} is VALID [2018-11-23 10:02:33,920 INFO L273 TraceCheckUtils]: 13: Hoare triple {49#false} ~i~0 := 0bv32; {49#false} is VALID [2018-11-23 10:02:33,920 INFO L273 TraceCheckUtils]: 14: Hoare triple {49#false} assume !~bvslt32(~i~0, 100000bv32); {49#false} is VALID [2018-11-23 10:02:33,920 INFO L273 TraceCheckUtils]: 15: Hoare triple {49#false} ~i~0 := 0bv32; {49#false} is VALID [2018-11-23 10:02:33,921 INFO L273 TraceCheckUtils]: 16: Hoare triple {49#false} assume !~bvslt32(~i~0, 100000bv32); {49#false} is VALID [2018-11-23 10:02:33,921 INFO L273 TraceCheckUtils]: 17: Hoare triple {49#false} ~i~0 := 0bv32; {49#false} is VALID [2018-11-23 10:02:33,922 INFO L273 TraceCheckUtils]: 18: Hoare triple {49#false} assume !true; {49#false} is VALID [2018-11-23 10:02:33,922 INFO L273 TraceCheckUtils]: 19: Hoare triple {49#false} ~i~0 := 0bv32; {49#false} is VALID [2018-11-23 10:02:33,922 INFO L273 TraceCheckUtils]: 20: Hoare triple {49#false} assume !true; {49#false} is VALID [2018-11-23 10:02:33,923 INFO L273 TraceCheckUtils]: 21: Hoare triple {49#false} havoc ~x~0;~x~0 := 0bv32; {49#false} is VALID [2018-11-23 10:02:33,923 INFO L273 TraceCheckUtils]: 22: Hoare triple {49#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem18 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {49#false} is VALID [2018-11-23 10:02:33,924 INFO L256 TraceCheckUtils]: 23: Hoare triple {49#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1bv32 else 0bv32)); {49#false} is VALID [2018-11-23 10:02:33,924 INFO L273 TraceCheckUtils]: 24: Hoare triple {49#false} ~cond := #in~cond; {49#false} is VALID [2018-11-23 10:02:33,925 INFO L273 TraceCheckUtils]: 25: Hoare triple {49#false} assume 0bv32 == ~cond; {49#false} is VALID [2018-11-23 10:02:33,925 INFO L273 TraceCheckUtils]: 26: Hoare triple {49#false} assume !false; {49#false} is VALID [2018-11-23 10:02:33,930 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 10:02:33,931 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:33,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:33,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 10:02:33,947 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 10:02:33,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:33,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 10:02:34,146 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:34,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 10:02:34,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 10:02:34,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 10:02:34,157 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2018-11-23 10:02:34,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:34,362 INFO L93 Difference]: Finished difference Result 82 states and 117 transitions. [2018-11-23 10:02:34,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 10:02:34,363 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 27 [2018-11-23 10:02:34,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:34,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 10:02:34,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 10:02:34,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 117 transitions. [2018-11-23 10:02:34,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 117 transitions. [2018-11-23 10:02:35,215 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 10:02:35,227 INFO L225 Difference]: With dead ends: 82 [2018-11-23 10:02:35,227 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 10:02:35,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 26 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 10:02:35,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 10:02:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 10:02:35,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:35,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 40 states. [2018-11-23 10:02:35,320 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 10:02:35,320 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 10:02:35,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,325 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 10:02:35,325 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 10:02:35,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,327 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 40 states. [2018-11-23 10:02:35,327 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 40 states. [2018-11-23 10:02:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,332 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2018-11-23 10:02:35,332 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 10:02:35,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:35,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:35,334 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:35,334 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:35,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 10:02:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 10:02:35,339 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 27 [2018-11-23 10:02:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:35,343 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 10:02:35,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 10:02:35,343 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 10:02:35,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 10:02:35,344 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:35,345 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:35,345 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:35,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:35,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2073025378, now seen corresponding path program 1 times [2018-11-23 10:02:35,346 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:35,346 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 10:02:35,367 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:35,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:35,444 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:35,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {372#true} call ULTIMATE.init(); {372#true} is VALID [2018-11-23 10:02:35,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {372#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {372#true} is VALID [2018-11-23 10:02:35,542 INFO L273 TraceCheckUtils]: 2: Hoare triple {372#true} assume true; {372#true} is VALID [2018-11-23 10:02:35,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {372#true} {372#true} #147#return; {372#true} is VALID [2018-11-23 10:02:35,543 INFO L256 TraceCheckUtils]: 4: Hoare triple {372#true} call #t~ret19 := main(); {372#true} is VALID [2018-11-23 10:02:35,555 INFO L273 TraceCheckUtils]: 5: Hoare triple {372#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {392#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:35,568 INFO L273 TraceCheckUtils]: 6: Hoare triple {392#(= main_~a~0 (_ bv0 32))} assume !~bvslt32(~a~0, 100000bv32); {373#false} is VALID [2018-11-23 10:02:35,569 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#false} havoc ~i~0;~i~0 := 0bv32; {373#false} is VALID [2018-11-23 10:02:35,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {373#false} assume !~bvslt32(~i~0, 100000bv32); {373#false} is VALID [2018-11-23 10:02:35,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {373#false} ~i~0 := 0bv32; {373#false} is VALID [2018-11-23 10:02:35,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {373#false} assume !~bvslt32(~i~0, 100000bv32); {373#false} is VALID [2018-11-23 10:02:35,570 INFO L273 TraceCheckUtils]: 11: Hoare triple {373#false} ~i~0 := 0bv32; {373#false} is VALID [2018-11-23 10:02:35,571 INFO L273 TraceCheckUtils]: 12: Hoare triple {373#false} assume !~bvslt32(~i~0, 100000bv32); {373#false} is VALID [2018-11-23 10:02:35,571 INFO L273 TraceCheckUtils]: 13: Hoare triple {373#false} ~i~0 := 0bv32; {373#false} is VALID [2018-11-23 10:02:35,571 INFO L273 TraceCheckUtils]: 14: Hoare triple {373#false} assume !~bvslt32(~i~0, 100000bv32); {373#false} is VALID [2018-11-23 10:02:35,572 INFO L273 TraceCheckUtils]: 15: Hoare triple {373#false} ~i~0 := 0bv32; {373#false} is VALID [2018-11-23 10:02:35,572 INFO L273 TraceCheckUtils]: 16: Hoare triple {373#false} assume !~bvslt32(~i~0, 100000bv32); {373#false} is VALID [2018-11-23 10:02:35,572 INFO L273 TraceCheckUtils]: 17: Hoare triple {373#false} ~i~0 := 0bv32; {373#false} is VALID [2018-11-23 10:02:35,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {373#false} assume !~bvslt32(~i~0, 100000bv32); {373#false} is VALID [2018-11-23 10:02:35,573 INFO L273 TraceCheckUtils]: 19: Hoare triple {373#false} ~i~0 := 0bv32; {373#false} is VALID [2018-11-23 10:02:35,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {373#false} assume !~bvslt32(~i~0, 100000bv32); {373#false} is VALID [2018-11-23 10:02:35,574 INFO L273 TraceCheckUtils]: 21: Hoare triple {373#false} havoc ~x~0;~x~0 := 0bv32; {373#false} is VALID [2018-11-23 10:02:35,574 INFO L273 TraceCheckUtils]: 22: Hoare triple {373#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem18 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {373#false} is VALID [2018-11-23 10:02:35,574 INFO L256 TraceCheckUtils]: 23: Hoare triple {373#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1bv32 else 0bv32)); {373#false} is VALID [2018-11-23 10:02:35,575 INFO L273 TraceCheckUtils]: 24: Hoare triple {373#false} ~cond := #in~cond; {373#false} is VALID [2018-11-23 10:02:35,575 INFO L273 TraceCheckUtils]: 25: Hoare triple {373#false} assume 0bv32 == ~cond; {373#false} is VALID [2018-11-23 10:02:35,575 INFO L273 TraceCheckUtils]: 26: Hoare triple {373#false} assume !false; {373#false} is VALID [2018-11-23 10:02:35,577 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 10:02:35,577 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 10:02:35,581 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:35,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:35,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:02:35,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:35,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:35,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:35,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:35,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:35,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:35,685 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 3 states. [2018-11-23 10:02:35,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:35,951 INFO L93 Difference]: Finished difference Result 74 states and 90 transitions. [2018-11-23 10:02:35,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:35,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-11-23 10:02:35,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 10:02:35,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:35,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2018-11-23 10:02:35,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2018-11-23 10:02:36,319 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:36,321 INFO L225 Difference]: With dead ends: 74 [2018-11-23 10:02:36,322 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 10:02:36,323 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:36,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 10:02:36,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 10:02:36,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:36,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 10:02:36,346 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 10:02:36,347 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 10:02:36,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,349 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 10:02:36,350 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 10:02:36,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:36,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:36,352 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 10:02:36,352 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 10:02:36,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:36,359 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2018-11-23 10:02:36,359 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 50 transitions. [2018-11-23 10:02:36,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:36,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:36,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:36,364 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:36,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 10:02:36,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-11-23 10:02:36,367 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 27 [2018-11-23 10:02:36,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:36,367 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-11-23 10:02:36,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:36,368 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2018-11-23 10:02:36,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 10:02:36,369 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:36,369 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:36,370 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:36,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:36,370 INFO L82 PathProgramCache]: Analyzing trace with hash -55785284, now seen corresponding path program 1 times [2018-11-23 10:02:36,371 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:36,371 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 10:02:36,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 10:02:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:36,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:36,470 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:36,541 INFO L256 TraceCheckUtils]: 0: Hoare triple {696#true} call ULTIMATE.init(); {696#true} is VALID [2018-11-23 10:02:36,541 INFO L273 TraceCheckUtils]: 1: Hoare triple {696#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {696#true} is VALID [2018-11-23 10:02:36,541 INFO L273 TraceCheckUtils]: 2: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-23 10:02:36,542 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {696#true} {696#true} #147#return; {696#true} is VALID [2018-11-23 10:02:36,542 INFO L256 TraceCheckUtils]: 4: Hoare triple {696#true} call #t~ret19 := main(); {696#true} is VALID [2018-11-23 10:02:36,559 INFO L273 TraceCheckUtils]: 5: Hoare triple {696#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {716#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:36,573 INFO L273 TraceCheckUtils]: 6: Hoare triple {716#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {716#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:36,574 INFO L273 TraceCheckUtils]: 7: Hoare triple {716#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {723#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:36,577 INFO L273 TraceCheckUtils]: 8: Hoare triple {723#(= (_ bv1 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,577 INFO L273 TraceCheckUtils]: 9: Hoare triple {697#false} havoc ~i~0;~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,577 INFO L273 TraceCheckUtils]: 10: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,578 INFO L273 TraceCheckUtils]: 11: Hoare triple {697#false} ~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,578 INFO L273 TraceCheckUtils]: 12: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,578 INFO L273 TraceCheckUtils]: 13: Hoare triple {697#false} ~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,578 INFO L273 TraceCheckUtils]: 14: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,579 INFO L273 TraceCheckUtils]: 15: Hoare triple {697#false} ~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,579 INFO L273 TraceCheckUtils]: 16: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,579 INFO L273 TraceCheckUtils]: 17: Hoare triple {697#false} ~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,579 INFO L273 TraceCheckUtils]: 18: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,580 INFO L273 TraceCheckUtils]: 19: Hoare triple {697#false} ~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,580 INFO L273 TraceCheckUtils]: 20: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,581 INFO L273 TraceCheckUtils]: 21: Hoare triple {697#false} ~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,581 INFO L273 TraceCheckUtils]: 22: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,581 INFO L273 TraceCheckUtils]: 23: Hoare triple {697#false} havoc ~x~0;~x~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,582 INFO L273 TraceCheckUtils]: 24: Hoare triple {697#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem18 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {697#false} is VALID [2018-11-23 10:02:36,582 INFO L256 TraceCheckUtils]: 25: Hoare triple {697#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1bv32 else 0bv32)); {697#false} is VALID [2018-11-23 10:02:36,582 INFO L273 TraceCheckUtils]: 26: Hoare triple {697#false} ~cond := #in~cond; {697#false} is VALID [2018-11-23 10:02:36,583 INFO L273 TraceCheckUtils]: 27: Hoare triple {697#false} assume 0bv32 == ~cond; {697#false} is VALID [2018-11-23 10:02:36,583 INFO L273 TraceCheckUtils]: 28: Hoare triple {697#false} assume !false; {697#false} is VALID [2018-11-23 10:02:36,584 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 10:02:36,584 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:36,687 INFO L273 TraceCheckUtils]: 28: Hoare triple {697#false} assume !false; {697#false} is VALID [2018-11-23 10:02:36,687 INFO L273 TraceCheckUtils]: 27: Hoare triple {697#false} assume 0bv32 == ~cond; {697#false} is VALID [2018-11-23 10:02:36,688 INFO L273 TraceCheckUtils]: 26: Hoare triple {697#false} ~cond := #in~cond; {697#false} is VALID [2018-11-23 10:02:36,688 INFO L256 TraceCheckUtils]: 25: Hoare triple {697#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1bv32 else 0bv32)); {697#false} is VALID [2018-11-23 10:02:36,689 INFO L273 TraceCheckUtils]: 24: Hoare triple {697#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem18 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {697#false} is VALID [2018-11-23 10:02:36,689 INFO L273 TraceCheckUtils]: 23: Hoare triple {697#false} havoc ~x~0;~x~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,689 INFO L273 TraceCheckUtils]: 22: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,690 INFO L273 TraceCheckUtils]: 21: Hoare triple {697#false} ~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,690 INFO L273 TraceCheckUtils]: 20: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,690 INFO L273 TraceCheckUtils]: 19: Hoare triple {697#false} ~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,691 INFO L273 TraceCheckUtils]: 18: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,691 INFO L273 TraceCheckUtils]: 17: Hoare triple {697#false} ~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,691 INFO L273 TraceCheckUtils]: 16: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,691 INFO L273 TraceCheckUtils]: 15: Hoare triple {697#false} ~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,692 INFO L273 TraceCheckUtils]: 14: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,692 INFO L273 TraceCheckUtils]: 13: Hoare triple {697#false} ~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,692 INFO L273 TraceCheckUtils]: 12: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,693 INFO L273 TraceCheckUtils]: 11: Hoare triple {697#false} ~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,693 INFO L273 TraceCheckUtils]: 10: Hoare triple {697#false} assume !~bvslt32(~i~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,693 INFO L273 TraceCheckUtils]: 9: Hoare triple {697#false} havoc ~i~0;~i~0 := 0bv32; {697#false} is VALID [2018-11-23 10:02:36,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {847#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {697#false} is VALID [2018-11-23 10:02:36,705 INFO L273 TraceCheckUtils]: 7: Hoare triple {851#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {847#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:36,706 INFO L273 TraceCheckUtils]: 6: Hoare triple {851#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {851#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,710 INFO L273 TraceCheckUtils]: 5: Hoare triple {696#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {851#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:36,711 INFO L256 TraceCheckUtils]: 4: Hoare triple {696#true} call #t~ret19 := main(); {696#true} is VALID [2018-11-23 10:02:36,711 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {696#true} {696#true} #147#return; {696#true} is VALID [2018-11-23 10:02:36,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {696#true} assume true; {696#true} is VALID [2018-11-23 10:02:36,712 INFO L273 TraceCheckUtils]: 1: Hoare triple {696#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {696#true} is VALID [2018-11-23 10:02:36,712 INFO L256 TraceCheckUtils]: 0: Hoare triple {696#true} call ULTIMATE.init(); {696#true} is VALID [2018-11-23 10:02:36,714 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 10:02:36,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:36,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:36,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-23 10:02:36,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:36,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:36,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:36,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:36,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:36,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:36,785 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 6 states. [2018-11-23 10:02:37,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,286 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2018-11-23 10:02:37,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:37,287 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-11-23 10:02:37,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:37,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:37,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2018-11-23 10:02:37,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:37,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 97 transitions. [2018-11-23 10:02:37,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 97 transitions. [2018-11-23 10:02:37,446 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:37,449 INFO L225 Difference]: With dead ends: 79 [2018-11-23 10:02:37,449 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 10:02:37,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:37,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 10:02:37,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-11-23 10:02:37,480 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:37,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 47 states. [2018-11-23 10:02:37,481 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 10:02:37,481 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 10:02:37,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,484 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-23 10:02:37,484 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 10:02:37,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:37,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:37,485 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 47 states. [2018-11-23 10:02:37,486 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 47 states. [2018-11-23 10:02:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:37,488 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2018-11-23 10:02:37,489 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 10:02:37,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:37,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:37,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:37,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:37,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-23 10:02:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-23 10:02:37,492 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 29 [2018-11-23 10:02:37,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:37,492 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-23 10:02:37,492 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2018-11-23 10:02:37,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-11-23 10:02:37,494 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:37,494 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:37,494 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:37,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:37,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1735317526, now seen corresponding path program 2 times [2018-11-23 10:02:37,495 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:37,495 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 10:02:37,514 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:37,558 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 10:02:37,558 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:37,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:37,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:37,653 INFO L256 TraceCheckUtils]: 0: Hoare triple {1145#true} call ULTIMATE.init(); {1145#true} is VALID [2018-11-23 10:02:37,654 INFO L273 TraceCheckUtils]: 1: Hoare triple {1145#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1145#true} is VALID [2018-11-23 10:02:37,654 INFO L273 TraceCheckUtils]: 2: Hoare triple {1145#true} assume true; {1145#true} is VALID [2018-11-23 10:02:37,654 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1145#true} {1145#true} #147#return; {1145#true} is VALID [2018-11-23 10:02:37,654 INFO L256 TraceCheckUtils]: 4: Hoare triple {1145#true} call #t~ret19 := main(); {1145#true} is VALID [2018-11-23 10:02:37,655 INFO L273 TraceCheckUtils]: 5: Hoare triple {1145#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1145#true} is VALID [2018-11-23 10:02:37,655 INFO L273 TraceCheckUtils]: 6: Hoare triple {1145#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1145#true} is VALID [2018-11-23 10:02:37,655 INFO L273 TraceCheckUtils]: 7: Hoare triple {1145#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1145#true} is VALID [2018-11-23 10:02:37,655 INFO L273 TraceCheckUtils]: 8: Hoare triple {1145#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1145#true} is VALID [2018-11-23 10:02:37,656 INFO L273 TraceCheckUtils]: 9: Hoare triple {1145#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1145#true} is VALID [2018-11-23 10:02:37,656 INFO L273 TraceCheckUtils]: 10: Hoare triple {1145#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1145#true} is VALID [2018-11-23 10:02:37,656 INFO L273 TraceCheckUtils]: 11: Hoare triple {1145#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1145#true} is VALID [2018-11-23 10:02:37,657 INFO L273 TraceCheckUtils]: 12: Hoare triple {1145#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1145#true} is VALID [2018-11-23 10:02:37,657 INFO L273 TraceCheckUtils]: 13: Hoare triple {1145#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1145#true} is VALID [2018-11-23 10:02:37,657 INFO L273 TraceCheckUtils]: 14: Hoare triple {1145#true} assume !~bvslt32(~a~0, 100000bv32); {1145#true} is VALID [2018-11-23 10:02:37,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {1145#true} havoc ~i~0;~i~0 := 0bv32; {1195#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:37,673 INFO L273 TraceCheckUtils]: 16: Hoare triple {1195#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1146#false} is VALID [2018-11-23 10:02:37,674 INFO L273 TraceCheckUtils]: 17: Hoare triple {1146#false} ~i~0 := 0bv32; {1146#false} is VALID [2018-11-23 10:02:37,674 INFO L273 TraceCheckUtils]: 18: Hoare triple {1146#false} assume !~bvslt32(~i~0, 100000bv32); {1146#false} is VALID [2018-11-23 10:02:37,674 INFO L273 TraceCheckUtils]: 19: Hoare triple {1146#false} ~i~0 := 0bv32; {1146#false} is VALID [2018-11-23 10:02:37,675 INFO L273 TraceCheckUtils]: 20: Hoare triple {1146#false} assume !~bvslt32(~i~0, 100000bv32); {1146#false} is VALID [2018-11-23 10:02:37,675 INFO L273 TraceCheckUtils]: 21: Hoare triple {1146#false} ~i~0 := 0bv32; {1146#false} is VALID [2018-11-23 10:02:37,675 INFO L273 TraceCheckUtils]: 22: Hoare triple {1146#false} assume !~bvslt32(~i~0, 100000bv32); {1146#false} is VALID [2018-11-23 10:02:37,675 INFO L273 TraceCheckUtils]: 23: Hoare triple {1146#false} ~i~0 := 0bv32; {1146#false} is VALID [2018-11-23 10:02:37,676 INFO L273 TraceCheckUtils]: 24: Hoare triple {1146#false} assume !~bvslt32(~i~0, 100000bv32); {1146#false} is VALID [2018-11-23 10:02:37,676 INFO L273 TraceCheckUtils]: 25: Hoare triple {1146#false} ~i~0 := 0bv32; {1146#false} is VALID [2018-11-23 10:02:37,676 INFO L273 TraceCheckUtils]: 26: Hoare triple {1146#false} assume !~bvslt32(~i~0, 100000bv32); {1146#false} is VALID [2018-11-23 10:02:37,676 INFO L273 TraceCheckUtils]: 27: Hoare triple {1146#false} ~i~0 := 0bv32; {1146#false} is VALID [2018-11-23 10:02:37,677 INFO L273 TraceCheckUtils]: 28: Hoare triple {1146#false} assume !~bvslt32(~i~0, 100000bv32); {1146#false} is VALID [2018-11-23 10:02:37,677 INFO L273 TraceCheckUtils]: 29: Hoare triple {1146#false} havoc ~x~0;~x~0 := 0bv32; {1146#false} is VALID [2018-11-23 10:02:37,677 INFO L273 TraceCheckUtils]: 30: Hoare triple {1146#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem18 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1146#false} is VALID [2018-11-23 10:02:37,677 INFO L256 TraceCheckUtils]: 31: Hoare triple {1146#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1bv32 else 0bv32)); {1146#false} is VALID [2018-11-23 10:02:37,678 INFO L273 TraceCheckUtils]: 32: Hoare triple {1146#false} ~cond := #in~cond; {1146#false} is VALID [2018-11-23 10:02:37,678 INFO L273 TraceCheckUtils]: 33: Hoare triple {1146#false} assume 0bv32 == ~cond; {1146#false} is VALID [2018-11-23 10:02:37,678 INFO L273 TraceCheckUtils]: 34: Hoare triple {1146#false} assume !false; {1146#false} is VALID [2018-11-23 10:02:37,680 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-23 10:02:37,680 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 (5)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 10:02:37,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 10:02:37,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 10:02:37,684 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 10:02:37,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:37,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 10:02:37,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:37,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 10:02:37,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 10:02:37,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 10:02:37,742 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 3 states. [2018-11-23 10:02:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:38,084 INFO L93 Difference]: Finished difference Result 90 states and 111 transitions. [2018-11-23 10:02:38,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 10:02:38,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-11-23 10:02:38,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:38,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:38,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-23 10:02:38,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 10:02:38,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2018-11-23 10:02:38,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2018-11-23 10:02:38,280 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:38,283 INFO L225 Difference]: With dead ends: 90 [2018-11-23 10:02:38,283 INFO L226 Difference]: Without dead ends: 61 [2018-11-23 10:02:38,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 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 10:02:38,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-11-23 10:02:38,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 54. [2018-11-23 10:02:38,308 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:38,308 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand 54 states. [2018-11-23 10:02:38,308 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 54 states. [2018-11-23 10:02:38,309 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 54 states. [2018-11-23 10:02:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:38,312 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-23 10:02:38,312 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-23 10:02:38,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:38,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:38,313 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 61 states. [2018-11-23 10:02:38,313 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 61 states. [2018-11-23 10:02:38,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:38,316 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2018-11-23 10:02:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2018-11-23 10:02:38,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:38,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:38,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:38,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:38,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 10:02:38,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-11-23 10:02:38,320 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 35 [2018-11-23 10:02:38,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:38,321 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-11-23 10:02:38,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 10:02:38,321 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-11-23 10:02:38,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 10:02:38,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:38,323 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:38,323 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:38,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:38,323 INFO L82 PathProgramCache]: Analyzing trace with hash 622720616, now seen corresponding path program 1 times [2018-11-23 10:02:38,324 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:38,324 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 10:02:38,343 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 10:02:38,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:38,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:38,565 INFO L256 TraceCheckUtils]: 0: Hoare triple {1579#true} call ULTIMATE.init(); {1579#true} is VALID [2018-11-23 10:02:38,565 INFO L273 TraceCheckUtils]: 1: Hoare triple {1579#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1579#true} is VALID [2018-11-23 10:02:38,565 INFO L273 TraceCheckUtils]: 2: Hoare triple {1579#true} assume true; {1579#true} is VALID [2018-11-23 10:02:38,566 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1579#true} {1579#true} #147#return; {1579#true} is VALID [2018-11-23 10:02:38,566 INFO L256 TraceCheckUtils]: 4: Hoare triple {1579#true} call #t~ret19 := main(); {1579#true} is VALID [2018-11-23 10:02:38,567 INFO L273 TraceCheckUtils]: 5: Hoare triple {1579#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1599#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:38,567 INFO L273 TraceCheckUtils]: 6: Hoare triple {1599#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1599#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:38,568 INFO L273 TraceCheckUtils]: 7: Hoare triple {1599#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1606#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:38,569 INFO L273 TraceCheckUtils]: 8: Hoare triple {1606#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1606#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:38,570 INFO L273 TraceCheckUtils]: 9: Hoare triple {1606#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1613#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:38,570 INFO L273 TraceCheckUtils]: 10: Hoare triple {1613#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1613#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:38,571 INFO L273 TraceCheckUtils]: 11: Hoare triple {1613#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1620#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:38,572 INFO L273 TraceCheckUtils]: 12: Hoare triple {1620#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1620#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:38,573 INFO L273 TraceCheckUtils]: 13: Hoare triple {1620#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1627#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:38,574 INFO L273 TraceCheckUtils]: 14: Hoare triple {1627#(= (_ bv4 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,574 INFO L273 TraceCheckUtils]: 15: Hoare triple {1580#false} havoc ~i~0;~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1580#false} is VALID [2018-11-23 10:02:38,575 INFO L273 TraceCheckUtils]: 17: Hoare triple {1580#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1580#false} is VALID [2018-11-23 10:02:38,575 INFO L273 TraceCheckUtils]: 18: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,575 INFO L273 TraceCheckUtils]: 19: Hoare triple {1580#false} ~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,576 INFO L273 TraceCheckUtils]: 20: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1580#false} is VALID [2018-11-23 10:02:38,576 INFO L273 TraceCheckUtils]: 21: Hoare triple {1580#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1580#false} is VALID [2018-11-23 10:02:38,576 INFO L273 TraceCheckUtils]: 22: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,577 INFO L273 TraceCheckUtils]: 23: Hoare triple {1580#false} ~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,577 INFO L273 TraceCheckUtils]: 24: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1580#false} is VALID [2018-11-23 10:02:38,577 INFO L273 TraceCheckUtils]: 25: Hoare triple {1580#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1580#false} is VALID [2018-11-23 10:02:38,578 INFO L273 TraceCheckUtils]: 26: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,578 INFO L273 TraceCheckUtils]: 27: Hoare triple {1580#false} ~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,579 INFO L273 TraceCheckUtils]: 28: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1580#false} is VALID [2018-11-23 10:02:38,579 INFO L273 TraceCheckUtils]: 29: Hoare triple {1580#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1580#false} is VALID [2018-11-23 10:02:38,579 INFO L273 TraceCheckUtils]: 30: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,579 INFO L273 TraceCheckUtils]: 31: Hoare triple {1580#false} ~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,580 INFO L273 TraceCheckUtils]: 32: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {1580#false} is VALID [2018-11-23 10:02:38,580 INFO L273 TraceCheckUtils]: 33: Hoare triple {1580#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1580#false} is VALID [2018-11-23 10:02:38,580 INFO L273 TraceCheckUtils]: 34: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,581 INFO L273 TraceCheckUtils]: 35: Hoare triple {1580#false} ~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,581 INFO L273 TraceCheckUtils]: 36: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {1580#false} is VALID [2018-11-23 10:02:38,581 INFO L273 TraceCheckUtils]: 37: Hoare triple {1580#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1580#false} is VALID [2018-11-23 10:02:38,581 INFO L273 TraceCheckUtils]: 38: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,582 INFO L273 TraceCheckUtils]: 39: Hoare triple {1580#false} ~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,582 INFO L273 TraceCheckUtils]: 40: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {1580#false} is VALID [2018-11-23 10:02:38,582 INFO L273 TraceCheckUtils]: 41: Hoare triple {1580#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1580#false} is VALID [2018-11-23 10:02:38,583 INFO L273 TraceCheckUtils]: 42: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,583 INFO L273 TraceCheckUtils]: 43: Hoare triple {1580#false} havoc ~x~0;~x~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,583 INFO L273 TraceCheckUtils]: 44: Hoare triple {1580#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem18 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1580#false} is VALID [2018-11-23 10:02:38,583 INFO L256 TraceCheckUtils]: 45: Hoare triple {1580#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1bv32 else 0bv32)); {1580#false} is VALID [2018-11-23 10:02:38,584 INFO L273 TraceCheckUtils]: 46: Hoare triple {1580#false} ~cond := #in~cond; {1580#false} is VALID [2018-11-23 10:02:38,584 INFO L273 TraceCheckUtils]: 47: Hoare triple {1580#false} assume 0bv32 == ~cond; {1580#false} is VALID [2018-11-23 10:02:38,584 INFO L273 TraceCheckUtils]: 48: Hoare triple {1580#false} assume !false; {1580#false} is VALID [2018-11-23 10:02:38,588 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 10:02:38,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:38,850 INFO L273 TraceCheckUtils]: 48: Hoare triple {1580#false} assume !false; {1580#false} is VALID [2018-11-23 10:02:38,850 INFO L273 TraceCheckUtils]: 47: Hoare triple {1580#false} assume 0bv32 == ~cond; {1580#false} is VALID [2018-11-23 10:02:38,851 INFO L273 TraceCheckUtils]: 46: Hoare triple {1580#false} ~cond := #in~cond; {1580#false} is VALID [2018-11-23 10:02:38,851 INFO L256 TraceCheckUtils]: 45: Hoare triple {1580#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1bv32 else 0bv32)); {1580#false} is VALID [2018-11-23 10:02:38,851 INFO L273 TraceCheckUtils]: 44: Hoare triple {1580#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem18 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1580#false} is VALID [2018-11-23 10:02:38,851 INFO L273 TraceCheckUtils]: 43: Hoare triple {1580#false} havoc ~x~0;~x~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,852 INFO L273 TraceCheckUtils]: 42: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,852 INFO L273 TraceCheckUtils]: 41: Hoare triple {1580#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {1580#false} is VALID [2018-11-23 10:02:38,852 INFO L273 TraceCheckUtils]: 40: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {1580#false} is VALID [2018-11-23 10:02:38,852 INFO L273 TraceCheckUtils]: 39: Hoare triple {1580#false} ~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,853 INFO L273 TraceCheckUtils]: 38: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,853 INFO L273 TraceCheckUtils]: 37: Hoare triple {1580#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {1580#false} is VALID [2018-11-23 10:02:38,853 INFO L273 TraceCheckUtils]: 36: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {1580#false} is VALID [2018-11-23 10:02:38,854 INFO L273 TraceCheckUtils]: 35: Hoare triple {1580#false} ~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,854 INFO L273 TraceCheckUtils]: 34: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,854 INFO L273 TraceCheckUtils]: 33: Hoare triple {1580#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {1580#false} is VALID [2018-11-23 10:02:38,854 INFO L273 TraceCheckUtils]: 32: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {1580#false} is VALID [2018-11-23 10:02:38,855 INFO L273 TraceCheckUtils]: 31: Hoare triple {1580#false} ~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,855 INFO L273 TraceCheckUtils]: 30: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,855 INFO L273 TraceCheckUtils]: 29: Hoare triple {1580#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {1580#false} is VALID [2018-11-23 10:02:38,856 INFO L273 TraceCheckUtils]: 28: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {1580#false} is VALID [2018-11-23 10:02:38,856 INFO L273 TraceCheckUtils]: 27: Hoare triple {1580#false} ~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,856 INFO L273 TraceCheckUtils]: 26: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,856 INFO L273 TraceCheckUtils]: 25: Hoare triple {1580#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {1580#false} is VALID [2018-11-23 10:02:38,857 INFO L273 TraceCheckUtils]: 24: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {1580#false} is VALID [2018-11-23 10:02:38,857 INFO L273 TraceCheckUtils]: 23: Hoare triple {1580#false} ~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,857 INFO L273 TraceCheckUtils]: 22: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,857 INFO L273 TraceCheckUtils]: 21: Hoare triple {1580#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {1580#false} is VALID [2018-11-23 10:02:38,858 INFO L273 TraceCheckUtils]: 20: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {1580#false} is VALID [2018-11-23 10:02:38,858 INFO L273 TraceCheckUtils]: 19: Hoare triple {1580#false} ~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,858 INFO L273 TraceCheckUtils]: 18: Hoare triple {1580#false} assume !~bvslt32(~i~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,859 INFO L273 TraceCheckUtils]: 17: Hoare triple {1580#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1580#false} is VALID [2018-11-23 10:02:38,859 INFO L273 TraceCheckUtils]: 16: Hoare triple {1580#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1580#false} is VALID [2018-11-23 10:02:38,859 INFO L273 TraceCheckUtils]: 15: Hoare triple {1580#false} havoc ~i~0;~i~0 := 0bv32; {1580#false} is VALID [2018-11-23 10:02:38,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {1835#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {1580#false} is VALID [2018-11-23 10:02:38,871 INFO L273 TraceCheckUtils]: 13: Hoare triple {1839#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1835#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:38,872 INFO L273 TraceCheckUtils]: 12: Hoare triple {1839#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1839#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,876 INFO L273 TraceCheckUtils]: 11: Hoare triple {1846#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1839#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,877 INFO L273 TraceCheckUtils]: 10: Hoare triple {1846#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1846#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,881 INFO L273 TraceCheckUtils]: 9: Hoare triple {1853#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1846#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,882 INFO L273 TraceCheckUtils]: 8: Hoare triple {1853#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1853#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,886 INFO L273 TraceCheckUtils]: 7: Hoare triple {1860#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1853#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,887 INFO L273 TraceCheckUtils]: 6: Hoare triple {1860#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {1860#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,889 INFO L273 TraceCheckUtils]: 5: Hoare triple {1579#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {1860#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:38,889 INFO L256 TraceCheckUtils]: 4: Hoare triple {1579#true} call #t~ret19 := main(); {1579#true} is VALID [2018-11-23 10:02:38,889 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1579#true} {1579#true} #147#return; {1579#true} is VALID [2018-11-23 10:02:38,889 INFO L273 TraceCheckUtils]: 2: Hoare triple {1579#true} assume true; {1579#true} is VALID [2018-11-23 10:02:38,890 INFO L273 TraceCheckUtils]: 1: Hoare triple {1579#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1579#true} is VALID [2018-11-23 10:02:38,890 INFO L256 TraceCheckUtils]: 0: Hoare triple {1579#true} call ULTIMATE.init(); {1579#true} is VALID [2018-11-23 10:02:38,894 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 10:02:38,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:38,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 10:02:38,900 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-11-23 10:02:38,900 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:38,901 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 10:02:39,026 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:39,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 10:02:39,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 10:02:39,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 10:02:39,027 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 12 states. [2018-11-23 10:02:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:40,249 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2018-11-23 10:02:40,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 10:02:40,249 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2018-11-23 10:02:40,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:40,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-23 10:02:40,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 10:02:40,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-23 10:02:40,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 112 transitions. [2018-11-23 10:02:40,490 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:40,493 INFO L225 Difference]: With dead ends: 105 [2018-11-23 10:02:40,493 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 10:02:40,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 10:02:40,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 10:02:40,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2018-11-23 10:02:40,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:40,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 66 states. [2018-11-23 10:02:40,531 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 10:02:40,531 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 10:02:40,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:40,534 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-23 10:02:40,534 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-23 10:02:40,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:40,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:40,535 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 66 states. [2018-11-23 10:02:40,535 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 66 states. [2018-11-23 10:02:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:40,538 INFO L93 Difference]: Finished difference Result 66 states and 74 transitions. [2018-11-23 10:02:40,538 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-23 10:02:40,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:40,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:40,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:40,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 10:02:40,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 74 transitions. [2018-11-23 10:02:40,542 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 74 transitions. Word has length 49 [2018-11-23 10:02:40,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:40,542 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 74 transitions. [2018-11-23 10:02:40,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 10:02:40,542 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 74 transitions. [2018-11-23 10:02:40,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 10:02:40,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:40,544 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:40,544 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:40,545 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:40,545 INFO L82 PathProgramCache]: Analyzing trace with hash -2117728356, now seen corresponding path program 2 times [2018-11-23 10:02:40,545 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:40,545 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 10:02:40,566 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 10:02:40,719 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 10:02:40,720 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:40,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:40,765 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:41,046 INFO L256 TraceCheckUtils]: 0: Hoare triple {2276#true} call ULTIMATE.init(); {2276#true} is VALID [2018-11-23 10:02:41,046 INFO L273 TraceCheckUtils]: 1: Hoare triple {2276#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2276#true} is VALID [2018-11-23 10:02:41,047 INFO L273 TraceCheckUtils]: 2: Hoare triple {2276#true} assume true; {2276#true} is VALID [2018-11-23 10:02:41,047 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2276#true} {2276#true} #147#return; {2276#true} is VALID [2018-11-23 10:02:41,048 INFO L256 TraceCheckUtils]: 4: Hoare triple {2276#true} call #t~ret19 := main(); {2276#true} is VALID [2018-11-23 10:02:41,048 INFO L273 TraceCheckUtils]: 5: Hoare triple {2276#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2296#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:41,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {2296#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2296#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:41,050 INFO L273 TraceCheckUtils]: 7: Hoare triple {2296#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2303#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:41,052 INFO L273 TraceCheckUtils]: 8: Hoare triple {2303#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2303#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:41,060 INFO L273 TraceCheckUtils]: 9: Hoare triple {2303#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2310#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:41,065 INFO L273 TraceCheckUtils]: 10: Hoare triple {2310#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2310#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:41,066 INFO L273 TraceCheckUtils]: 11: Hoare triple {2310#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2317#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:41,067 INFO L273 TraceCheckUtils]: 12: Hoare triple {2317#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2317#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:41,067 INFO L273 TraceCheckUtils]: 13: Hoare triple {2317#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2324#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:41,068 INFO L273 TraceCheckUtils]: 14: Hoare triple {2324#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2324#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:41,068 INFO L273 TraceCheckUtils]: 15: Hoare triple {2324#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2331#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:41,069 INFO L273 TraceCheckUtils]: 16: Hoare triple {2331#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2331#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:41,069 INFO L273 TraceCheckUtils]: 17: Hoare triple {2331#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2338#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:41,070 INFO L273 TraceCheckUtils]: 18: Hoare triple {2338#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2338#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:41,071 INFO L273 TraceCheckUtils]: 19: Hoare triple {2338#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2345#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:41,072 INFO L273 TraceCheckUtils]: 20: Hoare triple {2345#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2345#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:41,072 INFO L273 TraceCheckUtils]: 21: Hoare triple {2345#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2352#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:41,073 INFO L273 TraceCheckUtils]: 22: Hoare triple {2352#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2352#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:41,074 INFO L273 TraceCheckUtils]: 23: Hoare triple {2352#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2359#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:41,074 INFO L273 TraceCheckUtils]: 24: Hoare triple {2359#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2359#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:41,075 INFO L273 TraceCheckUtils]: 25: Hoare triple {2359#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2366#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:41,076 INFO L273 TraceCheckUtils]: 26: Hoare triple {2366#(= (_ bv10 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,076 INFO L273 TraceCheckUtils]: 27: Hoare triple {2277#false} havoc ~i~0;~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,077 INFO L273 TraceCheckUtils]: 28: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2277#false} is VALID [2018-11-23 10:02:41,077 INFO L273 TraceCheckUtils]: 29: Hoare triple {2277#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2277#false} is VALID [2018-11-23 10:02:41,077 INFO L273 TraceCheckUtils]: 30: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,078 INFO L273 TraceCheckUtils]: 31: Hoare triple {2277#false} ~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,078 INFO L273 TraceCheckUtils]: 32: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2277#false} is VALID [2018-11-23 10:02:41,078 INFO L273 TraceCheckUtils]: 33: Hoare triple {2277#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2277#false} is VALID [2018-11-23 10:02:41,079 INFO L273 TraceCheckUtils]: 34: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,079 INFO L273 TraceCheckUtils]: 35: Hoare triple {2277#false} ~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,079 INFO L273 TraceCheckUtils]: 36: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2277#false} is VALID [2018-11-23 10:02:41,080 INFO L273 TraceCheckUtils]: 37: Hoare triple {2277#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2277#false} is VALID [2018-11-23 10:02:41,080 INFO L273 TraceCheckUtils]: 38: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,080 INFO L273 TraceCheckUtils]: 39: Hoare triple {2277#false} ~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,080 INFO L273 TraceCheckUtils]: 40: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {2277#false} is VALID [2018-11-23 10:02:41,080 INFO L273 TraceCheckUtils]: 41: Hoare triple {2277#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2277#false} is VALID [2018-11-23 10:02:41,081 INFO L273 TraceCheckUtils]: 42: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,081 INFO L273 TraceCheckUtils]: 43: Hoare triple {2277#false} ~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,081 INFO L273 TraceCheckUtils]: 44: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {2277#false} is VALID [2018-11-23 10:02:41,081 INFO L273 TraceCheckUtils]: 45: Hoare triple {2277#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2277#false} is VALID [2018-11-23 10:02:41,082 INFO L273 TraceCheckUtils]: 46: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,082 INFO L273 TraceCheckUtils]: 47: Hoare triple {2277#false} ~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,082 INFO L273 TraceCheckUtils]: 48: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {2277#false} is VALID [2018-11-23 10:02:41,082 INFO L273 TraceCheckUtils]: 49: Hoare triple {2277#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2277#false} is VALID [2018-11-23 10:02:41,083 INFO L273 TraceCheckUtils]: 50: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,083 INFO L273 TraceCheckUtils]: 51: Hoare triple {2277#false} ~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,083 INFO L273 TraceCheckUtils]: 52: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {2277#false} is VALID [2018-11-23 10:02:41,083 INFO L273 TraceCheckUtils]: 53: Hoare triple {2277#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2277#false} is VALID [2018-11-23 10:02:41,084 INFO L273 TraceCheckUtils]: 54: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,084 INFO L273 TraceCheckUtils]: 55: Hoare triple {2277#false} havoc ~x~0;~x~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,084 INFO L273 TraceCheckUtils]: 56: Hoare triple {2277#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem18 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2277#false} is VALID [2018-11-23 10:02:41,084 INFO L256 TraceCheckUtils]: 57: Hoare triple {2277#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1bv32 else 0bv32)); {2277#false} is VALID [2018-11-23 10:02:41,085 INFO L273 TraceCheckUtils]: 58: Hoare triple {2277#false} ~cond := #in~cond; {2277#false} is VALID [2018-11-23 10:02:41,085 INFO L273 TraceCheckUtils]: 59: Hoare triple {2277#false} assume 0bv32 == ~cond; {2277#false} is VALID [2018-11-23 10:02:41,085 INFO L273 TraceCheckUtils]: 60: Hoare triple {2277#false} assume !false; {2277#false} is VALID [2018-11-23 10:02:41,090 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 10:02:41,090 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:41,807 INFO L273 TraceCheckUtils]: 60: Hoare triple {2277#false} assume !false; {2277#false} is VALID [2018-11-23 10:02:41,808 INFO L273 TraceCheckUtils]: 59: Hoare triple {2277#false} assume 0bv32 == ~cond; {2277#false} is VALID [2018-11-23 10:02:41,808 INFO L273 TraceCheckUtils]: 58: Hoare triple {2277#false} ~cond := #in~cond; {2277#false} is VALID [2018-11-23 10:02:41,808 INFO L256 TraceCheckUtils]: 57: Hoare triple {2277#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1bv32 else 0bv32)); {2277#false} is VALID [2018-11-23 10:02:41,808 INFO L273 TraceCheckUtils]: 56: Hoare triple {2277#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem18 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2277#false} is VALID [2018-11-23 10:02:41,808 INFO L273 TraceCheckUtils]: 55: Hoare triple {2277#false} havoc ~x~0;~x~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,809 INFO L273 TraceCheckUtils]: 54: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,809 INFO L273 TraceCheckUtils]: 53: Hoare triple {2277#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {2277#false} is VALID [2018-11-23 10:02:41,809 INFO L273 TraceCheckUtils]: 52: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {2277#false} is VALID [2018-11-23 10:02:41,809 INFO L273 TraceCheckUtils]: 51: Hoare triple {2277#false} ~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,809 INFO L273 TraceCheckUtils]: 50: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,810 INFO L273 TraceCheckUtils]: 49: Hoare triple {2277#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {2277#false} is VALID [2018-11-23 10:02:41,810 INFO L273 TraceCheckUtils]: 48: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {2277#false} is VALID [2018-11-23 10:02:41,810 INFO L273 TraceCheckUtils]: 47: Hoare triple {2277#false} ~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,810 INFO L273 TraceCheckUtils]: 46: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,810 INFO L273 TraceCheckUtils]: 45: Hoare triple {2277#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {2277#false} is VALID [2018-11-23 10:02:41,810 INFO L273 TraceCheckUtils]: 44: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {2277#false} is VALID [2018-11-23 10:02:41,810 INFO L273 TraceCheckUtils]: 43: Hoare triple {2277#false} ~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,811 INFO L273 TraceCheckUtils]: 42: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,811 INFO L273 TraceCheckUtils]: 41: Hoare triple {2277#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {2277#false} is VALID [2018-11-23 10:02:41,811 INFO L273 TraceCheckUtils]: 40: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {2277#false} is VALID [2018-11-23 10:02:41,811 INFO L273 TraceCheckUtils]: 39: Hoare triple {2277#false} ~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,811 INFO L273 TraceCheckUtils]: 38: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,811 INFO L273 TraceCheckUtils]: 37: Hoare triple {2277#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {2277#false} is VALID [2018-11-23 10:02:41,812 INFO L273 TraceCheckUtils]: 36: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {2277#false} is VALID [2018-11-23 10:02:41,812 INFO L273 TraceCheckUtils]: 35: Hoare triple {2277#false} ~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,812 INFO L273 TraceCheckUtils]: 34: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,812 INFO L273 TraceCheckUtils]: 33: Hoare triple {2277#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {2277#false} is VALID [2018-11-23 10:02:41,812 INFO L273 TraceCheckUtils]: 32: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {2277#false} is VALID [2018-11-23 10:02:41,812 INFO L273 TraceCheckUtils]: 31: Hoare triple {2277#false} ~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,812 INFO L273 TraceCheckUtils]: 30: Hoare triple {2277#false} assume !~bvslt32(~i~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,813 INFO L273 TraceCheckUtils]: 29: Hoare triple {2277#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2277#false} is VALID [2018-11-23 10:02:41,813 INFO L273 TraceCheckUtils]: 28: Hoare triple {2277#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2277#false} is VALID [2018-11-23 10:02:41,813 INFO L273 TraceCheckUtils]: 27: Hoare triple {2277#false} havoc ~i~0;~i~0 := 0bv32; {2277#false} is VALID [2018-11-23 10:02:41,813 INFO L273 TraceCheckUtils]: 26: Hoare triple {2574#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {2277#false} is VALID [2018-11-23 10:02:41,814 INFO L273 TraceCheckUtils]: 25: Hoare triple {2578#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2574#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:41,815 INFO L273 TraceCheckUtils]: 24: Hoare triple {2578#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2578#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,820 INFO L273 TraceCheckUtils]: 23: Hoare triple {2585#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2578#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,820 INFO L273 TraceCheckUtils]: 22: Hoare triple {2585#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2585#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,824 INFO L273 TraceCheckUtils]: 21: Hoare triple {2592#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2585#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,824 INFO L273 TraceCheckUtils]: 20: Hoare triple {2592#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2592#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,828 INFO L273 TraceCheckUtils]: 19: Hoare triple {2599#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2592#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,828 INFO L273 TraceCheckUtils]: 18: Hoare triple {2599#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2599#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,833 INFO L273 TraceCheckUtils]: 17: Hoare triple {2606#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2599#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,833 INFO L273 TraceCheckUtils]: 16: Hoare triple {2606#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2606#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,837 INFO L273 TraceCheckUtils]: 15: Hoare triple {2613#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2606#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,838 INFO L273 TraceCheckUtils]: 14: Hoare triple {2613#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2613#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,847 INFO L273 TraceCheckUtils]: 13: Hoare triple {2620#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2613#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,848 INFO L273 TraceCheckUtils]: 12: Hoare triple {2620#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2620#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,854 INFO L273 TraceCheckUtils]: 11: Hoare triple {2627#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2620#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,854 INFO L273 TraceCheckUtils]: 10: Hoare triple {2627#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2627#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,859 INFO L273 TraceCheckUtils]: 9: Hoare triple {2634#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2627#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,860 INFO L273 TraceCheckUtils]: 8: Hoare triple {2634#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2634#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,865 INFO L273 TraceCheckUtils]: 7: Hoare triple {2641#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2634#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,866 INFO L273 TraceCheckUtils]: 6: Hoare triple {2641#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {2641#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,867 INFO L273 TraceCheckUtils]: 5: Hoare triple {2276#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {2641#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:41,867 INFO L256 TraceCheckUtils]: 4: Hoare triple {2276#true} call #t~ret19 := main(); {2276#true} is VALID [2018-11-23 10:02:41,867 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2276#true} {2276#true} #147#return; {2276#true} is VALID [2018-11-23 10:02:41,868 INFO L273 TraceCheckUtils]: 2: Hoare triple {2276#true} assume true; {2276#true} is VALID [2018-11-23 10:02:41,868 INFO L273 TraceCheckUtils]: 1: Hoare triple {2276#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2276#true} is VALID [2018-11-23 10:02:41,868 INFO L256 TraceCheckUtils]: 0: Hoare triple {2276#true} call ULTIMATE.init(); {2276#true} is VALID [2018-11-23 10:02:41,872 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 10:02:41,873 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:41,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 10:02:41,874 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-11-23 10:02:41,875 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:41,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 10:02:42,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:42,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 10:02:42,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 10:02:42,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 10:02:42,043 INFO L87 Difference]: Start difference. First operand 66 states and 74 transitions. Second operand 24 states. [2018-11-23 10:02:46,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:46,063 INFO L93 Difference]: Finished difference Result 129 states and 156 transitions. [2018-11-23 10:02:46,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 10:02:46,063 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 61 [2018-11-23 10:02:46,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 142 transitions. [2018-11-23 10:02:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 10:02:46,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 142 transitions. [2018-11-23 10:02:46,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 142 transitions. [2018-11-23 10:02:46,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:46,334 INFO L225 Difference]: With dead ends: 129 [2018-11-23 10:02:46,334 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 10:02:46,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 10:02:46,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 10:02:46,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-11-23 10:02:46,373 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:46,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand 90 states. [2018-11-23 10:02:46,373 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2018-11-23 10:02:46,373 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2018-11-23 10:02:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:46,376 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-11-23 10:02:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2018-11-23 10:02:46,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:46,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:46,376 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand 90 states. [2018-11-23 10:02:46,377 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 90 states. [2018-11-23 10:02:46,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:46,379 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2018-11-23 10:02:46,379 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2018-11-23 10:02:46,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:46,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:46,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:46,380 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:46,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-11-23 10:02:46,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 98 transitions. [2018-11-23 10:02:46,383 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 98 transitions. Word has length 61 [2018-11-23 10:02:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:46,383 INFO L480 AbstractCegarLoop]: Abstraction has 90 states and 98 transitions. [2018-11-23 10:02:46,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 10:02:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 98 transitions. [2018-11-23 10:02:46,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-11-23 10:02:46,385 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:46,385 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:46,385 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:46,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:46,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1007591428, now seen corresponding path program 3 times [2018-11-23 10:02:46,386 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:46,386 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 10:02:46,413 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 10:02:46,565 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 10:02:46,566 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:46,599 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:46,711 INFO L256 TraceCheckUtils]: 0: Hoare triple {3189#true} call ULTIMATE.init(); {3189#true} is VALID [2018-11-23 10:02:46,711 INFO L273 TraceCheckUtils]: 1: Hoare triple {3189#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3189#true} is VALID [2018-11-23 10:02:46,712 INFO L273 TraceCheckUtils]: 2: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 10:02:46,712 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3189#true} {3189#true} #147#return; {3189#true} is VALID [2018-11-23 10:02:46,712 INFO L256 TraceCheckUtils]: 4: Hoare triple {3189#true} call #t~ret19 := main(); {3189#true} is VALID [2018-11-23 10:02:46,712 INFO L273 TraceCheckUtils]: 5: Hoare triple {3189#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3189#true} is VALID [2018-11-23 10:02:46,713 INFO L273 TraceCheckUtils]: 6: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,713 INFO L273 TraceCheckUtils]: 7: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,713 INFO L273 TraceCheckUtils]: 8: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,713 INFO L273 TraceCheckUtils]: 9: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,713 INFO L273 TraceCheckUtils]: 10: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,713 INFO L273 TraceCheckUtils]: 11: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,713 INFO L273 TraceCheckUtils]: 12: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,714 INFO L273 TraceCheckUtils]: 13: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,714 INFO L273 TraceCheckUtils]: 14: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,714 INFO L273 TraceCheckUtils]: 15: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,714 INFO L273 TraceCheckUtils]: 16: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,716 INFO L273 TraceCheckUtils]: 17: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,716 INFO L273 TraceCheckUtils]: 18: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,716 INFO L273 TraceCheckUtils]: 19: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,716 INFO L273 TraceCheckUtils]: 20: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,717 INFO L273 TraceCheckUtils]: 21: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,717 INFO L273 TraceCheckUtils]: 22: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,717 INFO L273 TraceCheckUtils]: 23: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,717 INFO L273 TraceCheckUtils]: 24: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,717 INFO L273 TraceCheckUtils]: 25: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,718 INFO L273 TraceCheckUtils]: 26: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,718 INFO L273 TraceCheckUtils]: 27: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,718 INFO L273 TraceCheckUtils]: 28: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,718 INFO L273 TraceCheckUtils]: 29: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,719 INFO L273 TraceCheckUtils]: 30: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,719 INFO L273 TraceCheckUtils]: 31: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,719 INFO L273 TraceCheckUtils]: 32: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,719 INFO L273 TraceCheckUtils]: 33: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,719 INFO L273 TraceCheckUtils]: 34: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,719 INFO L273 TraceCheckUtils]: 35: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,719 INFO L273 TraceCheckUtils]: 36: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,720 INFO L273 TraceCheckUtils]: 37: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,720 INFO L273 TraceCheckUtils]: 38: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,720 INFO L273 TraceCheckUtils]: 39: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,720 INFO L273 TraceCheckUtils]: 40: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,720 INFO L273 TraceCheckUtils]: 41: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,720 INFO L273 TraceCheckUtils]: 42: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,720 INFO L273 TraceCheckUtils]: 43: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,720 INFO L273 TraceCheckUtils]: 44: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,721 INFO L273 TraceCheckUtils]: 45: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,721 INFO L273 TraceCheckUtils]: 46: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,721 INFO L273 TraceCheckUtils]: 47: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,721 INFO L273 TraceCheckUtils]: 48: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,721 INFO L273 TraceCheckUtils]: 49: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,721 INFO L273 TraceCheckUtils]: 50: Hoare triple {3189#true} assume !~bvslt32(~a~0, 100000bv32); {3189#true} is VALID [2018-11-23 10:02:46,721 INFO L273 TraceCheckUtils]: 51: Hoare triple {3189#true} havoc ~i~0;~i~0 := 0bv32; {3189#true} is VALID [2018-11-23 10:02:46,722 INFO L273 TraceCheckUtils]: 52: Hoare triple {3189#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3189#true} is VALID [2018-11-23 10:02:46,722 INFO L273 TraceCheckUtils]: 53: Hoare triple {3189#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3189#true} is VALID [2018-11-23 10:02:46,722 INFO L273 TraceCheckUtils]: 54: Hoare triple {3189#true} assume !~bvslt32(~i~0, 100000bv32); {3189#true} is VALID [2018-11-23 10:02:46,722 INFO L273 TraceCheckUtils]: 55: Hoare triple {3189#true} ~i~0 := 0bv32; {3189#true} is VALID [2018-11-23 10:02:46,722 INFO L273 TraceCheckUtils]: 56: Hoare triple {3189#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3189#true} is VALID [2018-11-23 10:02:46,722 INFO L273 TraceCheckUtils]: 57: Hoare triple {3189#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3189#true} is VALID [2018-11-23 10:02:46,722 INFO L273 TraceCheckUtils]: 58: Hoare triple {3189#true} assume !~bvslt32(~i~0, 100000bv32); {3189#true} is VALID [2018-11-23 10:02:46,722 INFO L273 TraceCheckUtils]: 59: Hoare triple {3189#true} ~i~0 := 0bv32; {3189#true} is VALID [2018-11-23 10:02:46,723 INFO L273 TraceCheckUtils]: 60: Hoare triple {3189#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3189#true} is VALID [2018-11-23 10:02:46,723 INFO L273 TraceCheckUtils]: 61: Hoare triple {3189#true} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3189#true} is VALID [2018-11-23 10:02:46,723 INFO L273 TraceCheckUtils]: 62: Hoare triple {3189#true} assume !~bvslt32(~i~0, 100000bv32); {3189#true} is VALID [2018-11-23 10:02:46,724 INFO L273 TraceCheckUtils]: 63: Hoare triple {3189#true} ~i~0 := 0bv32; {3383#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:46,724 INFO L273 TraceCheckUtils]: 64: Hoare triple {3383#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3383#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 10:02:46,728 INFO L273 TraceCheckUtils]: 65: Hoare triple {3383#(= main_~i~0 (_ bv0 32))} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3390#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 10:02:46,728 INFO L273 TraceCheckUtils]: 66: Hoare triple {3390#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3190#false} is VALID [2018-11-23 10:02:46,728 INFO L273 TraceCheckUtils]: 67: Hoare triple {3190#false} ~i~0 := 0bv32; {3190#false} is VALID [2018-11-23 10:02:46,728 INFO L273 TraceCheckUtils]: 68: Hoare triple {3190#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {3190#false} is VALID [2018-11-23 10:02:46,729 INFO L273 TraceCheckUtils]: 69: Hoare triple {3190#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3190#false} is VALID [2018-11-23 10:02:46,729 INFO L273 TraceCheckUtils]: 70: Hoare triple {3190#false} assume !~bvslt32(~i~0, 100000bv32); {3190#false} is VALID [2018-11-23 10:02:46,729 INFO L273 TraceCheckUtils]: 71: Hoare triple {3190#false} ~i~0 := 0bv32; {3190#false} is VALID [2018-11-23 10:02:46,729 INFO L273 TraceCheckUtils]: 72: Hoare triple {3190#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {3190#false} is VALID [2018-11-23 10:02:46,729 INFO L273 TraceCheckUtils]: 73: Hoare triple {3190#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3190#false} is VALID [2018-11-23 10:02:46,730 INFO L273 TraceCheckUtils]: 74: Hoare triple {3190#false} assume !~bvslt32(~i~0, 100000bv32); {3190#false} is VALID [2018-11-23 10:02:46,730 INFO L273 TraceCheckUtils]: 75: Hoare triple {3190#false} ~i~0 := 0bv32; {3190#false} is VALID [2018-11-23 10:02:46,730 INFO L273 TraceCheckUtils]: 76: Hoare triple {3190#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {3190#false} is VALID [2018-11-23 10:02:46,730 INFO L273 TraceCheckUtils]: 77: Hoare triple {3190#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {3190#false} is VALID [2018-11-23 10:02:46,730 INFO L273 TraceCheckUtils]: 78: Hoare triple {3190#false} assume !~bvslt32(~i~0, 100000bv32); {3190#false} is VALID [2018-11-23 10:02:46,730 INFO L273 TraceCheckUtils]: 79: Hoare triple {3190#false} havoc ~x~0;~x~0 := 0bv32; {3190#false} is VALID [2018-11-23 10:02:46,730 INFO L273 TraceCheckUtils]: 80: Hoare triple {3190#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem18 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3190#false} is VALID [2018-11-23 10:02:46,731 INFO L256 TraceCheckUtils]: 81: Hoare triple {3190#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1bv32 else 0bv32)); {3190#false} is VALID [2018-11-23 10:02:46,731 INFO L273 TraceCheckUtils]: 82: Hoare triple {3190#false} ~cond := #in~cond; {3190#false} is VALID [2018-11-23 10:02:46,731 INFO L273 TraceCheckUtils]: 83: Hoare triple {3190#false} assume 0bv32 == ~cond; {3190#false} is VALID [2018-11-23 10:02:46,731 INFO L273 TraceCheckUtils]: 84: Hoare triple {3190#false} assume !false; {3190#false} is VALID [2018-11-23 10:02:46,734 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-23 10:02:46,734 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:46,833 INFO L273 TraceCheckUtils]: 84: Hoare triple {3190#false} assume !false; {3190#false} is VALID [2018-11-23 10:02:46,834 INFO L273 TraceCheckUtils]: 83: Hoare triple {3190#false} assume 0bv32 == ~cond; {3190#false} is VALID [2018-11-23 10:02:46,834 INFO L273 TraceCheckUtils]: 82: Hoare triple {3190#false} ~cond := #in~cond; {3190#false} is VALID [2018-11-23 10:02:46,834 INFO L256 TraceCheckUtils]: 81: Hoare triple {3190#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1bv32 else 0bv32)); {3190#false} is VALID [2018-11-23 10:02:46,834 INFO L273 TraceCheckUtils]: 80: Hoare triple {3190#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem18 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3190#false} is VALID [2018-11-23 10:02:46,835 INFO L273 TraceCheckUtils]: 79: Hoare triple {3190#false} havoc ~x~0;~x~0 := 0bv32; {3190#false} is VALID [2018-11-23 10:02:46,835 INFO L273 TraceCheckUtils]: 78: Hoare triple {3190#false} assume !~bvslt32(~i~0, 100000bv32); {3190#false} is VALID [2018-11-23 10:02:46,835 INFO L273 TraceCheckUtils]: 77: Hoare triple {3190#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {3190#false} is VALID [2018-11-23 10:02:46,836 INFO L273 TraceCheckUtils]: 76: Hoare triple {3190#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {3190#false} is VALID [2018-11-23 10:02:46,836 INFO L273 TraceCheckUtils]: 75: Hoare triple {3190#false} ~i~0 := 0bv32; {3190#false} is VALID [2018-11-23 10:02:46,836 INFO L273 TraceCheckUtils]: 74: Hoare triple {3190#false} assume !~bvslt32(~i~0, 100000bv32); {3190#false} is VALID [2018-11-23 10:02:46,836 INFO L273 TraceCheckUtils]: 73: Hoare triple {3190#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {3190#false} is VALID [2018-11-23 10:02:46,836 INFO L273 TraceCheckUtils]: 72: Hoare triple {3190#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {3190#false} is VALID [2018-11-23 10:02:46,837 INFO L273 TraceCheckUtils]: 71: Hoare triple {3190#false} ~i~0 := 0bv32; {3190#false} is VALID [2018-11-23 10:02:46,837 INFO L273 TraceCheckUtils]: 70: Hoare triple {3190#false} assume !~bvslt32(~i~0, 100000bv32); {3190#false} is VALID [2018-11-23 10:02:46,837 INFO L273 TraceCheckUtils]: 69: Hoare triple {3190#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {3190#false} is VALID [2018-11-23 10:02:46,837 INFO L273 TraceCheckUtils]: 68: Hoare triple {3190#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {3190#false} is VALID [2018-11-23 10:02:46,837 INFO L273 TraceCheckUtils]: 67: Hoare triple {3190#false} ~i~0 := 0bv32; {3190#false} is VALID [2018-11-23 10:02:46,853 INFO L273 TraceCheckUtils]: 66: Hoare triple {3502#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3190#false} is VALID [2018-11-23 10:02:46,866 INFO L273 TraceCheckUtils]: 65: Hoare triple {3506#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {3502#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:46,875 INFO L273 TraceCheckUtils]: 64: Hoare triple {3506#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {3506#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:46,887 INFO L273 TraceCheckUtils]: 63: Hoare triple {3189#true} ~i~0 := 0bv32; {3506#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:46,888 INFO L273 TraceCheckUtils]: 62: Hoare triple {3189#true} assume !~bvslt32(~i~0, 100000bv32); {3189#true} is VALID [2018-11-23 10:02:46,888 INFO L273 TraceCheckUtils]: 61: Hoare triple {3189#true} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {3189#true} is VALID [2018-11-23 10:02:46,888 INFO L273 TraceCheckUtils]: 60: Hoare triple {3189#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {3189#true} is VALID [2018-11-23 10:02:46,888 INFO L273 TraceCheckUtils]: 59: Hoare triple {3189#true} ~i~0 := 0bv32; {3189#true} is VALID [2018-11-23 10:02:46,888 INFO L273 TraceCheckUtils]: 58: Hoare triple {3189#true} assume !~bvslt32(~i~0, 100000bv32); {3189#true} is VALID [2018-11-23 10:02:46,889 INFO L273 TraceCheckUtils]: 57: Hoare triple {3189#true} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {3189#true} is VALID [2018-11-23 10:02:46,889 INFO L273 TraceCheckUtils]: 56: Hoare triple {3189#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {3189#true} is VALID [2018-11-23 10:02:46,889 INFO L273 TraceCheckUtils]: 55: Hoare triple {3189#true} ~i~0 := 0bv32; {3189#true} is VALID [2018-11-23 10:02:46,889 INFO L273 TraceCheckUtils]: 54: Hoare triple {3189#true} assume !~bvslt32(~i~0, 100000bv32); {3189#true} is VALID [2018-11-23 10:02:46,889 INFO L273 TraceCheckUtils]: 53: Hoare triple {3189#true} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {3189#true} is VALID [2018-11-23 10:02:46,890 INFO L273 TraceCheckUtils]: 52: Hoare triple {3189#true} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {3189#true} is VALID [2018-11-23 10:02:46,890 INFO L273 TraceCheckUtils]: 51: Hoare triple {3189#true} havoc ~i~0;~i~0 := 0bv32; {3189#true} is VALID [2018-11-23 10:02:46,890 INFO L273 TraceCheckUtils]: 50: Hoare triple {3189#true} assume !~bvslt32(~a~0, 100000bv32); {3189#true} is VALID [2018-11-23 10:02:46,890 INFO L273 TraceCheckUtils]: 49: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,890 INFO L273 TraceCheckUtils]: 48: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,890 INFO L273 TraceCheckUtils]: 47: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,891 INFO L273 TraceCheckUtils]: 46: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,891 INFO L273 TraceCheckUtils]: 45: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,891 INFO L273 TraceCheckUtils]: 44: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,891 INFO L273 TraceCheckUtils]: 43: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,891 INFO L273 TraceCheckUtils]: 42: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,892 INFO L273 TraceCheckUtils]: 41: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,892 INFO L273 TraceCheckUtils]: 40: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,892 INFO L273 TraceCheckUtils]: 39: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,892 INFO L273 TraceCheckUtils]: 38: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,892 INFO L273 TraceCheckUtils]: 37: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,892 INFO L273 TraceCheckUtils]: 36: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,893 INFO L273 TraceCheckUtils]: 35: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,893 INFO L273 TraceCheckUtils]: 34: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,893 INFO L273 TraceCheckUtils]: 33: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,893 INFO L273 TraceCheckUtils]: 32: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,893 INFO L273 TraceCheckUtils]: 31: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,894 INFO L273 TraceCheckUtils]: 30: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,894 INFO L273 TraceCheckUtils]: 29: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,894 INFO L273 TraceCheckUtils]: 28: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,894 INFO L273 TraceCheckUtils]: 27: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,894 INFO L273 TraceCheckUtils]: 26: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,894 INFO L273 TraceCheckUtils]: 25: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,895 INFO L273 TraceCheckUtils]: 24: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,895 INFO L273 TraceCheckUtils]: 23: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,895 INFO L273 TraceCheckUtils]: 22: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,895 INFO L273 TraceCheckUtils]: 21: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,896 INFO L273 TraceCheckUtils]: 20: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,896 INFO L273 TraceCheckUtils]: 19: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,896 INFO L273 TraceCheckUtils]: 18: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,896 INFO L273 TraceCheckUtils]: 17: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,896 INFO L273 TraceCheckUtils]: 16: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,896 INFO L273 TraceCheckUtils]: 15: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,897 INFO L273 TraceCheckUtils]: 14: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,897 INFO L273 TraceCheckUtils]: 13: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,897 INFO L273 TraceCheckUtils]: 12: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,897 INFO L273 TraceCheckUtils]: 11: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,897 INFO L273 TraceCheckUtils]: 10: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,898 INFO L273 TraceCheckUtils]: 9: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,898 INFO L273 TraceCheckUtils]: 8: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,898 INFO L273 TraceCheckUtils]: 7: Hoare triple {3189#true} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {3189#true} is VALID [2018-11-23 10:02:46,898 INFO L273 TraceCheckUtils]: 6: Hoare triple {3189#true} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {3189#true} is VALID [2018-11-23 10:02:46,898 INFO L273 TraceCheckUtils]: 5: Hoare triple {3189#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {3189#true} is VALID [2018-11-23 10:02:46,899 INFO L256 TraceCheckUtils]: 4: Hoare triple {3189#true} call #t~ret19 := main(); {3189#true} is VALID [2018-11-23 10:02:46,899 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3189#true} {3189#true} #147#return; {3189#true} is VALID [2018-11-23 10:02:46,899 INFO L273 TraceCheckUtils]: 2: Hoare triple {3189#true} assume true; {3189#true} is VALID [2018-11-23 10:02:46,899 INFO L273 TraceCheckUtils]: 1: Hoare triple {3189#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3189#true} is VALID [2018-11-23 10:02:46,899 INFO L256 TraceCheckUtils]: 0: Hoare triple {3189#true} call ULTIMATE.init(); {3189#true} is VALID [2018-11-23 10:02:46,903 INFO L134 CoverageAnalysis]: Checked inductivity of 491 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2018-11-23 10:02:46,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:46,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 10:02:46,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-23 10:02:46,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:46,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 10:02:46,990 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:46,990 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 10:02:46,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 10:02:46,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 10:02:46,991 INFO L87 Difference]: Start difference. First operand 90 states and 98 transitions. Second operand 6 states. [2018-11-23 10:02:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:47,856 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2018-11-23 10:02:47,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 10:02:47,856 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-11-23 10:02:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:02:47,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:47,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2018-11-23 10:02:47,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 10:02:47,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 153 transitions. [2018-11-23 10:02:47,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 153 transitions. [2018-11-23 10:02:48,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:48,087 INFO L225 Difference]: With dead ends: 167 [2018-11-23 10:02:48,087 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 10:02:48,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 10:02:48,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 10:02:48,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-11-23 10:02:48,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:02:48,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 132 states. [2018-11-23 10:02:48,179 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 132 states. [2018-11-23 10:02:48,179 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 132 states. [2018-11-23 10:02:48,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:48,182 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2018-11-23 10:02:48,182 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-11-23 10:02:48,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:48,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:48,183 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 132 states. [2018-11-23 10:02:48,183 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 132 states. [2018-11-23 10:02:48,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:02:48,186 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2018-11-23 10:02:48,186 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-11-23 10:02:48,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:02:48,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:02:48,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:02:48,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:02:48,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 10:02:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 140 transitions. [2018-11-23 10:02:48,191 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 140 transitions. Word has length 85 [2018-11-23 10:02:48,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:02:48,191 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 140 transitions. [2018-11-23 10:02:48,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 10:02:48,191 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 140 transitions. [2018-11-23 10:02:48,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 10:02:48,193 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:02:48,193 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:02:48,193 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:02:48,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:02:48,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1182591738, now seen corresponding path program 4 times [2018-11-23 10:02:48,194 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:02:48,194 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 10:02:48,217 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 10:02:48,395 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 10:02:48,395 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 10:02:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 10:02:48,478 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 10:02:49,487 INFO L256 TraceCheckUtils]: 0: Hoare triple {4415#true} call ULTIMATE.init(); {4415#true} is VALID [2018-11-23 10:02:49,487 INFO L273 TraceCheckUtils]: 1: Hoare triple {4415#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4415#true} is VALID [2018-11-23 10:02:49,487 INFO L273 TraceCheckUtils]: 2: Hoare triple {4415#true} assume true; {4415#true} is VALID [2018-11-23 10:02:49,488 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4415#true} {4415#true} #147#return; {4415#true} is VALID [2018-11-23 10:02:49,488 INFO L256 TraceCheckUtils]: 4: Hoare triple {4415#true} call #t~ret19 := main(); {4415#true} is VALID [2018-11-23 10:02:49,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {4415#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {4435#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:49,489 INFO L273 TraceCheckUtils]: 6: Hoare triple {4435#(= main_~a~0 (_ bv0 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4435#(= main_~a~0 (_ bv0 32))} is VALID [2018-11-23 10:02:49,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {4435#(= main_~a~0 (_ bv0 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4442#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:49,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {4442#(= (_ bv1 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4442#(= (_ bv1 32) main_~a~0)} is VALID [2018-11-23 10:02:49,493 INFO L273 TraceCheckUtils]: 9: Hoare triple {4442#(= (_ bv1 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4449#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:49,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {4449#(= (_ bv2 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4449#(= (_ bv2 32) main_~a~0)} is VALID [2018-11-23 10:02:49,495 INFO L273 TraceCheckUtils]: 11: Hoare triple {4449#(= (_ bv2 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4456#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:49,495 INFO L273 TraceCheckUtils]: 12: Hoare triple {4456#(= (_ bv3 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4456#(= (_ bv3 32) main_~a~0)} is VALID [2018-11-23 10:02:49,497 INFO L273 TraceCheckUtils]: 13: Hoare triple {4456#(= (_ bv3 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4463#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:49,497 INFO L273 TraceCheckUtils]: 14: Hoare triple {4463#(= (_ bv4 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4463#(= (_ bv4 32) main_~a~0)} is VALID [2018-11-23 10:02:49,499 INFO L273 TraceCheckUtils]: 15: Hoare triple {4463#(= (_ bv4 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4470#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:49,501 INFO L273 TraceCheckUtils]: 16: Hoare triple {4470#(= (_ bv5 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4470#(= (_ bv5 32) main_~a~0)} is VALID [2018-11-23 10:02:49,501 INFO L273 TraceCheckUtils]: 17: Hoare triple {4470#(= (_ bv5 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4477#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:49,503 INFO L273 TraceCheckUtils]: 18: Hoare triple {4477#(= (_ bv6 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4477#(= (_ bv6 32) main_~a~0)} is VALID [2018-11-23 10:02:49,503 INFO L273 TraceCheckUtils]: 19: Hoare triple {4477#(= (_ bv6 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4484#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:49,505 INFO L273 TraceCheckUtils]: 20: Hoare triple {4484#(= (_ bv7 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4484#(= (_ bv7 32) main_~a~0)} is VALID [2018-11-23 10:02:49,505 INFO L273 TraceCheckUtils]: 21: Hoare triple {4484#(= (_ bv7 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4491#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:49,507 INFO L273 TraceCheckUtils]: 22: Hoare triple {4491#(= (_ bv8 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4491#(= (_ bv8 32) main_~a~0)} is VALID [2018-11-23 10:02:49,507 INFO L273 TraceCheckUtils]: 23: Hoare triple {4491#(= (_ bv8 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4498#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:49,509 INFO L273 TraceCheckUtils]: 24: Hoare triple {4498#(= (_ bv9 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4498#(= (_ bv9 32) main_~a~0)} is VALID [2018-11-23 10:02:49,517 INFO L273 TraceCheckUtils]: 25: Hoare triple {4498#(= (_ bv9 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4505#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:49,519 INFO L273 TraceCheckUtils]: 26: Hoare triple {4505#(= (_ bv10 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4505#(= (_ bv10 32) main_~a~0)} is VALID [2018-11-23 10:02:49,519 INFO L273 TraceCheckUtils]: 27: Hoare triple {4505#(= (_ bv10 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4512#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 10:02:49,521 INFO L273 TraceCheckUtils]: 28: Hoare triple {4512#(= (_ bv11 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4512#(= (_ bv11 32) main_~a~0)} is VALID [2018-11-23 10:02:49,521 INFO L273 TraceCheckUtils]: 29: Hoare triple {4512#(= (_ bv11 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4519#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 10:02:49,523 INFO L273 TraceCheckUtils]: 30: Hoare triple {4519#(= (_ bv12 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4519#(= (_ bv12 32) main_~a~0)} is VALID [2018-11-23 10:02:49,523 INFO L273 TraceCheckUtils]: 31: Hoare triple {4519#(= (_ bv12 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4526#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 10:02:49,525 INFO L273 TraceCheckUtils]: 32: Hoare triple {4526#(= (_ bv13 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4526#(= (_ bv13 32) main_~a~0)} is VALID [2018-11-23 10:02:49,525 INFO L273 TraceCheckUtils]: 33: Hoare triple {4526#(= (_ bv13 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4533#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 10:02:49,527 INFO L273 TraceCheckUtils]: 34: Hoare triple {4533#(= (_ bv14 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4533#(= (_ bv14 32) main_~a~0)} is VALID [2018-11-23 10:02:49,527 INFO L273 TraceCheckUtils]: 35: Hoare triple {4533#(= (_ bv14 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4540#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 10:02:49,529 INFO L273 TraceCheckUtils]: 36: Hoare triple {4540#(= (_ bv15 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4540#(= (_ bv15 32) main_~a~0)} is VALID [2018-11-23 10:02:49,529 INFO L273 TraceCheckUtils]: 37: Hoare triple {4540#(= (_ bv15 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4547#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 10:02:49,531 INFO L273 TraceCheckUtils]: 38: Hoare triple {4547#(= (_ bv16 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4547#(= (_ bv16 32) main_~a~0)} is VALID [2018-11-23 10:02:49,531 INFO L273 TraceCheckUtils]: 39: Hoare triple {4547#(= (_ bv16 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4554#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 10:02:49,533 INFO L273 TraceCheckUtils]: 40: Hoare triple {4554#(= (_ bv17 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4554#(= (_ bv17 32) main_~a~0)} is VALID [2018-11-23 10:02:49,533 INFO L273 TraceCheckUtils]: 41: Hoare triple {4554#(= (_ bv17 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4561#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 10:02:49,535 INFO L273 TraceCheckUtils]: 42: Hoare triple {4561#(= (_ bv18 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4561#(= (_ bv18 32) main_~a~0)} is VALID [2018-11-23 10:02:49,535 INFO L273 TraceCheckUtils]: 43: Hoare triple {4561#(= (_ bv18 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4568#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 10:02:49,537 INFO L273 TraceCheckUtils]: 44: Hoare triple {4568#(= (_ bv19 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4568#(= (_ bv19 32) main_~a~0)} is VALID [2018-11-23 10:02:49,537 INFO L273 TraceCheckUtils]: 45: Hoare triple {4568#(= (_ bv19 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4575#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 10:02:49,539 INFO L273 TraceCheckUtils]: 46: Hoare triple {4575#(= (_ bv20 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4575#(= (_ bv20 32) main_~a~0)} is VALID [2018-11-23 10:02:49,539 INFO L273 TraceCheckUtils]: 47: Hoare triple {4575#(= (_ bv20 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4582#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 10:02:49,541 INFO L273 TraceCheckUtils]: 48: Hoare triple {4582#(= (_ bv21 32) main_~a~0)} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {4582#(= (_ bv21 32) main_~a~0)} is VALID [2018-11-23 10:02:49,541 INFO L273 TraceCheckUtils]: 49: Hoare triple {4582#(= (_ bv21 32) main_~a~0)} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {4589#(= (_ bv22 32) main_~a~0)} is VALID [2018-11-23 10:02:49,543 INFO L273 TraceCheckUtils]: 50: Hoare triple {4589#(= (_ bv22 32) main_~a~0)} assume !~bvslt32(~a~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:49,543 INFO L273 TraceCheckUtils]: 51: Hoare triple {4416#false} havoc ~i~0;~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:49,543 INFO L273 TraceCheckUtils]: 52: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4416#false} is VALID [2018-11-23 10:02:49,543 INFO L273 TraceCheckUtils]: 53: Hoare triple {4416#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4416#false} is VALID [2018-11-23 10:02:49,544 INFO L273 TraceCheckUtils]: 54: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4416#false} is VALID [2018-11-23 10:02:49,544 INFO L273 TraceCheckUtils]: 55: Hoare triple {4416#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4416#false} is VALID [2018-11-23 10:02:49,544 INFO L273 TraceCheckUtils]: 56: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4416#false} is VALID [2018-11-23 10:02:49,544 INFO L273 TraceCheckUtils]: 57: Hoare triple {4416#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4416#false} is VALID [2018-11-23 10:02:49,544 INFO L273 TraceCheckUtils]: 58: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4416#false} is VALID [2018-11-23 10:02:49,545 INFO L273 TraceCheckUtils]: 59: Hoare triple {4416#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4416#false} is VALID [2018-11-23 10:02:49,545 INFO L273 TraceCheckUtils]: 60: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:49,545 INFO L273 TraceCheckUtils]: 61: Hoare triple {4416#false} ~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:49,545 INFO L273 TraceCheckUtils]: 62: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4416#false} is VALID [2018-11-23 10:02:49,545 INFO L273 TraceCheckUtils]: 63: Hoare triple {4416#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4416#false} is VALID [2018-11-23 10:02:49,546 INFO L273 TraceCheckUtils]: 64: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4416#false} is VALID [2018-11-23 10:02:49,546 INFO L273 TraceCheckUtils]: 65: Hoare triple {4416#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4416#false} is VALID [2018-11-23 10:02:49,546 INFO L273 TraceCheckUtils]: 66: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4416#false} is VALID [2018-11-23 10:02:49,546 INFO L273 TraceCheckUtils]: 67: Hoare triple {4416#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4416#false} is VALID [2018-11-23 10:02:49,546 INFO L273 TraceCheckUtils]: 68: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4416#false} is VALID [2018-11-23 10:02:49,546 INFO L273 TraceCheckUtils]: 69: Hoare triple {4416#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4416#false} is VALID [2018-11-23 10:02:49,546 INFO L273 TraceCheckUtils]: 70: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:49,547 INFO L273 TraceCheckUtils]: 71: Hoare triple {4416#false} ~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:49,547 INFO L273 TraceCheckUtils]: 72: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4416#false} is VALID [2018-11-23 10:02:49,547 INFO L273 TraceCheckUtils]: 73: Hoare triple {4416#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4416#false} is VALID [2018-11-23 10:02:49,547 INFO L273 TraceCheckUtils]: 74: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4416#false} is VALID [2018-11-23 10:02:49,547 INFO L273 TraceCheckUtils]: 75: Hoare triple {4416#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4416#false} is VALID [2018-11-23 10:02:49,547 INFO L273 TraceCheckUtils]: 76: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4416#false} is VALID [2018-11-23 10:02:49,547 INFO L273 TraceCheckUtils]: 77: Hoare triple {4416#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4416#false} is VALID [2018-11-23 10:02:49,547 INFO L273 TraceCheckUtils]: 78: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4416#false} is VALID [2018-11-23 10:02:49,548 INFO L273 TraceCheckUtils]: 79: Hoare triple {4416#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4416#false} is VALID [2018-11-23 10:02:49,548 INFO L273 TraceCheckUtils]: 80: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:49,548 INFO L273 TraceCheckUtils]: 81: Hoare triple {4416#false} ~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:49,548 INFO L273 TraceCheckUtils]: 82: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4416#false} is VALID [2018-11-23 10:02:49,548 INFO L273 TraceCheckUtils]: 83: Hoare triple {4416#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4416#false} is VALID [2018-11-23 10:02:49,548 INFO L273 TraceCheckUtils]: 84: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4416#false} is VALID [2018-11-23 10:02:49,548 INFO L273 TraceCheckUtils]: 85: Hoare triple {4416#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4416#false} is VALID [2018-11-23 10:02:49,548 INFO L273 TraceCheckUtils]: 86: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4416#false} is VALID [2018-11-23 10:02:49,549 INFO L273 TraceCheckUtils]: 87: Hoare triple {4416#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4416#false} is VALID [2018-11-23 10:02:49,549 INFO L273 TraceCheckUtils]: 88: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4416#false} is VALID [2018-11-23 10:02:49,549 INFO L273 TraceCheckUtils]: 89: Hoare triple {4416#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4416#false} is VALID [2018-11-23 10:02:49,549 INFO L273 TraceCheckUtils]: 90: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:49,549 INFO L273 TraceCheckUtils]: 91: Hoare triple {4416#false} ~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:49,549 INFO L273 TraceCheckUtils]: 92: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4416#false} is VALID [2018-11-23 10:02:49,549 INFO L273 TraceCheckUtils]: 93: Hoare triple {4416#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4416#false} is VALID [2018-11-23 10:02:49,549 INFO L273 TraceCheckUtils]: 94: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4416#false} is VALID [2018-11-23 10:02:49,549 INFO L273 TraceCheckUtils]: 95: Hoare triple {4416#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4416#false} is VALID [2018-11-23 10:02:49,550 INFO L273 TraceCheckUtils]: 96: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4416#false} is VALID [2018-11-23 10:02:49,550 INFO L273 TraceCheckUtils]: 97: Hoare triple {4416#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4416#false} is VALID [2018-11-23 10:02:49,550 INFO L273 TraceCheckUtils]: 98: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4416#false} is VALID [2018-11-23 10:02:49,550 INFO L273 TraceCheckUtils]: 99: Hoare triple {4416#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4416#false} is VALID [2018-11-23 10:02:49,550 INFO L273 TraceCheckUtils]: 100: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:49,550 INFO L273 TraceCheckUtils]: 101: Hoare triple {4416#false} ~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:49,550 INFO L273 TraceCheckUtils]: 102: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4416#false} is VALID [2018-11-23 10:02:49,550 INFO L273 TraceCheckUtils]: 103: Hoare triple {4416#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4416#false} is VALID [2018-11-23 10:02:49,551 INFO L273 TraceCheckUtils]: 104: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4416#false} is VALID [2018-11-23 10:02:49,551 INFO L273 TraceCheckUtils]: 105: Hoare triple {4416#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4416#false} is VALID [2018-11-23 10:02:49,551 INFO L273 TraceCheckUtils]: 106: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4416#false} is VALID [2018-11-23 10:02:49,551 INFO L273 TraceCheckUtils]: 107: Hoare triple {4416#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4416#false} is VALID [2018-11-23 10:02:49,551 INFO L273 TraceCheckUtils]: 108: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4416#false} is VALID [2018-11-23 10:02:49,551 INFO L273 TraceCheckUtils]: 109: Hoare triple {4416#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4416#false} is VALID [2018-11-23 10:02:49,551 INFO L273 TraceCheckUtils]: 110: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:49,551 INFO L273 TraceCheckUtils]: 111: Hoare triple {4416#false} ~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:49,552 INFO L273 TraceCheckUtils]: 112: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4416#false} is VALID [2018-11-23 10:02:49,552 INFO L273 TraceCheckUtils]: 113: Hoare triple {4416#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4416#false} is VALID [2018-11-23 10:02:49,552 INFO L273 TraceCheckUtils]: 114: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4416#false} is VALID [2018-11-23 10:02:49,552 INFO L273 TraceCheckUtils]: 115: Hoare triple {4416#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4416#false} is VALID [2018-11-23 10:02:49,552 INFO L273 TraceCheckUtils]: 116: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4416#false} is VALID [2018-11-23 10:02:49,552 INFO L273 TraceCheckUtils]: 117: Hoare triple {4416#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4416#false} is VALID [2018-11-23 10:02:49,552 INFO L273 TraceCheckUtils]: 118: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4416#false} is VALID [2018-11-23 10:02:49,552 INFO L273 TraceCheckUtils]: 119: Hoare triple {4416#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4416#false} is VALID [2018-11-23 10:02:49,553 INFO L273 TraceCheckUtils]: 120: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:49,553 INFO L273 TraceCheckUtils]: 121: Hoare triple {4416#false} havoc ~x~0;~x~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:49,553 INFO L273 TraceCheckUtils]: 122: Hoare triple {4416#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem18 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {4416#false} is VALID [2018-11-23 10:02:49,553 INFO L256 TraceCheckUtils]: 123: Hoare triple {4416#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1bv32 else 0bv32)); {4416#false} is VALID [2018-11-23 10:02:49,553 INFO L273 TraceCheckUtils]: 124: Hoare triple {4416#false} ~cond := #in~cond; {4416#false} is VALID [2018-11-23 10:02:49,553 INFO L273 TraceCheckUtils]: 125: Hoare triple {4416#false} assume 0bv32 == ~cond; {4416#false} is VALID [2018-11-23 10:02:49,553 INFO L273 TraceCheckUtils]: 126: Hoare triple {4416#false} assume !false; {4416#false} is VALID [2018-11-23 10:02:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 10:02:49,571 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 10:02:51,740 INFO L273 TraceCheckUtils]: 126: Hoare triple {4416#false} assume !false; {4416#false} is VALID [2018-11-23 10:02:51,740 INFO L273 TraceCheckUtils]: 125: Hoare triple {4416#false} assume 0bv32 == ~cond; {4416#false} is VALID [2018-11-23 10:02:51,740 INFO L273 TraceCheckUtils]: 124: Hoare triple {4416#false} ~cond := #in~cond; {4416#false} is VALID [2018-11-23 10:02:51,740 INFO L256 TraceCheckUtils]: 123: Hoare triple {4416#false} call __VERIFIER_assert((if #t~mem17 == #t~mem18 then 1bv32 else 0bv32)); {4416#false} is VALID [2018-11-23 10:02:51,740 INFO L273 TraceCheckUtils]: 122: Hoare triple {4416#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem17 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32);call #t~mem18 := read~intINTTYPE4(~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {4416#false} is VALID [2018-11-23 10:02:51,741 INFO L273 TraceCheckUtils]: 121: Hoare triple {4416#false} havoc ~x~0;~x~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:51,741 INFO L273 TraceCheckUtils]: 120: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:51,741 INFO L273 TraceCheckUtils]: 119: Hoare triple {4416#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4416#false} is VALID [2018-11-23 10:02:51,741 INFO L273 TraceCheckUtils]: 118: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4416#false} is VALID [2018-11-23 10:02:51,741 INFO L273 TraceCheckUtils]: 117: Hoare triple {4416#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4416#false} is VALID [2018-11-23 10:02:51,741 INFO L273 TraceCheckUtils]: 116: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4416#false} is VALID [2018-11-23 10:02:51,742 INFO L273 TraceCheckUtils]: 115: Hoare triple {4416#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4416#false} is VALID [2018-11-23 10:02:51,742 INFO L273 TraceCheckUtils]: 114: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4416#false} is VALID [2018-11-23 10:02:51,742 INFO L273 TraceCheckUtils]: 113: Hoare triple {4416#false} #t~post14 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post14);havoc #t~post14; {4416#false} is VALID [2018-11-23 10:02:51,742 INFO L273 TraceCheckUtils]: 112: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem15 := read~intINTTYPE4(~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem15, ~#a8~0.base, ~bvadd32(~#a8~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem15; {4416#false} is VALID [2018-11-23 10:02:51,742 INFO L273 TraceCheckUtils]: 111: Hoare triple {4416#false} ~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:51,743 INFO L273 TraceCheckUtils]: 110: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:51,743 INFO L273 TraceCheckUtils]: 109: Hoare triple {4416#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4416#false} is VALID [2018-11-23 10:02:51,743 INFO L273 TraceCheckUtils]: 108: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4416#false} is VALID [2018-11-23 10:02:51,743 INFO L273 TraceCheckUtils]: 107: Hoare triple {4416#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4416#false} is VALID [2018-11-23 10:02:51,743 INFO L273 TraceCheckUtils]: 106: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4416#false} is VALID [2018-11-23 10:02:51,743 INFO L273 TraceCheckUtils]: 105: Hoare triple {4416#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4416#false} is VALID [2018-11-23 10:02:51,744 INFO L273 TraceCheckUtils]: 104: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4416#false} is VALID [2018-11-23 10:02:51,744 INFO L273 TraceCheckUtils]: 103: Hoare triple {4416#false} #t~post12 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post12);havoc #t~post12; {4416#false} is VALID [2018-11-23 10:02:51,744 INFO L273 TraceCheckUtils]: 102: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem13 := read~intINTTYPE4(~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem13, ~#a7~0.base, ~bvadd32(~#a7~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem13; {4416#false} is VALID [2018-11-23 10:02:51,744 INFO L273 TraceCheckUtils]: 101: Hoare triple {4416#false} ~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:51,744 INFO L273 TraceCheckUtils]: 100: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:51,744 INFO L273 TraceCheckUtils]: 99: Hoare triple {4416#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4416#false} is VALID [2018-11-23 10:02:51,745 INFO L273 TraceCheckUtils]: 98: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4416#false} is VALID [2018-11-23 10:02:51,745 INFO L273 TraceCheckUtils]: 97: Hoare triple {4416#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4416#false} is VALID [2018-11-23 10:02:51,745 INFO L273 TraceCheckUtils]: 96: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4416#false} is VALID [2018-11-23 10:02:51,745 INFO L273 TraceCheckUtils]: 95: Hoare triple {4416#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4416#false} is VALID [2018-11-23 10:02:51,745 INFO L273 TraceCheckUtils]: 94: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4416#false} is VALID [2018-11-23 10:02:51,745 INFO L273 TraceCheckUtils]: 93: Hoare triple {4416#false} #t~post10 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post10);havoc #t~post10; {4416#false} is VALID [2018-11-23 10:02:51,746 INFO L273 TraceCheckUtils]: 92: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem11 := read~intINTTYPE4(~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem11, ~#a6~0.base, ~bvadd32(~#a6~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem11; {4416#false} is VALID [2018-11-23 10:02:51,746 INFO L273 TraceCheckUtils]: 91: Hoare triple {4416#false} ~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:51,746 INFO L273 TraceCheckUtils]: 90: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:51,746 INFO L273 TraceCheckUtils]: 89: Hoare triple {4416#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4416#false} is VALID [2018-11-23 10:02:51,746 INFO L273 TraceCheckUtils]: 88: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4416#false} is VALID [2018-11-23 10:02:51,746 INFO L273 TraceCheckUtils]: 87: Hoare triple {4416#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4416#false} is VALID [2018-11-23 10:02:51,747 INFO L273 TraceCheckUtils]: 86: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4416#false} is VALID [2018-11-23 10:02:51,747 INFO L273 TraceCheckUtils]: 85: Hoare triple {4416#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4416#false} is VALID [2018-11-23 10:02:51,747 INFO L273 TraceCheckUtils]: 84: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4416#false} is VALID [2018-11-23 10:02:51,747 INFO L273 TraceCheckUtils]: 83: Hoare triple {4416#false} #t~post8 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post8);havoc #t~post8; {4416#false} is VALID [2018-11-23 10:02:51,747 INFO L273 TraceCheckUtils]: 82: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem9 := read~intINTTYPE4(~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem9, ~#a5~0.base, ~bvadd32(~#a5~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem9; {4416#false} is VALID [2018-11-23 10:02:51,747 INFO L273 TraceCheckUtils]: 81: Hoare triple {4416#false} ~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:51,748 INFO L273 TraceCheckUtils]: 80: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:51,748 INFO L273 TraceCheckUtils]: 79: Hoare triple {4416#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4416#false} is VALID [2018-11-23 10:02:51,748 INFO L273 TraceCheckUtils]: 78: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4416#false} is VALID [2018-11-23 10:02:51,748 INFO L273 TraceCheckUtils]: 77: Hoare triple {4416#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4416#false} is VALID [2018-11-23 10:02:51,748 INFO L273 TraceCheckUtils]: 76: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4416#false} is VALID [2018-11-23 10:02:51,748 INFO L273 TraceCheckUtils]: 75: Hoare triple {4416#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4416#false} is VALID [2018-11-23 10:02:51,749 INFO L273 TraceCheckUtils]: 74: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4416#false} is VALID [2018-11-23 10:02:51,749 INFO L273 TraceCheckUtils]: 73: Hoare triple {4416#false} #t~post6 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post6);havoc #t~post6; {4416#false} is VALID [2018-11-23 10:02:51,749 INFO L273 TraceCheckUtils]: 72: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem7 := read~intINTTYPE4(~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem7, ~#a4~0.base, ~bvadd32(~#a4~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem7; {4416#false} is VALID [2018-11-23 10:02:51,749 INFO L273 TraceCheckUtils]: 71: Hoare triple {4416#false} ~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:51,749 INFO L273 TraceCheckUtils]: 70: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:51,749 INFO L273 TraceCheckUtils]: 69: Hoare triple {4416#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4416#false} is VALID [2018-11-23 10:02:51,750 INFO L273 TraceCheckUtils]: 68: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4416#false} is VALID [2018-11-23 10:02:51,750 INFO L273 TraceCheckUtils]: 67: Hoare triple {4416#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4416#false} is VALID [2018-11-23 10:02:51,750 INFO L273 TraceCheckUtils]: 66: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4416#false} is VALID [2018-11-23 10:02:51,750 INFO L273 TraceCheckUtils]: 65: Hoare triple {4416#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4416#false} is VALID [2018-11-23 10:02:51,750 INFO L273 TraceCheckUtils]: 64: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4416#false} is VALID [2018-11-23 10:02:51,751 INFO L273 TraceCheckUtils]: 63: Hoare triple {4416#false} #t~post4 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post4);havoc #t~post4; {4416#false} is VALID [2018-11-23 10:02:51,751 INFO L273 TraceCheckUtils]: 62: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem5, ~#a3~0.base, ~bvadd32(~#a3~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem5; {4416#false} is VALID [2018-11-23 10:02:51,751 INFO L273 TraceCheckUtils]: 61: Hoare triple {4416#false} ~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:51,751 INFO L273 TraceCheckUtils]: 60: Hoare triple {4416#false} assume !~bvslt32(~i~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:51,751 INFO L273 TraceCheckUtils]: 59: Hoare triple {4416#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4416#false} is VALID [2018-11-23 10:02:51,751 INFO L273 TraceCheckUtils]: 58: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4416#false} is VALID [2018-11-23 10:02:51,752 INFO L273 TraceCheckUtils]: 57: Hoare triple {4416#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4416#false} is VALID [2018-11-23 10:02:51,752 INFO L273 TraceCheckUtils]: 56: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4416#false} is VALID [2018-11-23 10:02:51,752 INFO L273 TraceCheckUtils]: 55: Hoare triple {4416#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4416#false} is VALID [2018-11-23 10:02:51,752 INFO L273 TraceCheckUtils]: 54: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4416#false} is VALID [2018-11-23 10:02:51,752 INFO L273 TraceCheckUtils]: 53: Hoare triple {4416#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {4416#false} is VALID [2018-11-23 10:02:51,752 INFO L273 TraceCheckUtils]: 52: Hoare triple {4416#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem3, ~#a2~0.base, ~bvadd32(~#a2~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {4416#false} is VALID [2018-11-23 10:02:51,753 INFO L273 TraceCheckUtils]: 51: Hoare triple {4416#false} havoc ~i~0;~i~0 := 0bv32; {4416#false} is VALID [2018-11-23 10:02:51,762 INFO L273 TraceCheckUtils]: 50: Hoare triple {5049#(bvslt main_~a~0 (_ bv100000 32))} assume !~bvslt32(~a~0, 100000bv32); {4416#false} is VALID [2018-11-23 10:02:51,763 INFO L273 TraceCheckUtils]: 49: Hoare triple {5053#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5049#(bvslt main_~a~0 (_ bv100000 32))} is VALID [2018-11-23 10:02:51,764 INFO L273 TraceCheckUtils]: 48: Hoare triple {5053#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5053#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,769 INFO L273 TraceCheckUtils]: 47: Hoare triple {5060#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5053#(bvslt (bvadd main_~a~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,769 INFO L273 TraceCheckUtils]: 46: Hoare triple {5060#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5060#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,774 INFO L273 TraceCheckUtils]: 45: Hoare triple {5067#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5060#(bvslt (bvadd main_~a~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,774 INFO L273 TraceCheckUtils]: 44: Hoare triple {5067#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5067#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,778 INFO L273 TraceCheckUtils]: 43: Hoare triple {5074#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5067#(bvslt (bvadd main_~a~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,778 INFO L273 TraceCheckUtils]: 42: Hoare triple {5074#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5074#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,785 INFO L273 TraceCheckUtils]: 41: Hoare triple {5081#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5074#(bvslt (bvadd main_~a~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,786 INFO L273 TraceCheckUtils]: 40: Hoare triple {5081#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5081#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,790 INFO L273 TraceCheckUtils]: 39: Hoare triple {5088#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5081#(bvslt (bvadd main_~a~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,790 INFO L273 TraceCheckUtils]: 38: Hoare triple {5088#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5088#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,796 INFO L273 TraceCheckUtils]: 37: Hoare triple {5095#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5088#(bvslt (bvadd main_~a~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,796 INFO L273 TraceCheckUtils]: 36: Hoare triple {5095#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5095#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,802 INFO L273 TraceCheckUtils]: 35: Hoare triple {5102#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5095#(bvslt (bvadd main_~a~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,802 INFO L273 TraceCheckUtils]: 34: Hoare triple {5102#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5102#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,806 INFO L273 TraceCheckUtils]: 33: Hoare triple {5109#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5102#(bvslt (bvadd main_~a~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,807 INFO L273 TraceCheckUtils]: 32: Hoare triple {5109#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5109#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,813 INFO L273 TraceCheckUtils]: 31: Hoare triple {5116#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5109#(bvslt (bvadd main_~a~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,813 INFO L273 TraceCheckUtils]: 30: Hoare triple {5116#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5116#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,821 INFO L273 TraceCheckUtils]: 29: Hoare triple {5123#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5116#(bvslt (bvadd main_~a~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,821 INFO L273 TraceCheckUtils]: 28: Hoare triple {5123#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5123#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,829 INFO L273 TraceCheckUtils]: 27: Hoare triple {5130#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5123#(bvslt (bvadd main_~a~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,829 INFO L273 TraceCheckUtils]: 26: Hoare triple {5130#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5130#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,837 INFO L273 TraceCheckUtils]: 25: Hoare triple {5137#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5130#(bvslt (bvadd main_~a~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,837 INFO L273 TraceCheckUtils]: 24: Hoare triple {5137#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5137#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,844 INFO L273 TraceCheckUtils]: 23: Hoare triple {5144#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5137#(bvslt (bvadd main_~a~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,844 INFO L273 TraceCheckUtils]: 22: Hoare triple {5144#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5144#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,850 INFO L273 TraceCheckUtils]: 21: Hoare triple {5151#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5144#(bvslt (bvadd main_~a~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,851 INFO L273 TraceCheckUtils]: 20: Hoare triple {5151#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5151#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,855 INFO L273 TraceCheckUtils]: 19: Hoare triple {5158#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5151#(bvslt (bvadd main_~a~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,856 INFO L273 TraceCheckUtils]: 18: Hoare triple {5158#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5158#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,860 INFO L273 TraceCheckUtils]: 17: Hoare triple {5165#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5158#(bvslt (bvadd main_~a~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,861 INFO L273 TraceCheckUtils]: 16: Hoare triple {5165#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5165#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,867 INFO L273 TraceCheckUtils]: 15: Hoare triple {5172#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5165#(bvslt (bvadd main_~a~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,868 INFO L273 TraceCheckUtils]: 14: Hoare triple {5172#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5172#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,887 INFO L273 TraceCheckUtils]: 13: Hoare triple {5179#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5172#(bvslt (bvadd main_~a~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,901 INFO L273 TraceCheckUtils]: 12: Hoare triple {5179#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5179#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,915 INFO L273 TraceCheckUtils]: 11: Hoare triple {5186#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5179#(bvslt (bvadd main_~a~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,931 INFO L273 TraceCheckUtils]: 10: Hoare triple {5186#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5186#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,941 INFO L273 TraceCheckUtils]: 9: Hoare triple {5193#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5186#(bvslt (bvadd main_~a~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,943 INFO L273 TraceCheckUtils]: 8: Hoare triple {5193#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5193#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,950 INFO L273 TraceCheckUtils]: 7: Hoare triple {5200#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} #t~post0 := ~a~0;~a~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {5193#(bvslt (bvadd main_~a~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,950 INFO L273 TraceCheckUtils]: 6: Hoare triple {5200#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~a~0, 100000bv32);call write~intINTTYPE4(#t~nondet1, ~#a1~0.base, ~bvadd32(~#a1~0.offset, ~bvmul32(4bv32, ~a~0)), 4bv32);havoc #t~nondet1; {5200#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,952 INFO L273 TraceCheckUtils]: 5: Hoare triple {4415#true} call ~#a1~0.base, ~#a1~0.offset := #Ultimate.alloc(400000bv32);call ~#a2~0.base, ~#a2~0.offset := #Ultimate.alloc(400000bv32);call ~#a3~0.base, ~#a3~0.offset := #Ultimate.alloc(400000bv32);call ~#a4~0.base, ~#a4~0.offset := #Ultimate.alloc(400000bv32);call ~#a5~0.base, ~#a5~0.offset := #Ultimate.alloc(400000bv32);call ~#a6~0.base, ~#a6~0.offset := #Ultimate.alloc(400000bv32);call ~#a7~0.base, ~#a7~0.offset := #Ultimate.alloc(400000bv32);call ~#a8~0.base, ~#a8~0.offset := #Ultimate.alloc(400000bv32);havoc ~a~0;~a~0 := 0bv32; {5200#(bvslt (bvadd main_~a~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 10:02:51,952 INFO L256 TraceCheckUtils]: 4: Hoare triple {4415#true} call #t~ret19 := main(); {4415#true} is VALID [2018-11-23 10:02:51,952 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {4415#true} {4415#true} #147#return; {4415#true} is VALID [2018-11-23 10:02:51,952 INFO L273 TraceCheckUtils]: 2: Hoare triple {4415#true} assume true; {4415#true} is VALID [2018-11-23 10:02:51,952 INFO L273 TraceCheckUtils]: 1: Hoare triple {4415#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {4415#true} is VALID [2018-11-23 10:02:51,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {4415#true} call ULTIMATE.init(); {4415#true} is VALID [2018-11-23 10:02:51,967 INFO L134 CoverageAnalysis]: Checked inductivity of 596 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2018-11-23 10:02:51,969 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 10:02:51,969 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 10:02:51,970 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-11-23 10:02:51,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 10:02:51,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 10:02:52,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:02:52,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 10:02:52,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 10:02:52,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 10:02:52,325 INFO L87 Difference]: Start difference. First operand 132 states and 140 transitions. Second operand 48 states. [2018-11-23 10:02:57,300 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 10:02:57,763 WARN L180 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 10:02:58,256 WARN L180 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 10:02:58,794 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 10:02:59,383 WARN L180 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 10:02:59,960 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 10:03:00,532 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 10:03:09,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:09,059 INFO L93 Difference]: Finished difference Result 261 states and 300 transitions. [2018-11-23 10:03:09,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 10:03:09,060 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-11-23 10:03:09,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 10:03:09,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 202 transitions. [2018-11-23 10:03:09,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 10:03:09,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 202 transitions. [2018-11-23 10:03:09,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 202 transitions. [2018-11-23 10:03:09,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 10:03:09,532 INFO L225 Difference]: With dead ends: 261 [2018-11-23 10:03:09,532 INFO L226 Difference]: Without dead ends: 180 [2018-11-23 10:03:09,534 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 10:03:09,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-11-23 10:03:09,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-11-23 10:03:09,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 10:03:09,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand 180 states. [2018-11-23 10:03:09,626 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 180 states. [2018-11-23 10:03:09,626 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 180 states. [2018-11-23 10:03:09,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:09,633 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-23 10:03:09,633 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 188 transitions. [2018-11-23 10:03:09,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:09,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:09,634 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand 180 states. [2018-11-23 10:03:09,634 INFO L87 Difference]: Start difference. First operand 180 states. Second operand 180 states. [2018-11-23 10:03:09,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 10:03:09,640 INFO L93 Difference]: Finished difference Result 180 states and 188 transitions. [2018-11-23 10:03:09,640 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 188 transitions. [2018-11-23 10:03:09,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 10:03:09,641 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 10:03:09,641 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 10:03:09,641 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 10:03:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-11-23 10:03:09,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 188 transitions. [2018-11-23 10:03:09,647 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 188 transitions. Word has length 127 [2018-11-23 10:03:09,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 10:03:09,647 INFO L480 AbstractCegarLoop]: Abstraction has 180 states and 188 transitions. [2018-11-23 10:03:09,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 10:03:09,648 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 188 transitions. [2018-11-23 10:03:09,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-23 10:03:09,650 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 10:03:09,650 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 10:03:09,650 INFO L423 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 10:03:09,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 10:03:09,651 INFO L82 PathProgramCache]: Analyzing trace with hash -375656502, now seen corresponding path program 5 times [2018-11-23 10:03:09,653 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 10:03:09,653 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 10:03:09,675 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1