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_copyInitSum2_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:58:26,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:58:26,535 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:58:26,547 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:58:26,548 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:58:26,549 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:58:26,550 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:58:26,552 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:58:26,554 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:58:26,554 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:58:26,555 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:58:26,556 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:58:26,557 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:58:26,558 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:58:26,559 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:58:26,560 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:58:26,561 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:58:26,563 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:58:26,565 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:58:26,566 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:58:26,568 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:58:26,569 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:58:26,571 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:58:26,572 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:58:26,572 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:58:26,573 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:58:26,574 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:58:26,575 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:58:26,576 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:58:26,577 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:58:26,577 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:58:26,578 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:58:26,578 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:58:26,578 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:58:26,580 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:58:26,580 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:58:26,581 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 09:58:26,597 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:58:26,597 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:58:26,598 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:58:26,598 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:58:26,599 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:58:26,599 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:58:26,599 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:58:26,600 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:58:26,600 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:58:26,600 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:58:26,600 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:58:26,600 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:58:26,601 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:58:26,601 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:58:26,601 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:58:26,601 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:58:26,601 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:58:26,602 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:58:26,602 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:58:26,602 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:58:26,602 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:58:26,602 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:58:26,603 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:58:26,603 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:58:26,603 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:26,603 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:58:26,603 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:58:26,604 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:58:26,604 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:58:26,604 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:58:26,604 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:58:26,604 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:58:26,605 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:58:26,647 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:58:26,660 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:58:26,664 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:58:26,665 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:58:26,666 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:58:26,666 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_copyInitSum2_false-unreach-call_ground.i [2018-11-23 09:58:26,722 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c999eb8/609c1b9f2b234eb9b2654d2c4d977891/FLAG4c0f0dbc4 [2018-11-23 09:58:27,186 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:58:27,187 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_copyInitSum2_false-unreach-call_ground.i [2018-11-23 09:58:27,194 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c999eb8/609c1b9f2b234eb9b2654d2c4d977891/FLAG4c0f0dbc4 [2018-11-23 09:58:27,537 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a4c999eb8/609c1b9f2b234eb9b2654d2c4d977891 [2018-11-23 09:58:27,549 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:58:27,551 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:58:27,552 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:27,552 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:58:27,556 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:58:27,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:27" (1/1) ... [2018-11-23 09:58:27,561 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c2bdb90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:27, skipping insertion in model container [2018-11-23 09:58:27,561 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:27" (1/1) ... [2018-11-23 09:58:27,572 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:58:27,595 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:58:27,836 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:27,843 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:58:27,872 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:27,903 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:58:27,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:27 WrapperNode [2018-11-23 09:58:27,904 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:27,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:27,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:58:27,905 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:58:27,915 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:27" (1/1) ... [2018-11-23 09:58:27,929 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:27" (1/1) ... [2018-11-23 09:58:27,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:27,937 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:58:27,937 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:58:27,937 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:58:27,946 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:27" (1/1) ... [2018-11-23 09:58:27,946 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:27" (1/1) ... [2018-11-23 09:58:27,948 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:27" (1/1) ... [2018-11-23 09:58:27,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:27" (1/1) ... [2018-11-23 09:58:27,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:27" (1/1) ... [2018-11-23 09:58:27,971 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:27" (1/1) ... [2018-11-23 09:58:27,973 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:27" (1/1) ... [2018-11-23 09:58:27,975 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:58:27,976 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:58:27,976 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:58:27,976 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:58:27,978 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:28,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:58:28,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:58:28,102 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:58:28,102 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:58:28,102 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:58:28,102 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:58:28,102 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:58:28,103 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:58:28,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:58:28,103 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:58:28,103 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:58:28,103 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:58:28,727 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:58:28,728 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 09:58:28,728 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:28 BoogieIcfgContainer [2018-11-23 09:58:28,728 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:58:28,729 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:58:28,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:58:28,733 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:58:28,734 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:58:27" (1/3) ... [2018-11-23 09:58:28,734 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4246f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:28, skipping insertion in model container [2018-11-23 09:58:28,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:27" (2/3) ... [2018-11-23 09:58:28,735 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b4246f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:28, skipping insertion in model container [2018-11-23 09:58:28,735 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:28" (3/3) ... [2018-11-23 09:58:28,737 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_copyInitSum2_false-unreach-call_ground.i [2018-11-23 09:58:28,748 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:58:28,758 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:58:28,777 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:58:28,815 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:58:28,816 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:58:28,816 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:58:28,816 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:58:28,817 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:58:28,817 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:58:28,817 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:58:28,817 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:58:28,818 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:58:28,840 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-11-23 09:58:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 09:58:28,850 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:28,851 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:28,853 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:28,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:28,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1001985310, now seen corresponding path program 1 times [2018-11-23 09:58:28,864 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:28,865 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:28,891 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:28,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:28,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:28,970 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:29,141 INFO L256 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2018-11-23 09:58:29,145 INFO L273 TraceCheckUtils]: 1: Hoare triple {32#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {32#true} is VALID [2018-11-23 09:58:29,146 INFO L273 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2018-11-23 09:58:29,147 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #76#return; {32#true} is VALID [2018-11-23 09:58:29,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret6 := main(); {32#true} is VALID [2018-11-23 09:58:29,147 INFO L273 TraceCheckUtils]: 5: Hoare triple {32#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {32#true} is VALID [2018-11-23 09:58:29,160 INFO L273 TraceCheckUtils]: 6: Hoare triple {32#true} assume !true; {33#false} is VALID [2018-11-23 09:58:29,161 INFO L273 TraceCheckUtils]: 7: Hoare triple {33#false} ~i~0 := 0bv32; {33#false} is VALID [2018-11-23 09:58:29,161 INFO L273 TraceCheckUtils]: 8: Hoare triple {33#false} assume !~bvslt32(~i~0, 100000bv32); {33#false} is VALID [2018-11-23 09:58:29,162 INFO L273 TraceCheckUtils]: 9: Hoare triple {33#false} ~i~0 := 0bv32; {33#false} is VALID [2018-11-23 09:58:29,162 INFO L273 TraceCheckUtils]: 10: Hoare triple {33#false} assume !~bvslt32(~i~0, 100000bv32); {33#false} is VALID [2018-11-23 09:58:29,163 INFO L273 TraceCheckUtils]: 11: Hoare triple {33#false} havoc ~x~0;~x~0 := 0bv32; {33#false} is VALID [2018-11-23 09:58:29,163 INFO L273 TraceCheckUtils]: 12: Hoare triple {33#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {33#false} is VALID [2018-11-23 09:58:29,163 INFO L256 TraceCheckUtils]: 13: Hoare triple {33#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {33#false} is VALID [2018-11-23 09:58:29,164 INFO L273 TraceCheckUtils]: 14: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2018-11-23 09:58:29,164 INFO L273 TraceCheckUtils]: 15: Hoare triple {33#false} assume 0bv32 == ~cond; {33#false} is VALID [2018-11-23 09:58:29,164 INFO L273 TraceCheckUtils]: 16: Hoare triple {33#false} assume !false; {33#false} is VALID [2018-11-23 09:58:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:29,169 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:29,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:29,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:58:29,182 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 09:58:29,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:29,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:58:29,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:29,388 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:58:29,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:58:29,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:29,401 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2018-11-23 09:58:29,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:29,593 INFO L93 Difference]: Finished difference Result 51 states and 66 transitions. [2018-11-23 09:58:29,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:58:29,593 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2018-11-23 09:58:29,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:29,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:29,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 09:58:29,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:29,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2018-11-23 09:58:29,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2018-11-23 09:58:29,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:29,985 INFO L225 Difference]: With dead ends: 51 [2018-11-23 09:58:29,985 INFO L226 Difference]: Without dead ends: 24 [2018-11-23 09:58:29,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:30,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-11-23 09:58:30,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-23 09:58:30,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:30,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2018-11-23 09:58:30,051 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 09:58:30,051 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 09:58:30,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:30,056 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 09:58:30,056 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 09:58:30,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:30,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:30,057 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2018-11-23 09:58:30,057 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2018-11-23 09:58:30,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:30,062 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2018-11-23 09:58:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 09:58:30,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:30,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:30,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:30,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:30,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:30,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-11-23 09:58:30,069 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 17 [2018-11-23 09:58:30,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:30,069 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-11-23 09:58:30,069 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:58:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-11-23 09:58:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 09:58:30,070 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:30,071 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:30,071 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:30,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:30,072 INFO L82 PathProgramCache]: Analyzing trace with hash -400143846, now seen corresponding path program 1 times [2018-11-23 09:58:30,072 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:30,072 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:30,102 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:30,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:30,147 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:30,476 INFO L256 TraceCheckUtils]: 0: Hoare triple {232#true} call ULTIMATE.init(); {232#true} is VALID [2018-11-23 09:58:30,478 INFO L273 TraceCheckUtils]: 1: Hoare triple {232#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {232#true} is VALID [2018-11-23 09:58:30,479 INFO L273 TraceCheckUtils]: 2: Hoare triple {232#true} assume true; {232#true} is VALID [2018-11-23 09:58:30,479 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {232#true} {232#true} #76#return; {232#true} is VALID [2018-11-23 09:58:30,479 INFO L256 TraceCheckUtils]: 4: Hoare triple {232#true} call #t~ret6 := main(); {232#true} is VALID [2018-11-23 09:58:30,489 INFO L273 TraceCheckUtils]: 5: Hoare triple {232#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {252#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:30,491 INFO L273 TraceCheckUtils]: 6: Hoare triple {252#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {233#false} is VALID [2018-11-23 09:58:30,491 INFO L273 TraceCheckUtils]: 7: Hoare triple {233#false} ~i~0 := 0bv32; {233#false} is VALID [2018-11-23 09:58:30,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {233#false} assume !~bvslt32(~i~0, 100000bv32); {233#false} is VALID [2018-11-23 09:58:30,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {233#false} ~i~0 := 0bv32; {233#false} is VALID [2018-11-23 09:58:30,493 INFO L273 TraceCheckUtils]: 10: Hoare triple {233#false} assume !~bvslt32(~i~0, 100000bv32); {233#false} is VALID [2018-11-23 09:58:30,493 INFO L273 TraceCheckUtils]: 11: Hoare triple {233#false} havoc ~x~0;~x~0 := 0bv32; {233#false} is VALID [2018-11-23 09:58:30,493 INFO L273 TraceCheckUtils]: 12: Hoare triple {233#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {233#false} is VALID [2018-11-23 09:58:30,493 INFO L256 TraceCheckUtils]: 13: Hoare triple {233#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {233#false} is VALID [2018-11-23 09:58:30,494 INFO L273 TraceCheckUtils]: 14: Hoare triple {233#false} ~cond := #in~cond; {233#false} is VALID [2018-11-23 09:58:30,495 INFO L273 TraceCheckUtils]: 15: Hoare triple {233#false} assume 0bv32 == ~cond; {233#false} is VALID [2018-11-23 09:58:30,495 INFO L273 TraceCheckUtils]: 16: Hoare triple {233#false} assume !false; {233#false} is VALID [2018-11-23 09:58:30,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 09:58:30,497 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:30,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:30,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:30,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 09:58:30,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:30,509 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:58:30,572 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:30,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:30,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:30,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:30,573 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2018-11-23 09:58:31,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:31,177 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2018-11-23 09:58:31,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:31,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2018-11-23 09:58:31,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:31,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:31,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 09:58:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:31,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2018-11-23 09:58:31,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2018-11-23 09:58:31,323 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:31,325 INFO L225 Difference]: With dead ends: 46 [2018-11-23 09:58:31,325 INFO L226 Difference]: Without dead ends: 29 [2018-11-23 09:58:31,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:31,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-11-23 09:58:31,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-23 09:58:31,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:31,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand 27 states. [2018-11-23 09:58:31,339 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 27 states. [2018-11-23 09:58:31,340 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 27 states. [2018-11-23 09:58:31,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:31,343 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 09:58:31,343 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 09:58:31,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:31,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:31,344 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 29 states. [2018-11-23 09:58:31,345 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 29 states. [2018-11-23 09:58:31,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:31,347 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2018-11-23 09:58:31,348 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-11-23 09:58:31,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:31,349 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:31,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:31,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 09:58:31,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2018-11-23 09:58:31,352 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 17 [2018-11-23 09:58:31,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:31,352 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2018-11-23 09:58:31,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:31,353 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2018-11-23 09:58:31,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 09:58:31,353 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:31,354 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] [2018-11-23 09:58:31,354 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:31,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:31,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1150570790, now seen corresponding path program 1 times [2018-11-23 09:58:31,355 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:31,355 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:31,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:31,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:31,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:31,619 INFO L256 TraceCheckUtils]: 0: Hoare triple {447#true} call ULTIMATE.init(); {447#true} is VALID [2018-11-23 09:58:31,620 INFO L273 TraceCheckUtils]: 1: Hoare triple {447#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {447#true} is VALID [2018-11-23 09:58:31,620 INFO L273 TraceCheckUtils]: 2: Hoare triple {447#true} assume true; {447#true} is VALID [2018-11-23 09:58:31,620 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {447#true} {447#true} #76#return; {447#true} is VALID [2018-11-23 09:58:31,621 INFO L256 TraceCheckUtils]: 4: Hoare triple {447#true} call #t~ret6 := main(); {447#true} is VALID [2018-11-23 09:58:31,622 INFO L273 TraceCheckUtils]: 5: Hoare triple {447#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {467#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:31,623 INFO L273 TraceCheckUtils]: 6: Hoare triple {467#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {471#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:31,624 INFO L273 TraceCheckUtils]: 7: Hoare triple {471#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {448#false} is VALID [2018-11-23 09:58:31,624 INFO L273 TraceCheckUtils]: 8: Hoare triple {448#false} ~i~0 := 0bv32; {448#false} is VALID [2018-11-23 09:58:31,624 INFO L273 TraceCheckUtils]: 9: Hoare triple {448#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {448#false} is VALID [2018-11-23 09:58:31,624 INFO L273 TraceCheckUtils]: 10: Hoare triple {448#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {448#false} is VALID [2018-11-23 09:58:31,625 INFO L273 TraceCheckUtils]: 11: Hoare triple {448#false} assume !~bvslt32(~i~0, 100000bv32); {448#false} is VALID [2018-11-23 09:58:31,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {448#false} ~i~0 := 0bv32; {448#false} is VALID [2018-11-23 09:58:31,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {448#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {448#false} is VALID [2018-11-23 09:58:31,627 INFO L273 TraceCheckUtils]: 14: Hoare triple {448#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {448#false} is VALID [2018-11-23 09:58:31,627 INFO L273 TraceCheckUtils]: 15: Hoare triple {448#false} assume !~bvslt32(~i~0, 100000bv32); {448#false} is VALID [2018-11-23 09:58:31,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {448#false} havoc ~x~0;~x~0 := 0bv32; {448#false} is VALID [2018-11-23 09:58:31,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {448#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {448#false} is VALID [2018-11-23 09:58:31,629 INFO L256 TraceCheckUtils]: 18: Hoare triple {448#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {448#false} is VALID [2018-11-23 09:58:31,629 INFO L273 TraceCheckUtils]: 19: Hoare triple {448#false} ~cond := #in~cond; {448#false} is VALID [2018-11-23 09:58:31,629 INFO L273 TraceCheckUtils]: 20: Hoare triple {448#false} assume 0bv32 == ~cond; {448#false} is VALID [2018-11-23 09:58:31,630 INFO L273 TraceCheckUtils]: 21: Hoare triple {448#false} assume !false; {448#false} is VALID [2018-11-23 09:58:31,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 09:58:31,631 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:31,721 INFO L273 TraceCheckUtils]: 21: Hoare triple {448#false} assume !false; {448#false} is VALID [2018-11-23 09:58:31,722 INFO L273 TraceCheckUtils]: 20: Hoare triple {448#false} assume 0bv32 == ~cond; {448#false} is VALID [2018-11-23 09:58:31,722 INFO L273 TraceCheckUtils]: 19: Hoare triple {448#false} ~cond := #in~cond; {448#false} is VALID [2018-11-23 09:58:31,722 INFO L256 TraceCheckUtils]: 18: Hoare triple {448#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {448#false} is VALID [2018-11-23 09:58:31,723 INFO L273 TraceCheckUtils]: 17: Hoare triple {448#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {448#false} is VALID [2018-11-23 09:58:31,723 INFO L273 TraceCheckUtils]: 16: Hoare triple {448#false} havoc ~x~0;~x~0 := 0bv32; {448#false} is VALID [2018-11-23 09:58:31,723 INFO L273 TraceCheckUtils]: 15: Hoare triple {448#false} assume !~bvslt32(~i~0, 100000bv32); {448#false} is VALID [2018-11-23 09:58:31,724 INFO L273 TraceCheckUtils]: 14: Hoare triple {448#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {448#false} is VALID [2018-11-23 09:58:31,724 INFO L273 TraceCheckUtils]: 13: Hoare triple {448#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {448#false} is VALID [2018-11-23 09:58:31,724 INFO L273 TraceCheckUtils]: 12: Hoare triple {448#false} ~i~0 := 0bv32; {448#false} is VALID [2018-11-23 09:58:31,725 INFO L273 TraceCheckUtils]: 11: Hoare triple {448#false} assume !~bvslt32(~i~0, 100000bv32); {448#false} is VALID [2018-11-23 09:58:31,725 INFO L273 TraceCheckUtils]: 10: Hoare triple {448#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {448#false} is VALID [2018-11-23 09:58:31,725 INFO L273 TraceCheckUtils]: 9: Hoare triple {448#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {448#false} is VALID [2018-11-23 09:58:31,725 INFO L273 TraceCheckUtils]: 8: Hoare triple {448#false} ~i~0 := 0bv32; {448#false} is VALID [2018-11-23 09:58:31,727 INFO L273 TraceCheckUtils]: 7: Hoare triple {559#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {448#false} is VALID [2018-11-23 09:58:31,730 INFO L273 TraceCheckUtils]: 6: Hoare triple {563#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {559#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:31,734 INFO L273 TraceCheckUtils]: 5: Hoare triple {447#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {563#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:31,735 INFO L256 TraceCheckUtils]: 4: Hoare triple {447#true} call #t~ret6 := main(); {447#true} is VALID [2018-11-23 09:58:31,735 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {447#true} {447#true} #76#return; {447#true} is VALID [2018-11-23 09:58:31,735 INFO L273 TraceCheckUtils]: 2: Hoare triple {447#true} assume true; {447#true} is VALID [2018-11-23 09:58:31,736 INFO L273 TraceCheckUtils]: 1: Hoare triple {447#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {447#true} is VALID [2018-11-23 09:58:31,736 INFO L256 TraceCheckUtils]: 0: Hoare triple {447#true} call ULTIMATE.init(); {447#true} is VALID [2018-11-23 09:58:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-23 09:58:31,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:31,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:58:31,739 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 09:58:31,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:31,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:58:31,797 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:31,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:58:31,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:58:31,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:58:31,799 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 6 states. [2018-11-23 09:58:32,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:32,522 INFO L93 Difference]: Finished difference Result 61 states and 75 transitions. [2018-11-23 09:58:32,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:58:32,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 09:58:32,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:32,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:32,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-23 09:58:32,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:32,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2018-11-23 09:58:32,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2018-11-23 09:58:32,708 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:32,710 INFO L225 Difference]: With dead ends: 61 [2018-11-23 09:58:32,711 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 09:58:32,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:58:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 09:58:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2018-11-23 09:58:32,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:32,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 42 states. [2018-11-23 09:58:32,783 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 09:58:32,783 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 09:58:32,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:32,786 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-23 09:58:32,786 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 09:58:32,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:32,787 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:32,787 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 42 states. [2018-11-23 09:58:32,787 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 42 states. [2018-11-23 09:58:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:32,790 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2018-11-23 09:58:32,791 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 09:58:32,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:32,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:32,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:32,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-11-23 09:58:32,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-11-23 09:58:32,795 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 22 [2018-11-23 09:58:32,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:32,795 INFO L480 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-11-23 09:58:32,795 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:58:32,795 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-11-23 09:58:32,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 09:58:32,797 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:32,797 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:32,797 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:32,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:32,798 INFO L82 PathProgramCache]: Analyzing trace with hash -125121014, now seen corresponding path program 2 times [2018-11-23 09:58:32,799 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:32,799 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:32,819 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:58:32,895 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:58:32,895 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:32,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:32,915 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:33,056 INFO L256 TraceCheckUtils]: 0: Hoare triple {824#true} call ULTIMATE.init(); {824#true} is VALID [2018-11-23 09:58:33,056 INFO L273 TraceCheckUtils]: 1: Hoare triple {824#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {824#true} is VALID [2018-11-23 09:58:33,057 INFO L273 TraceCheckUtils]: 2: Hoare triple {824#true} assume true; {824#true} is VALID [2018-11-23 09:58:33,057 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {824#true} {824#true} #76#return; {824#true} is VALID [2018-11-23 09:58:33,057 INFO L256 TraceCheckUtils]: 4: Hoare triple {824#true} call #t~ret6 := main(); {824#true} is VALID [2018-11-23 09:58:33,058 INFO L273 TraceCheckUtils]: 5: Hoare triple {824#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {844#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:33,059 INFO L273 TraceCheckUtils]: 6: Hoare triple {844#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {848#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:33,059 INFO L273 TraceCheckUtils]: 7: Hoare triple {848#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {852#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:58:33,061 INFO L273 TraceCheckUtils]: 8: Hoare triple {852#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {856#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:33,062 INFO L273 TraceCheckUtils]: 9: Hoare triple {856#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {860#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:33,063 INFO L273 TraceCheckUtils]: 10: Hoare triple {860#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {825#false} is VALID [2018-11-23 09:58:33,063 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#false} ~i~0 := 0bv32; {825#false} is VALID [2018-11-23 09:58:33,063 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {825#false} is VALID [2018-11-23 09:58:33,064 INFO L273 TraceCheckUtils]: 13: Hoare triple {825#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {825#false} is VALID [2018-11-23 09:58:33,064 INFO L273 TraceCheckUtils]: 14: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {825#false} is VALID [2018-11-23 09:58:33,065 INFO L273 TraceCheckUtils]: 15: Hoare triple {825#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {825#false} is VALID [2018-11-23 09:58:33,065 INFO L273 TraceCheckUtils]: 16: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {825#false} is VALID [2018-11-23 09:58:33,065 INFO L273 TraceCheckUtils]: 17: Hoare triple {825#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {825#false} is VALID [2018-11-23 09:58:33,066 INFO L273 TraceCheckUtils]: 18: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {825#false} is VALID [2018-11-23 09:58:33,066 INFO L273 TraceCheckUtils]: 19: Hoare triple {825#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {825#false} is VALID [2018-11-23 09:58:33,066 INFO L273 TraceCheckUtils]: 20: Hoare triple {825#false} assume !~bvslt32(~i~0, 100000bv32); {825#false} is VALID [2018-11-23 09:58:33,067 INFO L273 TraceCheckUtils]: 21: Hoare triple {825#false} ~i~0 := 0bv32; {825#false} is VALID [2018-11-23 09:58:33,067 INFO L273 TraceCheckUtils]: 22: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {825#false} is VALID [2018-11-23 09:58:33,067 INFO L273 TraceCheckUtils]: 23: Hoare triple {825#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {825#false} is VALID [2018-11-23 09:58:33,067 INFO L273 TraceCheckUtils]: 24: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {825#false} is VALID [2018-11-23 09:58:33,068 INFO L273 TraceCheckUtils]: 25: Hoare triple {825#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {825#false} is VALID [2018-11-23 09:58:33,068 INFO L273 TraceCheckUtils]: 26: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {825#false} is VALID [2018-11-23 09:58:33,068 INFO L273 TraceCheckUtils]: 27: Hoare triple {825#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {825#false} is VALID [2018-11-23 09:58:33,068 INFO L273 TraceCheckUtils]: 28: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {825#false} is VALID [2018-11-23 09:58:33,069 INFO L273 TraceCheckUtils]: 29: Hoare triple {825#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {825#false} is VALID [2018-11-23 09:58:33,069 INFO L273 TraceCheckUtils]: 30: Hoare triple {825#false} assume !~bvslt32(~i~0, 100000bv32); {825#false} is VALID [2018-11-23 09:58:33,069 INFO L273 TraceCheckUtils]: 31: Hoare triple {825#false} havoc ~x~0;~x~0 := 0bv32; {825#false} is VALID [2018-11-23 09:58:33,070 INFO L273 TraceCheckUtils]: 32: Hoare triple {825#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {825#false} is VALID [2018-11-23 09:58:33,070 INFO L256 TraceCheckUtils]: 33: Hoare triple {825#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {825#false} is VALID [2018-11-23 09:58:33,070 INFO L273 TraceCheckUtils]: 34: Hoare triple {825#false} ~cond := #in~cond; {825#false} is VALID [2018-11-23 09:58:33,071 INFO L273 TraceCheckUtils]: 35: Hoare triple {825#false} assume 0bv32 == ~cond; {825#false} is VALID [2018-11-23 09:58:33,071 INFO L273 TraceCheckUtils]: 36: Hoare triple {825#false} assume !false; {825#false} is VALID [2018-11-23 09:58:33,073 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 09:58:33,074 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:33,294 INFO L273 TraceCheckUtils]: 36: Hoare triple {825#false} assume !false; {825#false} is VALID [2018-11-23 09:58:33,295 INFO L273 TraceCheckUtils]: 35: Hoare triple {825#false} assume 0bv32 == ~cond; {825#false} is VALID [2018-11-23 09:58:33,295 INFO L273 TraceCheckUtils]: 34: Hoare triple {825#false} ~cond := #in~cond; {825#false} is VALID [2018-11-23 09:58:33,296 INFO L256 TraceCheckUtils]: 33: Hoare triple {825#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {825#false} is VALID [2018-11-23 09:58:33,296 INFO L273 TraceCheckUtils]: 32: Hoare triple {825#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {825#false} is VALID [2018-11-23 09:58:33,297 INFO L273 TraceCheckUtils]: 31: Hoare triple {825#false} havoc ~x~0;~x~0 := 0bv32; {825#false} is VALID [2018-11-23 09:58:33,297 INFO L273 TraceCheckUtils]: 30: Hoare triple {825#false} assume !~bvslt32(~i~0, 100000bv32); {825#false} is VALID [2018-11-23 09:58:33,298 INFO L273 TraceCheckUtils]: 29: Hoare triple {825#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {825#false} is VALID [2018-11-23 09:58:33,298 INFO L273 TraceCheckUtils]: 28: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {825#false} is VALID [2018-11-23 09:58:33,298 INFO L273 TraceCheckUtils]: 27: Hoare triple {825#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {825#false} is VALID [2018-11-23 09:58:33,299 INFO L273 TraceCheckUtils]: 26: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {825#false} is VALID [2018-11-23 09:58:33,299 INFO L273 TraceCheckUtils]: 25: Hoare triple {825#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {825#false} is VALID [2018-11-23 09:58:33,299 INFO L273 TraceCheckUtils]: 24: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {825#false} is VALID [2018-11-23 09:58:33,300 INFO L273 TraceCheckUtils]: 23: Hoare triple {825#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {825#false} is VALID [2018-11-23 09:58:33,300 INFO L273 TraceCheckUtils]: 22: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {825#false} is VALID [2018-11-23 09:58:33,300 INFO L273 TraceCheckUtils]: 21: Hoare triple {825#false} ~i~0 := 0bv32; {825#false} is VALID [2018-11-23 09:58:33,301 INFO L273 TraceCheckUtils]: 20: Hoare triple {825#false} assume !~bvslt32(~i~0, 100000bv32); {825#false} is VALID [2018-11-23 09:58:33,301 INFO L273 TraceCheckUtils]: 19: Hoare triple {825#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {825#false} is VALID [2018-11-23 09:58:33,301 INFO L273 TraceCheckUtils]: 18: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {825#false} is VALID [2018-11-23 09:58:33,301 INFO L273 TraceCheckUtils]: 17: Hoare triple {825#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {825#false} is VALID [2018-11-23 09:58:33,302 INFO L273 TraceCheckUtils]: 16: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {825#false} is VALID [2018-11-23 09:58:33,302 INFO L273 TraceCheckUtils]: 15: Hoare triple {825#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {825#false} is VALID [2018-11-23 09:58:33,302 INFO L273 TraceCheckUtils]: 14: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {825#false} is VALID [2018-11-23 09:58:33,303 INFO L273 TraceCheckUtils]: 13: Hoare triple {825#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {825#false} is VALID [2018-11-23 09:58:33,303 INFO L273 TraceCheckUtils]: 12: Hoare triple {825#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {825#false} is VALID [2018-11-23 09:58:33,303 INFO L273 TraceCheckUtils]: 11: Hoare triple {825#false} ~i~0 := 0bv32; {825#false} is VALID [2018-11-23 09:58:33,317 INFO L273 TraceCheckUtils]: 10: Hoare triple {1020#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {825#false} is VALID [2018-11-23 09:58:33,319 INFO L273 TraceCheckUtils]: 9: Hoare triple {1024#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1020#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:33,325 INFO L273 TraceCheckUtils]: 8: Hoare triple {1028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1024#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:33,331 INFO L273 TraceCheckUtils]: 7: Hoare triple {1032#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1028#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:33,337 INFO L273 TraceCheckUtils]: 6: Hoare triple {1036#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1032#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:33,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {824#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1036#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:33,341 INFO L256 TraceCheckUtils]: 4: Hoare triple {824#true} call #t~ret6 := main(); {824#true} is VALID [2018-11-23 09:58:33,341 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {824#true} {824#true} #76#return; {824#true} is VALID [2018-11-23 09:58:33,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {824#true} assume true; {824#true} is VALID [2018-11-23 09:58:33,342 INFO L273 TraceCheckUtils]: 1: Hoare triple {824#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {824#true} is VALID [2018-11-23 09:58:33,342 INFO L256 TraceCheckUtils]: 0: Hoare triple {824#true} call ULTIMATE.init(); {824#true} is VALID [2018-11-23 09:58:33,344 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-11-23 09:58:33,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:33,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:58:33,347 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 09:58:33,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:33,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 09:58:33,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:33,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:58:33,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:58:33,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:58:33,418 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 12 states. [2018-11-23 09:58:35,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:35,367 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2018-11-23 09:58:35,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:58:35,367 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 37 [2018-11-23 09:58:35,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:35,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:35,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-23 09:58:35,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:35,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 112 transitions. [2018-11-23 09:58:35,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 112 transitions. [2018-11-23 09:58:35,658 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 09:58:35,661 INFO L225 Difference]: With dead ends: 103 [2018-11-23 09:58:35,661 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 09:58:35,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2018-11-23 09:58:35,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 09:58:35,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2018-11-23 09:58:35,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:35,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand 72 states. [2018-11-23 09:58:35,725 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 09:58:35,725 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 09:58:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:35,729 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-11-23 09:58:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-23 09:58:35,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:35,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:35,730 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand 72 states. [2018-11-23 09:58:35,730 INFO L87 Difference]: Start difference. First operand 72 states. Second operand 72 states. [2018-11-23 09:58:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:35,735 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2018-11-23 09:58:35,735 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-23 09:58:35,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:35,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:35,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:35,737 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:35,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-11-23 09:58:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2018-11-23 09:58:35,740 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 37 [2018-11-23 09:58:35,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:35,741 INFO L480 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2018-11-23 09:58:35,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:58:35,741 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2018-11-23 09:58:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 09:58:35,743 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:35,743 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:35,744 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:35,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1207107598, now seen corresponding path program 3 times [2018-11-23 09:58:35,745 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:35,745 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:35,774 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:58:36,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 09:58:36,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:36,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:36,379 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:36,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {1477#true} call ULTIMATE.init(); {1477#true} is VALID [2018-11-23 09:58:36,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {1477#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1477#true} is VALID [2018-11-23 09:58:36,698 INFO L273 TraceCheckUtils]: 2: Hoare triple {1477#true} assume true; {1477#true} is VALID [2018-11-23 09:58:36,698 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1477#true} {1477#true} #76#return; {1477#true} is VALID [2018-11-23 09:58:36,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {1477#true} call #t~ret6 := main(); {1477#true} is VALID [2018-11-23 09:58:36,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {1477#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1497#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:36,699 INFO L273 TraceCheckUtils]: 6: Hoare triple {1497#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1501#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,701 INFO L273 TraceCheckUtils]: 7: Hoare triple {1501#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1505#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,702 INFO L273 TraceCheckUtils]: 8: Hoare triple {1505#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1509#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,703 INFO L273 TraceCheckUtils]: 9: Hoare triple {1509#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1513#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,704 INFO L273 TraceCheckUtils]: 10: Hoare triple {1513#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1517#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,705 INFO L273 TraceCheckUtils]: 11: Hoare triple {1517#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1521#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,707 INFO L273 TraceCheckUtils]: 12: Hoare triple {1521#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1525#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,709 INFO L273 TraceCheckUtils]: 13: Hoare triple {1525#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1529#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 09:58:36,710 INFO L273 TraceCheckUtils]: 14: Hoare triple {1529#(= (_ bv8 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1533#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,710 INFO L273 TraceCheckUtils]: 15: Hoare triple {1533#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1537#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:36,711 INFO L273 TraceCheckUtils]: 16: Hoare triple {1537#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {1478#false} is VALID [2018-11-23 09:58:36,711 INFO L273 TraceCheckUtils]: 17: Hoare triple {1478#false} ~i~0 := 0bv32; {1478#false} is VALID [2018-11-23 09:58:36,711 INFO L273 TraceCheckUtils]: 18: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:36,712 INFO L273 TraceCheckUtils]: 19: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:36,712 INFO L273 TraceCheckUtils]: 20: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:36,713 INFO L273 TraceCheckUtils]: 21: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:36,713 INFO L273 TraceCheckUtils]: 22: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:36,713 INFO L273 TraceCheckUtils]: 23: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:36,714 INFO L273 TraceCheckUtils]: 24: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:36,714 INFO L273 TraceCheckUtils]: 25: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:36,714 INFO L273 TraceCheckUtils]: 26: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:36,714 INFO L273 TraceCheckUtils]: 27: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:36,715 INFO L273 TraceCheckUtils]: 28: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:36,715 INFO L273 TraceCheckUtils]: 29: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:36,715 INFO L273 TraceCheckUtils]: 30: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:36,715 INFO L273 TraceCheckUtils]: 31: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:36,716 INFO L273 TraceCheckUtils]: 32: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:36,716 INFO L273 TraceCheckUtils]: 33: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:36,716 INFO L273 TraceCheckUtils]: 34: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:36,716 INFO L273 TraceCheckUtils]: 35: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:36,716 INFO L273 TraceCheckUtils]: 36: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:36,717 INFO L273 TraceCheckUtils]: 37: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:36,717 INFO L273 TraceCheckUtils]: 38: Hoare triple {1478#false} assume !~bvslt32(~i~0, 100000bv32); {1478#false} is VALID [2018-11-23 09:58:36,717 INFO L273 TraceCheckUtils]: 39: Hoare triple {1478#false} ~i~0 := 0bv32; {1478#false} is VALID [2018-11-23 09:58:36,718 INFO L273 TraceCheckUtils]: 40: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:36,718 INFO L273 TraceCheckUtils]: 41: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:36,718 INFO L273 TraceCheckUtils]: 42: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:36,719 INFO L273 TraceCheckUtils]: 43: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:36,719 INFO L273 TraceCheckUtils]: 44: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:36,719 INFO L273 TraceCheckUtils]: 45: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:36,719 INFO L273 TraceCheckUtils]: 46: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:36,720 INFO L273 TraceCheckUtils]: 47: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:36,720 INFO L273 TraceCheckUtils]: 48: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:36,720 INFO L273 TraceCheckUtils]: 49: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:36,721 INFO L273 TraceCheckUtils]: 50: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:36,721 INFO L273 TraceCheckUtils]: 51: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:36,721 INFO L273 TraceCheckUtils]: 52: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:36,721 INFO L273 TraceCheckUtils]: 53: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:36,722 INFO L273 TraceCheckUtils]: 54: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:36,722 INFO L273 TraceCheckUtils]: 55: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:36,722 INFO L273 TraceCheckUtils]: 56: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:36,722 INFO L273 TraceCheckUtils]: 57: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:36,723 INFO L273 TraceCheckUtils]: 58: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:36,723 INFO L273 TraceCheckUtils]: 59: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:36,723 INFO L273 TraceCheckUtils]: 60: Hoare triple {1478#false} assume !~bvslt32(~i~0, 100000bv32); {1478#false} is VALID [2018-11-23 09:58:36,723 INFO L273 TraceCheckUtils]: 61: Hoare triple {1478#false} havoc ~x~0;~x~0 := 0bv32; {1478#false} is VALID [2018-11-23 09:58:36,724 INFO L273 TraceCheckUtils]: 62: Hoare triple {1478#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1478#false} is VALID [2018-11-23 09:58:36,724 INFO L256 TraceCheckUtils]: 63: Hoare triple {1478#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {1478#false} is VALID [2018-11-23 09:58:36,724 INFO L273 TraceCheckUtils]: 64: Hoare triple {1478#false} ~cond := #in~cond; {1478#false} is VALID [2018-11-23 09:58:36,724 INFO L273 TraceCheckUtils]: 65: Hoare triple {1478#false} assume 0bv32 == ~cond; {1478#false} is VALID [2018-11-23 09:58:36,724 INFO L273 TraceCheckUtils]: 66: Hoare triple {1478#false} assume !false; {1478#false} is VALID [2018-11-23 09:58:36,729 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 09:58:36,729 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:37,339 INFO L273 TraceCheckUtils]: 66: Hoare triple {1478#false} assume !false; {1478#false} is VALID [2018-11-23 09:58:37,340 INFO L273 TraceCheckUtils]: 65: Hoare triple {1478#false} assume 0bv32 == ~cond; {1478#false} is VALID [2018-11-23 09:58:37,340 INFO L273 TraceCheckUtils]: 64: Hoare triple {1478#false} ~cond := #in~cond; {1478#false} is VALID [2018-11-23 09:58:37,341 INFO L256 TraceCheckUtils]: 63: Hoare triple {1478#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {1478#false} is VALID [2018-11-23 09:58:37,341 INFO L273 TraceCheckUtils]: 62: Hoare triple {1478#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1478#false} is VALID [2018-11-23 09:58:37,342 INFO L273 TraceCheckUtils]: 61: Hoare triple {1478#false} havoc ~x~0;~x~0 := 0bv32; {1478#false} is VALID [2018-11-23 09:58:37,342 INFO L273 TraceCheckUtils]: 60: Hoare triple {1478#false} assume !~bvslt32(~i~0, 100000bv32); {1478#false} is VALID [2018-11-23 09:58:37,342 INFO L273 TraceCheckUtils]: 59: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:37,342 INFO L273 TraceCheckUtils]: 58: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:37,342 INFO L273 TraceCheckUtils]: 57: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:37,343 INFO L273 TraceCheckUtils]: 56: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:37,343 INFO L273 TraceCheckUtils]: 55: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:37,343 INFO L273 TraceCheckUtils]: 54: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:37,344 INFO L273 TraceCheckUtils]: 53: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:37,344 INFO L273 TraceCheckUtils]: 52: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:37,344 INFO L273 TraceCheckUtils]: 51: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:37,344 INFO L273 TraceCheckUtils]: 50: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:37,344 INFO L273 TraceCheckUtils]: 49: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:37,345 INFO L273 TraceCheckUtils]: 48: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:37,345 INFO L273 TraceCheckUtils]: 47: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:37,345 INFO L273 TraceCheckUtils]: 46: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:37,345 INFO L273 TraceCheckUtils]: 45: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:37,345 INFO L273 TraceCheckUtils]: 44: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:37,346 INFO L273 TraceCheckUtils]: 43: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:37,346 INFO L273 TraceCheckUtils]: 42: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:37,346 INFO L273 TraceCheckUtils]: 41: Hoare triple {1478#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {1478#false} is VALID [2018-11-23 09:58:37,346 INFO L273 TraceCheckUtils]: 40: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {1478#false} is VALID [2018-11-23 09:58:37,347 INFO L273 TraceCheckUtils]: 39: Hoare triple {1478#false} ~i~0 := 0bv32; {1478#false} is VALID [2018-11-23 09:58:37,347 INFO L273 TraceCheckUtils]: 38: Hoare triple {1478#false} assume !~bvslt32(~i~0, 100000bv32); {1478#false} is VALID [2018-11-23 09:58:37,347 INFO L273 TraceCheckUtils]: 37: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:37,348 INFO L273 TraceCheckUtils]: 36: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:37,348 INFO L273 TraceCheckUtils]: 35: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:37,348 INFO L273 TraceCheckUtils]: 34: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:37,349 INFO L273 TraceCheckUtils]: 33: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:37,349 INFO L273 TraceCheckUtils]: 32: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:37,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:37,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:37,350 INFO L273 TraceCheckUtils]: 29: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:37,350 INFO L273 TraceCheckUtils]: 28: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:37,350 INFO L273 TraceCheckUtils]: 27: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:37,351 INFO L273 TraceCheckUtils]: 26: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:37,351 INFO L273 TraceCheckUtils]: 25: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:37,351 INFO L273 TraceCheckUtils]: 24: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:37,351 INFO L273 TraceCheckUtils]: 23: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:37,352 INFO L273 TraceCheckUtils]: 22: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:37,352 INFO L273 TraceCheckUtils]: 21: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:37,352 INFO L273 TraceCheckUtils]: 20: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:37,353 INFO L273 TraceCheckUtils]: 19: Hoare triple {1478#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {1478#false} is VALID [2018-11-23 09:58:37,353 INFO L273 TraceCheckUtils]: 18: Hoare triple {1478#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {1478#false} is VALID [2018-11-23 09:58:37,353 INFO L273 TraceCheckUtils]: 17: Hoare triple {1478#false} ~i~0 := 0bv32; {1478#false} is VALID [2018-11-23 09:58:37,372 INFO L273 TraceCheckUtils]: 16: Hoare triple {1841#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1478#false} is VALID [2018-11-23 09:58:37,381 INFO L273 TraceCheckUtils]: 15: Hoare triple {1845#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1841#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:37,391 INFO L273 TraceCheckUtils]: 14: Hoare triple {1849#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1845#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,396 INFO L273 TraceCheckUtils]: 13: Hoare triple {1853#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1849#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {1857#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1853#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,409 INFO L273 TraceCheckUtils]: 11: Hoare triple {1861#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1857#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,416 INFO L273 TraceCheckUtils]: 10: Hoare triple {1865#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1861#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,425 INFO L273 TraceCheckUtils]: 9: Hoare triple {1869#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1865#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,430 INFO L273 TraceCheckUtils]: 8: Hoare triple {1873#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1869#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,434 INFO L273 TraceCheckUtils]: 7: Hoare triple {1877#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1873#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,441 INFO L273 TraceCheckUtils]: 6: Hoare triple {1881#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1877#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,442 INFO L273 TraceCheckUtils]: 5: Hoare triple {1477#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1881#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:37,442 INFO L256 TraceCheckUtils]: 4: Hoare triple {1477#true} call #t~ret6 := main(); {1477#true} is VALID [2018-11-23 09:58:37,443 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1477#true} {1477#true} #76#return; {1477#true} is VALID [2018-11-23 09:58:37,443 INFO L273 TraceCheckUtils]: 2: Hoare triple {1477#true} assume true; {1477#true} is VALID [2018-11-23 09:58:37,443 INFO L273 TraceCheckUtils]: 1: Hoare triple {1477#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1477#true} is VALID [2018-11-23 09:58:37,443 INFO L256 TraceCheckUtils]: 0: Hoare triple {1477#true} call ULTIMATE.init(); {1477#true} is VALID [2018-11-23 09:58:37,453 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2018-11-23 09:58:37,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:37,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 09:58:37,458 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-11-23 09:58:37,459 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:37,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 09:58:37,568 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:37,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 09:58:37,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 09:58:37,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 09:58:37,569 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand 24 states. [2018-11-23 09:58:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:45,717 INFO L93 Difference]: Finished difference Result 187 states and 228 transitions. [2018-11-23 09:58:45,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 09:58:45,717 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 67 [2018-11-23 09:58:45,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:45,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:45,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 190 transitions. [2018-11-23 09:58:45,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:58:45,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 190 transitions. [2018-11-23 09:58:45,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 190 transitions. [2018-11-23 09:58:46,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:46,199 INFO L225 Difference]: With dead ends: 187 [2018-11-23 09:58:46,199 INFO L226 Difference]: Without dead ends: 132 [2018-11-23 09:58:46,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 111 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 09:58:46,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-11-23 09:58:46,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2018-11-23 09:58:46,300 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:46,300 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand 132 states. [2018-11-23 09:58:46,300 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 132 states. [2018-11-23 09:58:46,300 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 132 states. [2018-11-23 09:58:46,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:46,305 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-11-23 09:58:46,305 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-11-23 09:58:46,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:46,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:46,306 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand 132 states. [2018-11-23 09:58:46,307 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 132 states. [2018-11-23 09:58:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:46,312 INFO L93 Difference]: Finished difference Result 132 states and 135 transitions. [2018-11-23 09:58:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-11-23 09:58:46,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:46,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:46,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:46,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-11-23 09:58:46,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 135 transitions. [2018-11-23 09:58:46,318 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 135 transitions. Word has length 67 [2018-11-23 09:58:46,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:46,318 INFO L480 AbstractCegarLoop]: Abstraction has 132 states and 135 transitions. [2018-11-23 09:58:46,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 09:58:46,319 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 135 transitions. [2018-11-23 09:58:46,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-11-23 09:58:46,322 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:46,323 INFO L402 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:46,323 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:46,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:46,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1188305858, now seen corresponding path program 4 times [2018-11-23 09:58:46,324 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:46,324 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:58:46,353 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:58:46,579 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:58:46,579 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:46,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:46,666 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:47,337 INFO L256 TraceCheckUtils]: 0: Hoare triple {2682#true} call ULTIMATE.init(); {2682#true} is VALID [2018-11-23 09:58:47,338 INFO L273 TraceCheckUtils]: 1: Hoare triple {2682#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2682#true} is VALID [2018-11-23 09:58:47,338 INFO L273 TraceCheckUtils]: 2: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 09:58:47,338 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2682#true} {2682#true} #76#return; {2682#true} is VALID [2018-11-23 09:58:47,339 INFO L256 TraceCheckUtils]: 4: Hoare triple {2682#true} call #t~ret6 := main(); {2682#true} is VALID [2018-11-23 09:58:47,340 INFO L273 TraceCheckUtils]: 5: Hoare triple {2682#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {2702#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:47,341 INFO L273 TraceCheckUtils]: 6: Hoare triple {2702#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2706#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,342 INFO L273 TraceCheckUtils]: 7: Hoare triple {2706#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2710#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:58:47,342 INFO L273 TraceCheckUtils]: 8: Hoare triple {2710#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2714#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,343 INFO L273 TraceCheckUtils]: 9: Hoare triple {2714#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2718#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:47,344 INFO L273 TraceCheckUtils]: 10: Hoare triple {2718#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2722#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,344 INFO L273 TraceCheckUtils]: 11: Hoare triple {2722#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2726#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 09:58:47,345 INFO L273 TraceCheckUtils]: 12: Hoare triple {2726#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2730#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,346 INFO L273 TraceCheckUtils]: 13: Hoare triple {2730#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2734#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,347 INFO L273 TraceCheckUtils]: 14: Hoare triple {2734#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2738#(= (_ bv9 32) main_~i~0)} is VALID [2018-11-23 09:58:47,347 INFO L273 TraceCheckUtils]: 15: Hoare triple {2738#(= (_ bv9 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2742#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,348 INFO L273 TraceCheckUtils]: 16: Hoare triple {2742#(= (bvadd main_~i~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2746#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,349 INFO L273 TraceCheckUtils]: 17: Hoare triple {2746#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2750#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 09:58:47,358 INFO L273 TraceCheckUtils]: 18: Hoare triple {2750#(= (_ bv12 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2754#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,374 INFO L273 TraceCheckUtils]: 19: Hoare triple {2754#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2758#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,389 INFO L273 TraceCheckUtils]: 20: Hoare triple {2758#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2762#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,405 INFO L273 TraceCheckUtils]: 21: Hoare triple {2762#(= (bvadd main_~i~0 (_ bv4294967281 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2766#(= (_ bv16 32) main_~i~0)} is VALID [2018-11-23 09:58:47,417 INFO L273 TraceCheckUtils]: 22: Hoare triple {2766#(= (_ bv16 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2770#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,419 INFO L273 TraceCheckUtils]: 23: Hoare triple {2770#(= (bvadd main_~i~0 (_ bv4294967279 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2774#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,419 INFO L273 TraceCheckUtils]: 24: Hoare triple {2774#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2778#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,420 INFO L273 TraceCheckUtils]: 25: Hoare triple {2778#(= (bvadd main_~i~0 (_ bv4294967277 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2782#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,421 INFO L273 TraceCheckUtils]: 26: Hoare triple {2782#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2786#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,422 INFO L273 TraceCheckUtils]: 27: Hoare triple {2786#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2790#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:47,422 INFO L273 TraceCheckUtils]: 28: Hoare triple {2790#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {2683#false} is VALID [2018-11-23 09:58:47,422 INFO L273 TraceCheckUtils]: 29: Hoare triple {2683#false} ~i~0 := 0bv32; {2683#false} is VALID [2018-11-23 09:58:47,422 INFO L273 TraceCheckUtils]: 30: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,423 INFO L273 TraceCheckUtils]: 31: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,423 INFO L273 TraceCheckUtils]: 32: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,423 INFO L273 TraceCheckUtils]: 33: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,423 INFO L273 TraceCheckUtils]: 34: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,423 INFO L273 TraceCheckUtils]: 35: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,423 INFO L273 TraceCheckUtils]: 36: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,423 INFO L273 TraceCheckUtils]: 37: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,424 INFO L273 TraceCheckUtils]: 38: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,424 INFO L273 TraceCheckUtils]: 39: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,424 INFO L273 TraceCheckUtils]: 40: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,424 INFO L273 TraceCheckUtils]: 41: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,425 INFO L273 TraceCheckUtils]: 42: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,425 INFO L273 TraceCheckUtils]: 43: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,425 INFO L273 TraceCheckUtils]: 44: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,426 INFO L273 TraceCheckUtils]: 45: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,426 INFO L273 TraceCheckUtils]: 46: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,426 INFO L273 TraceCheckUtils]: 47: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,426 INFO L273 TraceCheckUtils]: 48: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,426 INFO L273 TraceCheckUtils]: 49: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,426 INFO L273 TraceCheckUtils]: 50: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,426 INFO L273 TraceCheckUtils]: 51: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,427 INFO L273 TraceCheckUtils]: 52: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,427 INFO L273 TraceCheckUtils]: 53: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,427 INFO L273 TraceCheckUtils]: 54: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,427 INFO L273 TraceCheckUtils]: 55: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,427 INFO L273 TraceCheckUtils]: 56: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,427 INFO L273 TraceCheckUtils]: 57: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,427 INFO L273 TraceCheckUtils]: 58: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,428 INFO L273 TraceCheckUtils]: 59: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,428 INFO L273 TraceCheckUtils]: 60: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,428 INFO L273 TraceCheckUtils]: 61: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,428 INFO L273 TraceCheckUtils]: 62: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,428 INFO L273 TraceCheckUtils]: 63: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,428 INFO L273 TraceCheckUtils]: 64: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,429 INFO L273 TraceCheckUtils]: 65: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,429 INFO L273 TraceCheckUtils]: 66: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,429 INFO L273 TraceCheckUtils]: 67: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,429 INFO L273 TraceCheckUtils]: 68: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,429 INFO L273 TraceCheckUtils]: 69: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,430 INFO L273 TraceCheckUtils]: 70: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,430 INFO L273 TraceCheckUtils]: 71: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,430 INFO L273 TraceCheckUtils]: 72: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:47,430 INFO L273 TraceCheckUtils]: 73: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:47,430 INFO L273 TraceCheckUtils]: 74: Hoare triple {2683#false} assume !~bvslt32(~i~0, 100000bv32); {2683#false} is VALID [2018-11-23 09:58:47,431 INFO L273 TraceCheckUtils]: 75: Hoare triple {2683#false} ~i~0 := 0bv32; {2683#false} is VALID [2018-11-23 09:58:47,431 INFO L273 TraceCheckUtils]: 76: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,431 INFO L273 TraceCheckUtils]: 77: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,431 INFO L273 TraceCheckUtils]: 78: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,431 INFO L273 TraceCheckUtils]: 79: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,432 INFO L273 TraceCheckUtils]: 80: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,432 INFO L273 TraceCheckUtils]: 81: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,432 INFO L273 TraceCheckUtils]: 82: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,432 INFO L273 TraceCheckUtils]: 83: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,432 INFO L273 TraceCheckUtils]: 84: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,433 INFO L273 TraceCheckUtils]: 85: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,433 INFO L273 TraceCheckUtils]: 86: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,433 INFO L273 TraceCheckUtils]: 87: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,433 INFO L273 TraceCheckUtils]: 88: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,433 INFO L273 TraceCheckUtils]: 89: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,434 INFO L273 TraceCheckUtils]: 90: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,434 INFO L273 TraceCheckUtils]: 91: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,434 INFO L273 TraceCheckUtils]: 92: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,434 INFO L273 TraceCheckUtils]: 93: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,435 INFO L273 TraceCheckUtils]: 94: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,435 INFO L273 TraceCheckUtils]: 95: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,435 INFO L273 TraceCheckUtils]: 96: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,435 INFO L273 TraceCheckUtils]: 97: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,435 INFO L273 TraceCheckUtils]: 98: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,436 INFO L273 TraceCheckUtils]: 99: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,436 INFO L273 TraceCheckUtils]: 100: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,436 INFO L273 TraceCheckUtils]: 101: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,436 INFO L273 TraceCheckUtils]: 102: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,436 INFO L273 TraceCheckUtils]: 103: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,437 INFO L273 TraceCheckUtils]: 104: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,437 INFO L273 TraceCheckUtils]: 105: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,437 INFO L273 TraceCheckUtils]: 106: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,437 INFO L273 TraceCheckUtils]: 107: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,438 INFO L273 TraceCheckUtils]: 108: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,438 INFO L273 TraceCheckUtils]: 109: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,438 INFO L273 TraceCheckUtils]: 110: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,438 INFO L273 TraceCheckUtils]: 111: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,438 INFO L273 TraceCheckUtils]: 112: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,439 INFO L273 TraceCheckUtils]: 113: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,439 INFO L273 TraceCheckUtils]: 114: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,439 INFO L273 TraceCheckUtils]: 115: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,439 INFO L273 TraceCheckUtils]: 116: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,439 INFO L273 TraceCheckUtils]: 117: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,439 INFO L273 TraceCheckUtils]: 118: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:47,440 INFO L273 TraceCheckUtils]: 119: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:47,440 INFO L273 TraceCheckUtils]: 120: Hoare triple {2683#false} assume !~bvslt32(~i~0, 100000bv32); {2683#false} is VALID [2018-11-23 09:58:47,440 INFO L273 TraceCheckUtils]: 121: Hoare triple {2683#false} havoc ~x~0;~x~0 := 0bv32; {2683#false} is VALID [2018-11-23 09:58:47,440 INFO L273 TraceCheckUtils]: 122: Hoare triple {2683#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2683#false} is VALID [2018-11-23 09:58:47,440 INFO L256 TraceCheckUtils]: 123: Hoare triple {2683#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {2683#false} is VALID [2018-11-23 09:58:47,440 INFO L273 TraceCheckUtils]: 124: Hoare triple {2683#false} ~cond := #in~cond; {2683#false} is VALID [2018-11-23 09:58:47,440 INFO L273 TraceCheckUtils]: 125: Hoare triple {2683#false} assume 0bv32 == ~cond; {2683#false} is VALID [2018-11-23 09:58:47,441 INFO L273 TraceCheckUtils]: 126: Hoare triple {2683#false} assume !false; {2683#false} is VALID [2018-11-23 09:58:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-11-23 09:58:47,449 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:49,531 INFO L273 TraceCheckUtils]: 126: Hoare triple {2683#false} assume !false; {2683#false} is VALID [2018-11-23 09:58:49,532 INFO L273 TraceCheckUtils]: 125: Hoare triple {2683#false} assume 0bv32 == ~cond; {2683#false} is VALID [2018-11-23 09:58:49,532 INFO L273 TraceCheckUtils]: 124: Hoare triple {2683#false} ~cond := #in~cond; {2683#false} is VALID [2018-11-23 09:58:49,532 INFO L256 TraceCheckUtils]: 123: Hoare triple {2683#false} call __VERIFIER_assert((if #t~mem5 == ~bvadd32(42bv32, ~x~0) then 1bv32 else 0bv32)); {2683#false} is VALID [2018-11-23 09:58:49,533 INFO L273 TraceCheckUtils]: 122: Hoare triple {2683#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem5 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {2683#false} is VALID [2018-11-23 09:58:49,533 INFO L273 TraceCheckUtils]: 121: Hoare triple {2683#false} havoc ~x~0;~x~0 := 0bv32; {2683#false} is VALID [2018-11-23 09:58:49,533 INFO L273 TraceCheckUtils]: 120: Hoare triple {2683#false} assume !~bvslt32(~i~0, 100000bv32); {2683#false} is VALID [2018-11-23 09:58:49,533 INFO L273 TraceCheckUtils]: 119: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,534 INFO L273 TraceCheckUtils]: 118: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,534 INFO L273 TraceCheckUtils]: 117: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,534 INFO L273 TraceCheckUtils]: 116: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,534 INFO L273 TraceCheckUtils]: 115: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,534 INFO L273 TraceCheckUtils]: 114: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,535 INFO L273 TraceCheckUtils]: 113: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,535 INFO L273 TraceCheckUtils]: 112: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,535 INFO L273 TraceCheckUtils]: 111: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,535 INFO L273 TraceCheckUtils]: 110: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,535 INFO L273 TraceCheckUtils]: 109: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,536 INFO L273 TraceCheckUtils]: 108: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,536 INFO L273 TraceCheckUtils]: 107: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,536 INFO L273 TraceCheckUtils]: 106: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,536 INFO L273 TraceCheckUtils]: 105: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,536 INFO L273 TraceCheckUtils]: 104: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,536 INFO L273 TraceCheckUtils]: 103: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,537 INFO L273 TraceCheckUtils]: 102: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,537 INFO L273 TraceCheckUtils]: 101: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,537 INFO L273 TraceCheckUtils]: 100: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,537 INFO L273 TraceCheckUtils]: 99: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,537 INFO L273 TraceCheckUtils]: 98: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,538 INFO L273 TraceCheckUtils]: 97: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,538 INFO L273 TraceCheckUtils]: 96: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,538 INFO L273 TraceCheckUtils]: 95: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,538 INFO L273 TraceCheckUtils]: 94: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,538 INFO L273 TraceCheckUtils]: 93: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,539 INFO L273 TraceCheckUtils]: 92: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,539 INFO L273 TraceCheckUtils]: 91: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,539 INFO L273 TraceCheckUtils]: 90: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,539 INFO L273 TraceCheckUtils]: 89: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,539 INFO L273 TraceCheckUtils]: 88: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,539 INFO L273 TraceCheckUtils]: 87: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,540 INFO L273 TraceCheckUtils]: 86: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,540 INFO L273 TraceCheckUtils]: 85: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,540 INFO L273 TraceCheckUtils]: 84: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,540 INFO L273 TraceCheckUtils]: 83: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,540 INFO L273 TraceCheckUtils]: 82: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,540 INFO L273 TraceCheckUtils]: 81: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,541 INFO L273 TraceCheckUtils]: 80: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,541 INFO L273 TraceCheckUtils]: 79: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,541 INFO L273 TraceCheckUtils]: 78: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,541 INFO L273 TraceCheckUtils]: 77: Hoare triple {2683#false} #t~post2 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post2);havoc #t~post2; {2683#false} is VALID [2018-11-23 09:58:49,541 INFO L273 TraceCheckUtils]: 76: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem3 := read~intINTTYPE4(~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(~bvadd32(#t~mem3, ~i~0), ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem3; {2683#false} is VALID [2018-11-23 09:58:49,542 INFO L273 TraceCheckUtils]: 75: Hoare triple {2683#false} ~i~0 := 0bv32; {2683#false} is VALID [2018-11-23 09:58:49,542 INFO L273 TraceCheckUtils]: 74: Hoare triple {2683#false} assume !~bvslt32(~i~0, 100000bv32); {2683#false} is VALID [2018-11-23 09:58:49,542 INFO L273 TraceCheckUtils]: 73: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,542 INFO L273 TraceCheckUtils]: 72: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,543 INFO L273 TraceCheckUtils]: 71: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,543 INFO L273 TraceCheckUtils]: 70: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,543 INFO L273 TraceCheckUtils]: 69: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,543 INFO L273 TraceCheckUtils]: 68: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,544 INFO L273 TraceCheckUtils]: 67: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,544 INFO L273 TraceCheckUtils]: 66: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,544 INFO L273 TraceCheckUtils]: 65: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,544 INFO L273 TraceCheckUtils]: 64: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,545 INFO L273 TraceCheckUtils]: 63: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,545 INFO L273 TraceCheckUtils]: 62: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,545 INFO L273 TraceCheckUtils]: 61: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,545 INFO L273 TraceCheckUtils]: 60: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,546 INFO L273 TraceCheckUtils]: 59: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,546 INFO L273 TraceCheckUtils]: 58: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,546 INFO L273 TraceCheckUtils]: 57: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,546 INFO L273 TraceCheckUtils]: 56: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,546 INFO L273 TraceCheckUtils]: 55: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,547 INFO L273 TraceCheckUtils]: 54: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,547 INFO L273 TraceCheckUtils]: 53: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,547 INFO L273 TraceCheckUtils]: 52: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,547 INFO L273 TraceCheckUtils]: 51: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,548 INFO L273 TraceCheckUtils]: 50: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,548 INFO L273 TraceCheckUtils]: 49: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,548 INFO L273 TraceCheckUtils]: 48: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,548 INFO L273 TraceCheckUtils]: 47: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,549 INFO L273 TraceCheckUtils]: 46: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,549 INFO L273 TraceCheckUtils]: 45: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,549 INFO L273 TraceCheckUtils]: 44: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,549 INFO L273 TraceCheckUtils]: 43: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,549 INFO L273 TraceCheckUtils]: 42: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,549 INFO L273 TraceCheckUtils]: 41: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,550 INFO L273 TraceCheckUtils]: 40: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,550 INFO L273 TraceCheckUtils]: 39: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,550 INFO L273 TraceCheckUtils]: 38: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,550 INFO L273 TraceCheckUtils]: 37: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,550 INFO L273 TraceCheckUtils]: 36: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,550 INFO L273 TraceCheckUtils]: 35: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,551 INFO L273 TraceCheckUtils]: 34: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,551 INFO L273 TraceCheckUtils]: 33: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,551 INFO L273 TraceCheckUtils]: 32: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,551 INFO L273 TraceCheckUtils]: 31: Hoare triple {2683#false} #t~post0 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post0);havoc #t~post0; {2683#false} is VALID [2018-11-23 09:58:49,551 INFO L273 TraceCheckUtils]: 30: Hoare triple {2683#false} assume !!~bvslt32(~i~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);call write~intINTTYPE4(#t~mem1, ~#b~0.base, ~bvadd32(~#b~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);havoc #t~mem1; {2683#false} is VALID [2018-11-23 09:58:49,552 INFO L273 TraceCheckUtils]: 29: Hoare triple {2683#false} ~i~0 := 0bv32; {2683#false} is VALID [2018-11-23 09:58:49,556 INFO L273 TraceCheckUtils]: 28: Hoare triple {3382#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {2683#false} is VALID [2018-11-23 09:58:49,560 INFO L273 TraceCheckUtils]: 27: Hoare triple {3386#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3382#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:49,565 INFO L273 TraceCheckUtils]: 26: Hoare triple {3390#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3386#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,570 INFO L273 TraceCheckUtils]: 25: Hoare triple {3394#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3390#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,575 INFO L273 TraceCheckUtils]: 24: Hoare triple {3398#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3394#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,581 INFO L273 TraceCheckUtils]: 23: Hoare triple {3402#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3398#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,586 INFO L273 TraceCheckUtils]: 22: Hoare triple {3406#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3402#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,593 INFO L273 TraceCheckUtils]: 21: Hoare triple {3410#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3406#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,598 INFO L273 TraceCheckUtils]: 20: Hoare triple {3414#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3410#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,602 INFO L273 TraceCheckUtils]: 19: Hoare triple {3418#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3414#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,608 INFO L273 TraceCheckUtils]: 18: Hoare triple {3422#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3418#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,614 INFO L273 TraceCheckUtils]: 17: Hoare triple {3426#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3422#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,618 INFO L273 TraceCheckUtils]: 16: Hoare triple {3430#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3426#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,625 INFO L273 TraceCheckUtils]: 15: Hoare triple {3434#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3430#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,631 INFO L273 TraceCheckUtils]: 14: Hoare triple {3438#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3434#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,636 INFO L273 TraceCheckUtils]: 13: Hoare triple {3442#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3438#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,641 INFO L273 TraceCheckUtils]: 12: Hoare triple {3446#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3442#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,647 INFO L273 TraceCheckUtils]: 11: Hoare triple {3450#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3446#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,651 INFO L273 TraceCheckUtils]: 10: Hoare triple {3454#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3450#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,658 INFO L273 TraceCheckUtils]: 9: Hoare triple {3458#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3454#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,663 INFO L273 TraceCheckUtils]: 8: Hoare triple {3462#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3458#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,668 INFO L273 TraceCheckUtils]: 7: Hoare triple {3466#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3462#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {3470#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(42bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3466#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,675 INFO L273 TraceCheckUtils]: 5: Hoare triple {2682#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);call ~#b~0.base, ~#b~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {3470#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:49,675 INFO L256 TraceCheckUtils]: 4: Hoare triple {2682#true} call #t~ret6 := main(); {2682#true} is VALID [2018-11-23 09:58:49,676 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {2682#true} {2682#true} #76#return; {2682#true} is VALID [2018-11-23 09:58:49,676 INFO L273 TraceCheckUtils]: 2: Hoare triple {2682#true} assume true; {2682#true} is VALID [2018-11-23 09:58:49,676 INFO L273 TraceCheckUtils]: 1: Hoare triple {2682#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {2682#true} is VALID [2018-11-23 09:58:49,676 INFO L256 TraceCheckUtils]: 0: Hoare triple {2682#true} call ULTIMATE.init(); {2682#true} is VALID [2018-11-23 09:58:49,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1221 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2018-11-23 09:58:49,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:49,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 09:58:49,709 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-11-23 09:58:49,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:49,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 09:58:49,843 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:49,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 09:58:49,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 09:58:49,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 09:58:49,845 INFO L87 Difference]: Start difference. First operand 132 states and 135 transitions. Second operand 48 states. [2018-11-23 09:58:53,483 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 09:58:53,975 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 09:58:54,500 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 09:58:55,046 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 09:58:55,595 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 09:58:56,140 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 09:59:23,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:23,684 INFO L93 Difference]: Finished difference Result 355 states and 432 transitions. [2018-11-23 09:59:23,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 09:59:23,685 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 127 [2018-11-23 09:59:23,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:23,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:59:23,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 346 transitions. [2018-11-23 09:59:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:59:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 346 transitions. [2018-11-23 09:59:23,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 346 transitions. [2018-11-23 09:59:24,671 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 346 edges. 346 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:59:24,677 INFO L225 Difference]: With dead ends: 355 [2018-11-23 09:59:24,677 INFO L226 Difference]: Without dead ends: 252 [2018-11-23 09:59:24,679 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 09:59:24,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-11-23 09:59:25,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2018-11-23 09:59:25,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:59:25,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand 252 states. [2018-11-23 09:59:25,102 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2018-11-23 09:59:25,102 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2018-11-23 09:59:25,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:25,111 INFO L93 Difference]: Finished difference Result 252 states and 255 transitions. [2018-11-23 09:59:25,111 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 255 transitions. [2018-11-23 09:59:25,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:25,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:25,112 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand 252 states. [2018-11-23 09:59:25,112 INFO L87 Difference]: Start difference. First operand 252 states. Second operand 252 states. [2018-11-23 09:59:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:25,121 INFO L93 Difference]: Finished difference Result 252 states and 255 transitions. [2018-11-23 09:59:25,121 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 255 transitions. [2018-11-23 09:59:25,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:25,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:25,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:59:25,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:59:25,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-11-23 09:59:25,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 255 transitions. [2018-11-23 09:59:25,132 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 255 transitions. Word has length 127 [2018-11-23 09:59:25,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:25,132 INFO L480 AbstractCegarLoop]: Abstraction has 252 states and 255 transitions. [2018-11-23 09:59:25,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 09:59:25,133 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 255 transitions. [2018-11-23 09:59:25,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-11-23 09:59:25,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:25,137 INFO L402 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:59:25,137 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:25,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:25,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1603456158, now seen corresponding path program 5 times [2018-11-23 09:59:25,139 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:59:25,139 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 09:59:25,166 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1