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_init5_false-unreach-call_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 09:58:38,661 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 09:58:38,663 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 09:58:38,675 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 09:58:38,675 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 09:58:38,676 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 09:58:38,677 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 09:58:38,679 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 09:58:38,681 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 09:58:38,682 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 09:58:38,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 09:58:38,683 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 09:58:38,684 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 09:58:38,685 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 09:58:38,686 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 09:58:38,686 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 09:58:38,687 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 09:58:38,689 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 09:58:38,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 09:58:38,693 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 09:58:38,694 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 09:58:38,696 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 09:58:38,698 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 09:58:38,698 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 09:58:38,698 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 09:58:38,699 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 09:58:38,700 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 09:58:38,701 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 09:58:38,702 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 09:58:38,703 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 09:58:38,703 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 09:58:38,704 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 09:58:38,704 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 09:58:38,704 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 09:58:38,705 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 09:58:38,706 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 09:58:38,706 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:38,722 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 09:58:38,722 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 09:58:38,723 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 09:58:38,723 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 09:58:38,724 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 09:58:38,724 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 09:58:38,724 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 09:58:38,724 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 09:58:38,724 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 09:58:38,725 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 09:58:38,725 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 09:58:38,725 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 09:58:38,725 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 09:58:38,725 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 09:58:38,726 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 09:58:38,726 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 09:58:38,726 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 09:58:38,726 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 09:58:38,726 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 09:58:38,726 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 09:58:38,727 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 09:58:38,727 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 09:58:38,727 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 09:58:38,727 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 09:58:38,727 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 09:58:38,728 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 09:58:38,728 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 09:58:38,728 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 09:58:38,728 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 09:58:38,728 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 09:58:38,728 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 09:58:38,729 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 09:58:38,729 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 09:58:38,771 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 09:58:38,784 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 09:58:38,788 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 09:58:38,790 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 09:58:38,790 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 09:58:38,791 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_init5_false-unreach-call_ground.i [2018-11-23 09:58:38,852 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e97ddc0/5b9ceef5110e4dc0b21ca590fad6a903/FLAG45213df82 [2018-11-23 09:58:39,327 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 09:58:39,328 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_init5_false-unreach-call_ground.i [2018-11-23 09:58:39,335 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e97ddc0/5b9ceef5110e4dc0b21ca590fad6a903/FLAG45213df82 [2018-11-23 09:58:39,675 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61e97ddc0/5b9ceef5110e4dc0b21ca590fad6a903 [2018-11-23 09:58:39,688 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 09:58:39,690 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 09:58:39,691 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:39,691 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 09:58:39,697 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 09:58:39,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:39" (1/1) ... [2018-11-23 09:58:39,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d13d574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:39, skipping insertion in model container [2018-11-23 09:58:39,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:58:39" (1/1) ... [2018-11-23 09:58:39,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 09:58:39,741 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 09:58:39,964 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:39,972 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 09:58:40,013 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 09:58:40,051 INFO L195 MainTranslator]: Completed translation [2018-11-23 09:58:40,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:40 WrapperNode [2018-11-23 09:58:40,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 09:58:40,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:40,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 09:58:40,053 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 09:58:40,063 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:40" (1/1) ... [2018-11-23 09:58:40,074 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:40" (1/1) ... [2018-11-23 09:58:40,084 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 09:58:40,085 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 09:58:40,085 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 09:58:40,085 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 09:58:40,096 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:40" (1/1) ... [2018-11-23 09:58:40,096 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:40" (1/1) ... [2018-11-23 09:58:40,100 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:40" (1/1) ... [2018-11-23 09:58:40,101 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:40" (1/1) ... [2018-11-23 09:58:40,135 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:40" (1/1) ... [2018-11-23 09:58:40,149 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:40" (1/1) ... [2018-11-23 09:58:40,151 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:40" (1/1) ... [2018-11-23 09:58:40,155 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 09:58:40,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 09:58:40,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 09:58:40,162 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 09:58:40,163 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:40" (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:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 09:58:40,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 09:58:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 09:58:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 09:58:40,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 09:58:40,324 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 09:58:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 09:58:40,324 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 09:58:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 09:58:40,324 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 09:58:40,324 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 09:58:40,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-23 09:58:40,951 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 09:58:40,952 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 09:58:40,952 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:40 BoogieIcfgContainer [2018-11-23 09:58:40,953 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 09:58:40,954 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 09:58:40,954 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 09:58:40,958 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 09:58:40,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:58:39" (1/3) ... [2018-11-23 09:58:40,959 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2673f9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:40, skipping insertion in model container [2018-11-23 09:58:40,959 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:58:40" (2/3) ... [2018-11-23 09:58:40,960 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2673f9bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:58:40, skipping insertion in model container [2018-11-23 09:58:40,960 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:58:40" (3/3) ... [2018-11-23 09:58:40,962 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_init5_false-unreach-call_ground.i [2018-11-23 09:58:40,973 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 09:58:40,982 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 09:58:41,001 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 09:58:41,035 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 09:58:41,036 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 09:58:41,036 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 09:58:41,036 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 09:58:41,037 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 09:58:41,037 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 09:58:41,037 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 09:58:41,037 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 09:58:41,038 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 09:58:41,056 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-11-23 09:58:41,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 09:58:41,063 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:41,065 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] [2018-11-23 09:58:41,067 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:41,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:41,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1721973062, now seen corresponding path program 1 times [2018-11-23 09:58:41,079 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:41,080 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:41,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:41,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:41,512 INFO L256 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {34#true} is VALID [2018-11-23 09:58:41,516 INFO L273 TraceCheckUtils]: 1: Hoare triple {34#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {34#true} is VALID [2018-11-23 09:58:41,517 INFO L273 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2018-11-23 09:58:41,517 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #100#return; {34#true} is VALID [2018-11-23 09:58:41,517 INFO L256 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret2 := main(); {34#true} is VALID [2018-11-23 09:58:41,517 INFO L273 TraceCheckUtils]: 5: Hoare triple {34#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {34#true} is VALID [2018-11-23 09:58:41,520 INFO L273 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2018-11-23 09:58:41,520 INFO L273 TraceCheckUtils]: 7: Hoare triple {35#false} ~i~0 := 0bv32; {35#false} is VALID [2018-11-23 09:58:41,520 INFO L273 TraceCheckUtils]: 8: Hoare triple {35#false} assume !~bvslt32(~i~0, 100000bv32); {35#false} is VALID [2018-11-23 09:58:41,521 INFO L273 TraceCheckUtils]: 9: Hoare triple {35#false} ~i~0 := 0bv32; {35#false} is VALID [2018-11-23 09:58:41,521 INFO L273 TraceCheckUtils]: 10: Hoare triple {35#false} assume !~bvslt32(~i~0, 100000bv32); {35#false} is VALID [2018-11-23 09:58:41,521 INFO L273 TraceCheckUtils]: 11: Hoare triple {35#false} ~i~0 := 0bv32; {35#false} is VALID [2018-11-23 09:58:41,522 INFO L273 TraceCheckUtils]: 12: Hoare triple {35#false} assume !~bvslt32(~i~0, 100000bv32); {35#false} is VALID [2018-11-23 09:58:41,522 INFO L273 TraceCheckUtils]: 13: Hoare triple {35#false} ~i~0 := 0bv32; {35#false} is VALID [2018-11-23 09:58:41,522 INFO L273 TraceCheckUtils]: 14: Hoare triple {35#false} assume !~bvslt32(~i~0, 100000bv32); {35#false} is VALID [2018-11-23 09:58:41,523 INFO L273 TraceCheckUtils]: 15: Hoare triple {35#false} havoc ~x~0;~x~0 := 0bv32; {35#false} is VALID [2018-11-23 09:58:41,523 INFO L273 TraceCheckUtils]: 16: Hoare triple {35#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {35#false} is VALID [2018-11-23 09:58:41,523 INFO L256 TraceCheckUtils]: 17: Hoare triple {35#false} call __VERIFIER_assert((if 45bv32 == #t~mem1 then 1bv32 else 0bv32)); {35#false} is VALID [2018-11-23 09:58:41,524 INFO L273 TraceCheckUtils]: 18: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2018-11-23 09:58:41,524 INFO L273 TraceCheckUtils]: 19: Hoare triple {35#false} assume 0bv32 == ~cond; {35#false} is VALID [2018-11-23 09:58:41,524 INFO L273 TraceCheckUtils]: 20: Hoare triple {35#false} assume !false; {35#false} is VALID [2018-11-23 09:58:41,529 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:41,529 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 09:58:41,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:41,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 09:58:41,544 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 09:58:41,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:41,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 09:58:41,681 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:41,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 09:58:41,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 09:58:41,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 09:58:41,692 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-11-23 09:58:41,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:41,822 INFO L93 Difference]: Finished difference Result 55 states and 78 transitions. [2018-11-23 09:58:41,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 09:58:41,823 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 09:58:41,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:41,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2018-11-23 09:58:41,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 09:58:41,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 78 transitions. [2018-11-23 09:58:41,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 78 transitions. [2018-11-23 09:58:42,143 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:42,156 INFO L225 Difference]: With dead ends: 55 [2018-11-23 09:58:42,156 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 09:58:42,160 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:42,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 09:58:42,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-11-23 09:58:42,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:42,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 26 states. [2018-11-23 09:58:42,228 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 09:58:42,228 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 09:58:42,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:42,232 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 09:58:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 09:58:42,233 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:42,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:42,234 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 26 states. [2018-11-23 09:58:42,234 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 26 states. [2018-11-23 09:58:42,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:42,238 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2018-11-23 09:58:42,239 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 09:58:42,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:42,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:42,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:42,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:42,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 09:58:42,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2018-11-23 09:58:42,245 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 21 [2018-11-23 09:58:42,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:42,246 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2018-11-23 09:58:42,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 09:58:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2018-11-23 09:58:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 09:58:42,247 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:42,247 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] [2018-11-23 09:58:42,248 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:42,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:42,248 INFO L82 PathProgramCache]: Analyzing trace with hash -13266878, now seen corresponding path program 1 times [2018-11-23 09:58:42,249 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:42,249 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:42,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:42,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:42,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:42,558 INFO L256 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {262#true} is VALID [2018-11-23 09:58:42,558 INFO L273 TraceCheckUtils]: 1: Hoare triple {262#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {262#true} is VALID [2018-11-23 09:58:42,559 INFO L273 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2018-11-23 09:58:42,559 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #100#return; {262#true} is VALID [2018-11-23 09:58:42,559 INFO L256 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret2 := main(); {262#true} is VALID [2018-11-23 09:58:42,574 INFO L273 TraceCheckUtils]: 5: Hoare triple {262#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {282#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:42,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {282#(= main_~i~0 (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {263#false} is VALID [2018-11-23 09:58:42,589 INFO L273 TraceCheckUtils]: 7: Hoare triple {263#false} ~i~0 := 0bv32; {263#false} is VALID [2018-11-23 09:58:42,590 INFO L273 TraceCheckUtils]: 8: Hoare triple {263#false} assume !~bvslt32(~i~0, 100000bv32); {263#false} is VALID [2018-11-23 09:58:42,590 INFO L273 TraceCheckUtils]: 9: Hoare triple {263#false} ~i~0 := 0bv32; {263#false} is VALID [2018-11-23 09:58:42,591 INFO L273 TraceCheckUtils]: 10: Hoare triple {263#false} assume !~bvslt32(~i~0, 100000bv32); {263#false} is VALID [2018-11-23 09:58:42,591 INFO L273 TraceCheckUtils]: 11: Hoare triple {263#false} ~i~0 := 0bv32; {263#false} is VALID [2018-11-23 09:58:42,591 INFO L273 TraceCheckUtils]: 12: Hoare triple {263#false} assume !~bvslt32(~i~0, 100000bv32); {263#false} is VALID [2018-11-23 09:58:42,592 INFO L273 TraceCheckUtils]: 13: Hoare triple {263#false} ~i~0 := 0bv32; {263#false} is VALID [2018-11-23 09:58:42,592 INFO L273 TraceCheckUtils]: 14: Hoare triple {263#false} assume !~bvslt32(~i~0, 100000bv32); {263#false} is VALID [2018-11-23 09:58:42,592 INFO L273 TraceCheckUtils]: 15: Hoare triple {263#false} havoc ~x~0;~x~0 := 0bv32; {263#false} is VALID [2018-11-23 09:58:42,593 INFO L273 TraceCheckUtils]: 16: Hoare triple {263#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {263#false} is VALID [2018-11-23 09:58:42,593 INFO L256 TraceCheckUtils]: 17: Hoare triple {263#false} call __VERIFIER_assert((if 45bv32 == #t~mem1 then 1bv32 else 0bv32)); {263#false} is VALID [2018-11-23 09:58:42,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {263#false} ~cond := #in~cond; {263#false} is VALID [2018-11-23 09:58:42,594 INFO L273 TraceCheckUtils]: 19: Hoare triple {263#false} assume 0bv32 == ~cond; {263#false} is VALID [2018-11-23 09:58:42,594 INFO L273 TraceCheckUtils]: 20: Hoare triple {263#false} assume !false; {263#false} is VALID [2018-11-23 09:58:42,596 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:42,596 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (3)] Exception during sending of exit command (exit): Stream closed [2018-11-23 09:58:42,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 09:58:42,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 09:58:42,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 09:58:42,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:42,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 09:58:42,740 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:42,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 09:58:42,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 09:58:42,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 09:58:42,742 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 3 states. [2018-11-23 09:58:43,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:43,050 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2018-11-23 09:58:43,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 09:58:43,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2018-11-23 09:58:43,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:43,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:43,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-23 09:58:43,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 09:58:43,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 64 transitions. [2018-11-23 09:58:43,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 64 transitions. [2018-11-23 09:58:43,209 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:43,211 INFO L225 Difference]: With dead ends: 50 [2018-11-23 09:58:43,211 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 09:58:43,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 19 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:43,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 09:58:43,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-11-23 09:58:43,237 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:43,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2018-11-23 09:58:43,238 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 09:58:43,239 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 09:58:43,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:43,242 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 09:58:43,242 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 09:58:43,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:43,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:43,243 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2018-11-23 09:58:43,243 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2018-11-23 09:58:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:43,248 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2018-11-23 09:58:43,248 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 09:58:43,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:43,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:43,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:43,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 09:58:43,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-23 09:58:43,252 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 21 [2018-11-23 09:58:43,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:43,252 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-23 09:58:43,253 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 09:58:43,253 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-23 09:58:43,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 09:58:43,254 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:43,254 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 09:58:43,254 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:43,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:43,255 INFO L82 PathProgramCache]: Analyzing trace with hash -927642988, now seen corresponding path program 1 times [2018-11-23 09:58:43,255 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:43,255 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:43,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 09:58:43,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:43,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:43,331 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:43,432 INFO L256 TraceCheckUtils]: 0: Hoare triple {511#true} call ULTIMATE.init(); {511#true} is VALID [2018-11-23 09:58:43,432 INFO L273 TraceCheckUtils]: 1: Hoare triple {511#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {511#true} is VALID [2018-11-23 09:58:43,433 INFO L273 TraceCheckUtils]: 2: Hoare triple {511#true} assume true; {511#true} is VALID [2018-11-23 09:58:43,433 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {511#true} {511#true} #100#return; {511#true} is VALID [2018-11-23 09:58:43,433 INFO L256 TraceCheckUtils]: 4: Hoare triple {511#true} call #t~ret2 := main(); {511#true} is VALID [2018-11-23 09:58:43,434 INFO L273 TraceCheckUtils]: 5: Hoare triple {511#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {531#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:43,435 INFO L273 TraceCheckUtils]: 6: Hoare triple {531#(= 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); {535#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:43,436 INFO L273 TraceCheckUtils]: 7: Hoare triple {535#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {512#false} is VALID [2018-11-23 09:58:43,436 INFO L273 TraceCheckUtils]: 8: Hoare triple {512#false} ~i~0 := 0bv32; {512#false} is VALID [2018-11-23 09:58:43,436 INFO L273 TraceCheckUtils]: 9: Hoare triple {512#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {512#false} is VALID [2018-11-23 09:58:43,436 INFO L273 TraceCheckUtils]: 10: Hoare triple {512#false} assume !~bvslt32(~i~0, 100000bv32); {512#false} is VALID [2018-11-23 09:58:43,437 INFO L273 TraceCheckUtils]: 11: Hoare triple {512#false} ~i~0 := 0bv32; {512#false} is VALID [2018-11-23 09:58:43,437 INFO L273 TraceCheckUtils]: 12: Hoare triple {512#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {512#false} is VALID [2018-11-23 09:58:43,437 INFO L273 TraceCheckUtils]: 13: Hoare triple {512#false} assume !~bvslt32(~i~0, 100000bv32); {512#false} is VALID [2018-11-23 09:58:43,438 INFO L273 TraceCheckUtils]: 14: Hoare triple {512#false} ~i~0 := 0bv32; {512#false} is VALID [2018-11-23 09:58:43,438 INFO L273 TraceCheckUtils]: 15: Hoare triple {512#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {512#false} is VALID [2018-11-23 09:58:43,439 INFO L273 TraceCheckUtils]: 16: Hoare triple {512#false} assume !~bvslt32(~i~0, 100000bv32); {512#false} is VALID [2018-11-23 09:58:43,439 INFO L273 TraceCheckUtils]: 17: Hoare triple {512#false} ~i~0 := 0bv32; {512#false} is VALID [2018-11-23 09:58:43,440 INFO L273 TraceCheckUtils]: 18: Hoare triple {512#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {512#false} is VALID [2018-11-23 09:58:43,440 INFO L273 TraceCheckUtils]: 19: Hoare triple {512#false} assume !~bvslt32(~i~0, 100000bv32); {512#false} is VALID [2018-11-23 09:58:43,441 INFO L273 TraceCheckUtils]: 20: Hoare triple {512#false} havoc ~x~0;~x~0 := 0bv32; {512#false} is VALID [2018-11-23 09:58:43,442 INFO L273 TraceCheckUtils]: 21: Hoare triple {512#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {512#false} is VALID [2018-11-23 09:58:43,442 INFO L256 TraceCheckUtils]: 22: Hoare triple {512#false} call __VERIFIER_assert((if 45bv32 == #t~mem1 then 1bv32 else 0bv32)); {512#false} is VALID [2018-11-23 09:58:43,443 INFO L273 TraceCheckUtils]: 23: Hoare triple {512#false} ~cond := #in~cond; {512#false} is VALID [2018-11-23 09:58:43,443 INFO L273 TraceCheckUtils]: 24: Hoare triple {512#false} assume 0bv32 == ~cond; {512#false} is VALID [2018-11-23 09:58:43,443 INFO L273 TraceCheckUtils]: 25: Hoare triple {512#false} assume !false; {512#false} is VALID [2018-11-23 09:58:43,445 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 09:58:43,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:43,571 INFO L273 TraceCheckUtils]: 25: Hoare triple {512#false} assume !false; {512#false} is VALID [2018-11-23 09:58:43,571 INFO L273 TraceCheckUtils]: 24: Hoare triple {512#false} assume 0bv32 == ~cond; {512#false} is VALID [2018-11-23 09:58:43,572 INFO L273 TraceCheckUtils]: 23: Hoare triple {512#false} ~cond := #in~cond; {512#false} is VALID [2018-11-23 09:58:43,572 INFO L256 TraceCheckUtils]: 22: Hoare triple {512#false} call __VERIFIER_assert((if 45bv32 == #t~mem1 then 1bv32 else 0bv32)); {512#false} is VALID [2018-11-23 09:58:43,572 INFO L273 TraceCheckUtils]: 21: Hoare triple {512#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {512#false} is VALID [2018-11-23 09:58:43,573 INFO L273 TraceCheckUtils]: 20: Hoare triple {512#false} havoc ~x~0;~x~0 := 0bv32; {512#false} is VALID [2018-11-23 09:58:43,573 INFO L273 TraceCheckUtils]: 19: Hoare triple {512#false} assume !~bvslt32(~i~0, 100000bv32); {512#false} is VALID [2018-11-23 09:58:43,573 INFO L273 TraceCheckUtils]: 18: Hoare triple {512#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {512#false} is VALID [2018-11-23 09:58:43,573 INFO L273 TraceCheckUtils]: 17: Hoare triple {512#false} ~i~0 := 0bv32; {512#false} is VALID [2018-11-23 09:58:43,574 INFO L273 TraceCheckUtils]: 16: Hoare triple {512#false} assume !~bvslt32(~i~0, 100000bv32); {512#false} is VALID [2018-11-23 09:58:43,574 INFO L273 TraceCheckUtils]: 15: Hoare triple {512#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {512#false} is VALID [2018-11-23 09:58:43,575 INFO L273 TraceCheckUtils]: 14: Hoare triple {512#false} ~i~0 := 0bv32; {512#false} is VALID [2018-11-23 09:58:43,575 INFO L273 TraceCheckUtils]: 13: Hoare triple {512#false} assume !~bvslt32(~i~0, 100000bv32); {512#false} is VALID [2018-11-23 09:58:43,575 INFO L273 TraceCheckUtils]: 12: Hoare triple {512#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {512#false} is VALID [2018-11-23 09:58:43,575 INFO L273 TraceCheckUtils]: 11: Hoare triple {512#false} ~i~0 := 0bv32; {512#false} is VALID [2018-11-23 09:58:43,576 INFO L273 TraceCheckUtils]: 10: Hoare triple {512#false} assume !~bvslt32(~i~0, 100000bv32); {512#false} is VALID [2018-11-23 09:58:43,576 INFO L273 TraceCheckUtils]: 9: Hoare triple {512#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {512#false} is VALID [2018-11-23 09:58:43,576 INFO L273 TraceCheckUtils]: 8: Hoare triple {512#false} ~i~0 := 0bv32; {512#false} is VALID [2018-11-23 09:58:43,584 INFO L273 TraceCheckUtils]: 7: Hoare triple {647#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {512#false} is VALID [2018-11-23 09:58:43,586 INFO L273 TraceCheckUtils]: 6: Hoare triple {651#(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); {647#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:43,589 INFO L273 TraceCheckUtils]: 5: Hoare triple {511#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {651#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:43,589 INFO L256 TraceCheckUtils]: 4: Hoare triple {511#true} call #t~ret2 := main(); {511#true} is VALID [2018-11-23 09:58:43,589 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {511#true} {511#true} #100#return; {511#true} is VALID [2018-11-23 09:58:43,590 INFO L273 TraceCheckUtils]: 2: Hoare triple {511#true} assume true; {511#true} is VALID [2018-11-23 09:58:43,590 INFO L273 TraceCheckUtils]: 1: Hoare triple {511#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {511#true} is VALID [2018-11-23 09:58:43,590 INFO L256 TraceCheckUtils]: 0: Hoare triple {511#true} call ULTIMATE.init(); {511#true} is VALID [2018-11-23 09:58:43,591 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [MP cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (4)] Exception during sending of exit command (exit): Broken pipe [2018-11-23 09:58:43,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:43,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-23 09:58:43,594 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-23 09:58:43,595 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:43,595 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 09:58:43,705 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:43,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 09:58:43,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 09:58:43,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-23 09:58:43,706 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 6 states. [2018-11-23 09:58:44,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:44,450 INFO L93 Difference]: Finished difference Result 69 states and 93 transitions. [2018-11-23 09:58:44,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 09:58:44,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2018-11-23 09:58:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:44,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:44,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-23 09:58:44,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 09:58:44,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2018-11-23 09:58:44,459 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2018-11-23 09:58:44,630 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:44,634 INFO L225 Difference]: With dead ends: 69 [2018-11-23 09:58:44,634 INFO L226 Difference]: Without dead ends: 46 [2018-11-23 09:58:44,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-23 09:58:44,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-11-23 09:58:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-11-23 09:58:44,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:44,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand 46 states. [2018-11-23 09:58:44,680 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 09:58:44,680 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 09:58:44,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:44,683 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 09:58:44,684 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 09:58:44,684 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:44,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:44,685 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand 46 states. [2018-11-23 09:58:44,685 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 46 states. [2018-11-23 09:58:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:44,688 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2018-11-23 09:58:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 09:58:44,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:44,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:44,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:44,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:44,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 09:58:44,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2018-11-23 09:58:44,693 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 26 [2018-11-23 09:58:44,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:44,693 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2018-11-23 09:58:44,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 09:58:44,693 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2018-11-23 09:58:44,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 09:58:44,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:44,695 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, 1, 1, 1, 1] [2018-11-23 09:58:44,695 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:44,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:44,696 INFO L82 PathProgramCache]: Analyzing trace with hash 631314114, now seen corresponding path program 2 times [2018-11-23 09:58:44,697 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:44,697 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:44,717 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 09:58:44,817 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 09:58:44,818 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:44,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:45,015 INFO L256 TraceCheckUtils]: 0: Hoare triple {956#true} call ULTIMATE.init(); {956#true} is VALID [2018-11-23 09:58:45,015 INFO L273 TraceCheckUtils]: 1: Hoare triple {956#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {956#true} is VALID [2018-11-23 09:58:45,015 INFO L273 TraceCheckUtils]: 2: Hoare triple {956#true} assume true; {956#true} is VALID [2018-11-23 09:58:45,016 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {956#true} {956#true} #100#return; {956#true} is VALID [2018-11-23 09:58:45,016 INFO L256 TraceCheckUtils]: 4: Hoare triple {956#true} call #t~ret2 := main(); {956#true} is VALID [2018-11-23 09:58:45,016 INFO L273 TraceCheckUtils]: 5: Hoare triple {956#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {976#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:45,018 INFO L273 TraceCheckUtils]: 6: Hoare triple {976#(= 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); {980#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:45,019 INFO L273 TraceCheckUtils]: 7: Hoare triple {980#(= (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); {984#(= (bvadd main_~i~0 (_ bv4294967294 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:45,020 INFO L273 TraceCheckUtils]: 8: Hoare triple {984#(= (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); {988#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:45,021 INFO L273 TraceCheckUtils]: 9: Hoare triple {988#(= (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); {992#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:45,022 INFO L273 TraceCheckUtils]: 10: Hoare triple {992#(= (_ bv4 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {957#false} is VALID [2018-11-23 09:58:45,023 INFO L273 TraceCheckUtils]: 11: Hoare triple {957#false} ~i~0 := 0bv32; {957#false} is VALID [2018-11-23 09:58:45,023 INFO L273 TraceCheckUtils]: 12: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,024 INFO L273 TraceCheckUtils]: 13: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,024 INFO L273 TraceCheckUtils]: 14: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,025 INFO L273 TraceCheckUtils]: 15: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,025 INFO L273 TraceCheckUtils]: 16: Hoare triple {957#false} assume !~bvslt32(~i~0, 100000bv32); {957#false} is VALID [2018-11-23 09:58:45,026 INFO L273 TraceCheckUtils]: 17: Hoare triple {957#false} ~i~0 := 0bv32; {957#false} is VALID [2018-11-23 09:58:45,026 INFO L273 TraceCheckUtils]: 18: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,027 INFO L273 TraceCheckUtils]: 19: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,027 INFO L273 TraceCheckUtils]: 20: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,027 INFO L273 TraceCheckUtils]: 21: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,028 INFO L273 TraceCheckUtils]: 22: Hoare triple {957#false} assume !~bvslt32(~i~0, 100000bv32); {957#false} is VALID [2018-11-23 09:58:45,028 INFO L273 TraceCheckUtils]: 23: Hoare triple {957#false} ~i~0 := 0bv32; {957#false} is VALID [2018-11-23 09:58:45,028 INFO L273 TraceCheckUtils]: 24: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,029 INFO L273 TraceCheckUtils]: 25: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,029 INFO L273 TraceCheckUtils]: 26: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,029 INFO L273 TraceCheckUtils]: 27: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,029 INFO L273 TraceCheckUtils]: 28: Hoare triple {957#false} assume !~bvslt32(~i~0, 100000bv32); {957#false} is VALID [2018-11-23 09:58:45,030 INFO L273 TraceCheckUtils]: 29: Hoare triple {957#false} ~i~0 := 0bv32; {957#false} is VALID [2018-11-23 09:58:45,030 INFO L273 TraceCheckUtils]: 30: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,031 INFO L273 TraceCheckUtils]: 31: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,031 INFO L273 TraceCheckUtils]: 32: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,031 INFO L273 TraceCheckUtils]: 33: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,032 INFO L273 TraceCheckUtils]: 34: Hoare triple {957#false} assume !~bvslt32(~i~0, 100000bv32); {957#false} is VALID [2018-11-23 09:58:45,032 INFO L273 TraceCheckUtils]: 35: Hoare triple {957#false} havoc ~x~0;~x~0 := 0bv32; {957#false} is VALID [2018-11-23 09:58:45,032 INFO L273 TraceCheckUtils]: 36: Hoare triple {957#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {957#false} is VALID [2018-11-23 09:58:45,033 INFO L256 TraceCheckUtils]: 37: Hoare triple {957#false} call __VERIFIER_assert((if 45bv32 == #t~mem1 then 1bv32 else 0bv32)); {957#false} is VALID [2018-11-23 09:58:45,033 INFO L273 TraceCheckUtils]: 38: Hoare triple {957#false} ~cond := #in~cond; {957#false} is VALID [2018-11-23 09:58:45,033 INFO L273 TraceCheckUtils]: 39: Hoare triple {957#false} assume 0bv32 == ~cond; {957#false} is VALID [2018-11-23 09:58:45,034 INFO L273 TraceCheckUtils]: 40: Hoare triple {957#false} assume !false; {957#false} is VALID [2018-11-23 09:58:45,037 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 09:58:45,037 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:45,298 INFO L273 TraceCheckUtils]: 40: Hoare triple {957#false} assume !false; {957#false} is VALID [2018-11-23 09:58:45,299 INFO L273 TraceCheckUtils]: 39: Hoare triple {957#false} assume 0bv32 == ~cond; {957#false} is VALID [2018-11-23 09:58:45,299 INFO L273 TraceCheckUtils]: 38: Hoare triple {957#false} ~cond := #in~cond; {957#false} is VALID [2018-11-23 09:58:45,300 INFO L256 TraceCheckUtils]: 37: Hoare triple {957#false} call __VERIFIER_assert((if 45bv32 == #t~mem1 then 1bv32 else 0bv32)); {957#false} is VALID [2018-11-23 09:58:45,300 INFO L273 TraceCheckUtils]: 36: Hoare triple {957#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {957#false} is VALID [2018-11-23 09:58:45,301 INFO L273 TraceCheckUtils]: 35: Hoare triple {957#false} havoc ~x~0;~x~0 := 0bv32; {957#false} is VALID [2018-11-23 09:58:45,301 INFO L273 TraceCheckUtils]: 34: Hoare triple {957#false} assume !~bvslt32(~i~0, 100000bv32); {957#false} is VALID [2018-11-23 09:58:45,301 INFO L273 TraceCheckUtils]: 33: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,301 INFO L273 TraceCheckUtils]: 32: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,302 INFO L273 TraceCheckUtils]: 31: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,302 INFO L273 TraceCheckUtils]: 30: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,302 INFO L273 TraceCheckUtils]: 29: Hoare triple {957#false} ~i~0 := 0bv32; {957#false} is VALID [2018-11-23 09:58:45,302 INFO L273 TraceCheckUtils]: 28: Hoare triple {957#false} assume !~bvslt32(~i~0, 100000bv32); {957#false} is VALID [2018-11-23 09:58:45,303 INFO L273 TraceCheckUtils]: 27: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,303 INFO L273 TraceCheckUtils]: 26: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,303 INFO L273 TraceCheckUtils]: 25: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,304 INFO L273 TraceCheckUtils]: 24: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,304 INFO L273 TraceCheckUtils]: 23: Hoare triple {957#false} ~i~0 := 0bv32; {957#false} is VALID [2018-11-23 09:58:45,304 INFO L273 TraceCheckUtils]: 22: Hoare triple {957#false} assume !~bvslt32(~i~0, 100000bv32); {957#false} is VALID [2018-11-23 09:58:45,304 INFO L273 TraceCheckUtils]: 21: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,305 INFO L273 TraceCheckUtils]: 20: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,305 INFO L273 TraceCheckUtils]: 19: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,305 INFO L273 TraceCheckUtils]: 18: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,305 INFO L273 TraceCheckUtils]: 17: Hoare triple {957#false} ~i~0 := 0bv32; {957#false} is VALID [2018-11-23 09:58:45,306 INFO L273 TraceCheckUtils]: 16: Hoare triple {957#false} assume !~bvslt32(~i~0, 100000bv32); {957#false} is VALID [2018-11-23 09:58:45,306 INFO L273 TraceCheckUtils]: 15: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,306 INFO L273 TraceCheckUtils]: 14: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,306 INFO L273 TraceCheckUtils]: 13: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,306 INFO L273 TraceCheckUtils]: 12: Hoare triple {957#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {957#false} is VALID [2018-11-23 09:58:45,307 INFO L273 TraceCheckUtils]: 11: Hoare triple {957#false} ~i~0 := 0bv32; {957#false} is VALID [2018-11-23 09:58:45,307 INFO L273 TraceCheckUtils]: 10: Hoare triple {1176#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {957#false} is VALID [2018-11-23 09:58:45,309 INFO L273 TraceCheckUtils]: 9: Hoare triple {1180#(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); {1176#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:45,314 INFO L273 TraceCheckUtils]: 8: Hoare triple {1184#(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); {1180#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,319 INFO L273 TraceCheckUtils]: 7: Hoare triple {1188#(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); {1184#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,325 INFO L273 TraceCheckUtils]: 6: Hoare triple {1192#(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); {1188#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,326 INFO L273 TraceCheckUtils]: 5: Hoare triple {956#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1192#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:45,326 INFO L256 TraceCheckUtils]: 4: Hoare triple {956#true} call #t~ret2 := main(); {956#true} is VALID [2018-11-23 09:58:45,327 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {956#true} {956#true} #100#return; {956#true} is VALID [2018-11-23 09:58:45,327 INFO L273 TraceCheckUtils]: 2: Hoare triple {956#true} assume true; {956#true} is VALID [2018-11-23 09:58:45,327 INFO L273 TraceCheckUtils]: 1: Hoare triple {956#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {956#true} is VALID [2018-11-23 09:58:45,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {956#true} call ULTIMATE.init(); {956#true} is VALID [2018-11-23 09:58:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2018-11-23 09:58:45,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:45,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-23 09:58:45,333 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-23 09:58:45,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:45,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 09:58:45,401 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:45,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 09:58:45,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 09:58:45,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-11-23 09:58:45,402 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand 12 states. [2018-11-23 09:58:47,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:47,702 INFO L93 Difference]: Finished difference Result 111 states and 150 transitions. [2018-11-23 09:58:47,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 09:58:47,702 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-11-23 09:58:47,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:58:47,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:47,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2018-11-23 09:58:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 09:58:47,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 134 transitions. [2018-11-23 09:58:47,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 134 transitions. [2018-11-23 09:58:48,054 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:48,056 INFO L225 Difference]: With dead ends: 111 [2018-11-23 09:58:48,057 INFO L226 Difference]: Without dead ends: 76 [2018-11-23 09:58:48,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 71 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:48,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-11-23 09:58:48,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-11-23 09:58:48,139 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:58:48,139 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand 76 states. [2018-11-23 09:58:48,139 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 09:58:48,139 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 09:58:48,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:48,143 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-11-23 09:58:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-11-23 09:58:48,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:48,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:48,145 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand 76 states. [2018-11-23 09:58:48,145 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 76 states. [2018-11-23 09:58:48,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:58:48,149 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2018-11-23 09:58:48,149 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-11-23 09:58:48,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:58:48,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:58:48,151 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:58:48,151 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:58:48,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 09:58:48,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2018-11-23 09:58:48,155 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 41 [2018-11-23 09:58:48,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:58:48,155 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2018-11-23 09:58:48,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 09:58:48,155 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2018-11-23 09:58:48,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-11-23 09:58:48,158 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:58:48,158 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, 1, 1, 1, 1] [2018-11-23 09:58:48,158 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:58:48,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:58:48,159 INFO L82 PathProgramCache]: Analyzing trace with hash 591181954, now seen corresponding path program 3 times [2018-11-23 09:58:48,159 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:58:48,160 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:48,191 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 09:58:49,750 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 09:58:49,750 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:58:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:58:49,820 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:58:50,191 INFO L256 TraceCheckUtils]: 0: Hoare triple {1707#true} call ULTIMATE.init(); {1707#true} is VALID [2018-11-23 09:58:50,192 INFO L273 TraceCheckUtils]: 1: Hoare triple {1707#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1707#true} is VALID [2018-11-23 09:58:50,192 INFO L273 TraceCheckUtils]: 2: Hoare triple {1707#true} assume true; {1707#true} is VALID [2018-11-23 09:58:50,192 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1707#true} {1707#true} #100#return; {1707#true} is VALID [2018-11-23 09:58:50,193 INFO L256 TraceCheckUtils]: 4: Hoare triple {1707#true} call #t~ret2 := main(); {1707#true} is VALID [2018-11-23 09:58:50,193 INFO L273 TraceCheckUtils]: 5: Hoare triple {1707#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1707#true} is VALID [2018-11-23 09:58:50,194 INFO L273 TraceCheckUtils]: 6: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,194 INFO L273 TraceCheckUtils]: 7: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,194 INFO L273 TraceCheckUtils]: 8: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,194 INFO L273 TraceCheckUtils]: 9: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,195 INFO L273 TraceCheckUtils]: 10: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,195 INFO L273 TraceCheckUtils]: 11: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,195 INFO L273 TraceCheckUtils]: 12: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,196 INFO L273 TraceCheckUtils]: 13: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,196 INFO L273 TraceCheckUtils]: 14: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,196 INFO L273 TraceCheckUtils]: 15: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,196 INFO L273 TraceCheckUtils]: 16: Hoare triple {1707#true} assume !~bvslt32(~i~0, 100000bv32); {1707#true} is VALID [2018-11-23 09:58:50,197 INFO L273 TraceCheckUtils]: 17: Hoare triple {1707#true} ~i~0 := 0bv32; {1707#true} is VALID [2018-11-23 09:58:50,197 INFO L273 TraceCheckUtils]: 18: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,197 INFO L273 TraceCheckUtils]: 19: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,197 INFO L273 TraceCheckUtils]: 20: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,198 INFO L273 TraceCheckUtils]: 21: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,198 INFO L273 TraceCheckUtils]: 22: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,198 INFO L273 TraceCheckUtils]: 23: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,199 INFO L273 TraceCheckUtils]: 24: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,199 INFO L273 TraceCheckUtils]: 25: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,199 INFO L273 TraceCheckUtils]: 26: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,199 INFO L273 TraceCheckUtils]: 27: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,200 INFO L273 TraceCheckUtils]: 28: Hoare triple {1707#true} assume !~bvslt32(~i~0, 100000bv32); {1707#true} is VALID [2018-11-23 09:58:50,203 INFO L273 TraceCheckUtils]: 29: Hoare triple {1707#true} ~i~0 := 0bv32; {1799#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:58:50,203 INFO L273 TraceCheckUtils]: 30: Hoare triple {1799#(= main_~i~0 (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1803#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,204 INFO L273 TraceCheckUtils]: 31: Hoare triple {1803#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1807#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:58:50,205 INFO L273 TraceCheckUtils]: 32: Hoare triple {1807#(= (_ bv2 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1811#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,207 INFO L273 TraceCheckUtils]: 33: Hoare triple {1811#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1815#(= (_ bv4 32) main_~i~0)} is VALID [2018-11-23 09:58:50,215 INFO L273 TraceCheckUtils]: 34: Hoare triple {1815#(= (_ bv4 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1819#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,216 INFO L273 TraceCheckUtils]: 35: Hoare triple {1819#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1823#(= (_ bv6 32) main_~i~0)} is VALID [2018-11-23 09:58:50,216 INFO L273 TraceCheckUtils]: 36: Hoare triple {1823#(= (_ bv6 32) main_~i~0)} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1827#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,217 INFO L273 TraceCheckUtils]: 37: Hoare triple {1827#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1831#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,218 INFO L273 TraceCheckUtils]: 38: Hoare triple {1831#(= (bvadd main_~i~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1835#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:58:50,219 INFO L273 TraceCheckUtils]: 39: Hoare triple {1835#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1839#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 09:58:50,220 INFO L273 TraceCheckUtils]: 40: Hoare triple {1839#(= (_ bv10 32) main_~i~0)} assume !~bvslt32(~i~0, 100000bv32); {1708#false} is VALID [2018-11-23 09:58:50,221 INFO L273 TraceCheckUtils]: 41: Hoare triple {1708#false} ~i~0 := 0bv32; {1708#false} is VALID [2018-11-23 09:58:50,221 INFO L273 TraceCheckUtils]: 42: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,221 INFO L273 TraceCheckUtils]: 43: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,222 INFO L273 TraceCheckUtils]: 44: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,222 INFO L273 TraceCheckUtils]: 45: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,222 INFO L273 TraceCheckUtils]: 46: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,223 INFO L273 TraceCheckUtils]: 47: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,223 INFO L273 TraceCheckUtils]: 48: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,224 INFO L273 TraceCheckUtils]: 49: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,224 INFO L273 TraceCheckUtils]: 50: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,224 INFO L273 TraceCheckUtils]: 51: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,225 INFO L273 TraceCheckUtils]: 52: Hoare triple {1708#false} assume !~bvslt32(~i~0, 100000bv32); {1708#false} is VALID [2018-11-23 09:58:50,225 INFO L273 TraceCheckUtils]: 53: Hoare triple {1708#false} ~i~0 := 0bv32; {1708#false} is VALID [2018-11-23 09:58:50,225 INFO L273 TraceCheckUtils]: 54: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,226 INFO L273 TraceCheckUtils]: 55: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,226 INFO L273 TraceCheckUtils]: 56: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,226 INFO L273 TraceCheckUtils]: 57: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,226 INFO L273 TraceCheckUtils]: 58: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,227 INFO L273 TraceCheckUtils]: 59: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,227 INFO L273 TraceCheckUtils]: 60: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,227 INFO L273 TraceCheckUtils]: 61: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,227 INFO L273 TraceCheckUtils]: 62: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,227 INFO L273 TraceCheckUtils]: 63: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,228 INFO L273 TraceCheckUtils]: 64: Hoare triple {1708#false} assume !~bvslt32(~i~0, 100000bv32); {1708#false} is VALID [2018-11-23 09:58:50,228 INFO L273 TraceCheckUtils]: 65: Hoare triple {1708#false} havoc ~x~0;~x~0 := 0bv32; {1708#false} is VALID [2018-11-23 09:58:50,228 INFO L273 TraceCheckUtils]: 66: Hoare triple {1708#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1708#false} is VALID [2018-11-23 09:58:50,228 INFO L256 TraceCheckUtils]: 67: Hoare triple {1708#false} call __VERIFIER_assert((if 45bv32 == #t~mem1 then 1bv32 else 0bv32)); {1708#false} is VALID [2018-11-23 09:58:50,228 INFO L273 TraceCheckUtils]: 68: Hoare triple {1708#false} ~cond := #in~cond; {1708#false} is VALID [2018-11-23 09:58:50,229 INFO L273 TraceCheckUtils]: 69: Hoare triple {1708#false} assume 0bv32 == ~cond; {1708#false} is VALID [2018-11-23 09:58:50,229 INFO L273 TraceCheckUtils]: 70: Hoare triple {1708#false} assume !false; {1708#false} is VALID [2018-11-23 09:58:50,236 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 09:58:50,236 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:58:50,845 INFO L273 TraceCheckUtils]: 70: Hoare triple {1708#false} assume !false; {1708#false} is VALID [2018-11-23 09:58:50,846 INFO L273 TraceCheckUtils]: 69: Hoare triple {1708#false} assume 0bv32 == ~cond; {1708#false} is VALID [2018-11-23 09:58:50,846 INFO L273 TraceCheckUtils]: 68: Hoare triple {1708#false} ~cond := #in~cond; {1708#false} is VALID [2018-11-23 09:58:50,846 INFO L256 TraceCheckUtils]: 67: Hoare triple {1708#false} call __VERIFIER_assert((if 45bv32 == #t~mem1 then 1bv32 else 0bv32)); {1708#false} is VALID [2018-11-23 09:58:50,846 INFO L273 TraceCheckUtils]: 66: Hoare triple {1708#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {1708#false} is VALID [2018-11-23 09:58:50,847 INFO L273 TraceCheckUtils]: 65: Hoare triple {1708#false} havoc ~x~0;~x~0 := 0bv32; {1708#false} is VALID [2018-11-23 09:58:50,847 INFO L273 TraceCheckUtils]: 64: Hoare triple {1708#false} assume !~bvslt32(~i~0, 100000bv32); {1708#false} is VALID [2018-11-23 09:58:50,847 INFO L273 TraceCheckUtils]: 63: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,847 INFO L273 TraceCheckUtils]: 62: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,848 INFO L273 TraceCheckUtils]: 61: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,848 INFO L273 TraceCheckUtils]: 60: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,848 INFO L273 TraceCheckUtils]: 59: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,848 INFO L273 TraceCheckUtils]: 58: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,849 INFO L273 TraceCheckUtils]: 57: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,849 INFO L273 TraceCheckUtils]: 56: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,849 INFO L273 TraceCheckUtils]: 55: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,849 INFO L273 TraceCheckUtils]: 54: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,850 INFO L273 TraceCheckUtils]: 53: Hoare triple {1708#false} ~i~0 := 0bv32; {1708#false} is VALID [2018-11-23 09:58:50,850 INFO L273 TraceCheckUtils]: 52: Hoare triple {1708#false} assume !~bvslt32(~i~0, 100000bv32); {1708#false} is VALID [2018-11-23 09:58:50,850 INFO L273 TraceCheckUtils]: 51: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,850 INFO L273 TraceCheckUtils]: 50: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,851 INFO L273 TraceCheckUtils]: 49: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,851 INFO L273 TraceCheckUtils]: 48: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,851 INFO L273 TraceCheckUtils]: 47: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,851 INFO L273 TraceCheckUtils]: 46: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,851 INFO L273 TraceCheckUtils]: 45: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,852 INFO L273 TraceCheckUtils]: 44: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,852 INFO L273 TraceCheckUtils]: 43: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,852 INFO L273 TraceCheckUtils]: 42: Hoare triple {1708#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1708#false} is VALID [2018-11-23 09:58:50,852 INFO L273 TraceCheckUtils]: 41: Hoare triple {1708#false} ~i~0 := 0bv32; {1708#false} is VALID [2018-11-23 09:58:50,867 INFO L273 TraceCheckUtils]: 40: Hoare triple {2023#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {1708#false} is VALID [2018-11-23 09:58:50,884 INFO L273 TraceCheckUtils]: 39: Hoare triple {2027#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2023#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:58:50,892 INFO L273 TraceCheckUtils]: 38: Hoare triple {2031#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2027#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,896 INFO L273 TraceCheckUtils]: 37: Hoare triple {2035#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2031#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,900 INFO L273 TraceCheckUtils]: 36: Hoare triple {2039#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2035#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,904 INFO L273 TraceCheckUtils]: 35: Hoare triple {2043#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2039#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,910 INFO L273 TraceCheckUtils]: 34: Hoare triple {2047#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2043#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,915 INFO L273 TraceCheckUtils]: 33: Hoare triple {2051#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2047#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,921 INFO L273 TraceCheckUtils]: 32: Hoare triple {2055#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2051#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,925 INFO L273 TraceCheckUtils]: 31: Hoare triple {2059#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2055#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,931 INFO L273 TraceCheckUtils]: 30: Hoare triple {2063#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {2059#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,931 INFO L273 TraceCheckUtils]: 29: Hoare triple {1707#true} ~i~0 := 0bv32; {2063#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:58:50,931 INFO L273 TraceCheckUtils]: 28: Hoare triple {1707#true} assume !~bvslt32(~i~0, 100000bv32); {1707#true} is VALID [2018-11-23 09:58:50,932 INFO L273 TraceCheckUtils]: 27: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,932 INFO L273 TraceCheckUtils]: 26: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,932 INFO L273 TraceCheckUtils]: 25: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,932 INFO L273 TraceCheckUtils]: 24: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,932 INFO L273 TraceCheckUtils]: 23: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,932 INFO L273 TraceCheckUtils]: 22: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,933 INFO L273 TraceCheckUtils]: 21: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,933 INFO L273 TraceCheckUtils]: 20: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,933 INFO L273 TraceCheckUtils]: 19: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,933 INFO L273 TraceCheckUtils]: 18: Hoare triple {1707#true} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {1707#true} is VALID [2018-11-23 09:58:50,933 INFO L273 TraceCheckUtils]: 17: Hoare triple {1707#true} ~i~0 := 0bv32; {1707#true} is VALID [2018-11-23 09:58:50,933 INFO L273 TraceCheckUtils]: 16: Hoare triple {1707#true} assume !~bvslt32(~i~0, 100000bv32); {1707#true} is VALID [2018-11-23 09:58:50,934 INFO L273 TraceCheckUtils]: 15: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,934 INFO L273 TraceCheckUtils]: 14: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,934 INFO L273 TraceCheckUtils]: 13: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,934 INFO L273 TraceCheckUtils]: 12: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,934 INFO L273 TraceCheckUtils]: 11: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,935 INFO L273 TraceCheckUtils]: 9: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,935 INFO L273 TraceCheckUtils]: 8: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,936 INFO L273 TraceCheckUtils]: 7: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,936 INFO L273 TraceCheckUtils]: 6: Hoare triple {1707#true} 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); {1707#true} is VALID [2018-11-23 09:58:50,936 INFO L273 TraceCheckUtils]: 5: Hoare triple {1707#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {1707#true} is VALID [2018-11-23 09:58:50,936 INFO L256 TraceCheckUtils]: 4: Hoare triple {1707#true} call #t~ret2 := main(); {1707#true} is VALID [2018-11-23 09:58:50,937 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1707#true} {1707#true} #100#return; {1707#true} is VALID [2018-11-23 09:58:50,937 INFO L273 TraceCheckUtils]: 2: Hoare triple {1707#true} assume true; {1707#true} is VALID [2018-11-23 09:58:50,937 INFO L273 TraceCheckUtils]: 1: Hoare triple {1707#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {1707#true} is VALID [2018-11-23 09:58:50,937 INFO L256 TraceCheckUtils]: 0: Hoare triple {1707#true} call ULTIMATE.init(); {1707#true} is VALID [2018-11-23 09:58:50,941 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2018-11-23 09:58:50,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:58:50,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2018-11-23 09:58:50,945 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 71 [2018-11-23 09:58:50,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:58:50,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2018-11-23 09:58:51,050 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:58:51,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-11-23 09:58:51,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-11-23 09:58:51,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2018-11-23 09:58:51,051 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand 24 states. [2018-11-23 09:59:00,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:00,206 INFO L93 Difference]: Finished difference Result 195 states and 264 transitions. [2018-11-23 09:59:00,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-11-23 09:59:00,206 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 71 [2018-11-23 09:59:00,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:00,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:59:00,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 224 transitions. [2018-11-23 09:59:00,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 09:59:00,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 224 transitions. [2018-11-23 09:59:00,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 224 transitions. [2018-11-23 09:59:00,778 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:59:00,782 INFO L225 Difference]: With dead ends: 195 [2018-11-23 09:59:00,782 INFO L226 Difference]: Without dead ends: 136 [2018-11-23 09:59:00,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 09:59:00,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-11-23 09:59:00,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2018-11-23 09:59:00,913 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:59:00,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand 136 states. [2018-11-23 09:59:00,914 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 136 states. [2018-11-23 09:59:00,914 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 136 states. [2018-11-23 09:59:00,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:00,919 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2018-11-23 09:59:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-11-23 09:59:00,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:00,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:00,921 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand 136 states. [2018-11-23 09:59:00,921 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 136 states. [2018-11-23 09:59:00,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:00,926 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2018-11-23 09:59:00,926 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-11-23 09:59:00,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:00,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:00,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:59:00,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:59:00,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-11-23 09:59:00,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2018-11-23 09:59:00,932 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 71 [2018-11-23 09:59:00,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:00,932 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2018-11-23 09:59:00,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-11-23 09:59:00,933 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2018-11-23 09:59:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-23 09:59:00,936 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:00,937 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, 1, 1, 1, 1] [2018-11-23 09:59:00,937 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:00,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:00,937 INFO L82 PathProgramCache]: Analyzing trace with hash 577530882, now seen corresponding path program 4 times [2018-11-23 09:59:00,938 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:59:00,938 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:59:00,963 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 09:59:01,332 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 09:59:01,332 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 09:59:01,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 09:59:01,445 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 09:59:02,322 INFO L256 TraceCheckUtils]: 0: Hoare triple {3080#true} call ULTIMATE.init(); {3080#true} is VALID [2018-11-23 09:59:02,323 INFO L273 TraceCheckUtils]: 1: Hoare triple {3080#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3080#true} is VALID [2018-11-23 09:59:02,323 INFO L273 TraceCheckUtils]: 2: Hoare triple {3080#true} assume true; {3080#true} is VALID [2018-11-23 09:59:02,323 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3080#true} {3080#true} #100#return; {3080#true} is VALID [2018-11-23 09:59:02,324 INFO L256 TraceCheckUtils]: 4: Hoare triple {3080#true} call #t~ret2 := main(); {3080#true} is VALID [2018-11-23 09:59:02,325 INFO L273 TraceCheckUtils]: 5: Hoare triple {3080#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {3100#(= main_~i~0 (_ bv0 32))} is VALID [2018-11-23 09:59:02,326 INFO L273 TraceCheckUtils]: 6: Hoare triple {3100#(= 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); {3104#(= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,327 INFO L273 TraceCheckUtils]: 7: Hoare triple {3104#(= (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); {3108#(= (_ bv2 32) main_~i~0)} is VALID [2018-11-23 09:59:02,328 INFO L273 TraceCheckUtils]: 8: Hoare triple {3108#(= (_ 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); {3112#(= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,328 INFO L273 TraceCheckUtils]: 9: Hoare triple {3112#(= (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); {3116#(= (bvadd main_~i~0 (_ bv4294967292 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,329 INFO L273 TraceCheckUtils]: 10: Hoare triple {3116#(= (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); {3120#(= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,329 INFO L273 TraceCheckUtils]: 11: Hoare triple {3120#(= (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); {3124#(= (bvadd main_~i~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,331 INFO L273 TraceCheckUtils]: 12: Hoare triple {3124#(= (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); {3128#(= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,333 INFO L273 TraceCheckUtils]: 13: Hoare triple {3128#(= (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); {3132#(= (_ bv8 32) main_~i~0)} is VALID [2018-11-23 09:59:02,334 INFO L273 TraceCheckUtils]: 14: Hoare triple {3132#(= (_ 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); {3136#(= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,335 INFO L273 TraceCheckUtils]: 15: Hoare triple {3136#(= (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); {3140#(= (_ bv10 32) main_~i~0)} is VALID [2018-11-23 09:59:02,336 INFO L273 TraceCheckUtils]: 16: Hoare triple {3140#(= (_ bv10 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); {3144#(= (bvadd main_~i~0 (_ bv4294967285 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,336 INFO L273 TraceCheckUtils]: 17: Hoare triple {3144#(= (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); {3148#(= (_ bv12 32) main_~i~0)} is VALID [2018-11-23 09:59:02,337 INFO L273 TraceCheckUtils]: 18: Hoare triple {3148#(= (_ 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); {3152#(= (bvadd main_~i~0 (_ bv4294967283 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,338 INFO L273 TraceCheckUtils]: 19: Hoare triple {3152#(= (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); {3156#(= (bvadd main_~i~0 (_ bv4294967282 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,340 INFO L273 TraceCheckUtils]: 20: Hoare triple {3156#(= (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); {3160#(= (_ bv15 32) main_~i~0)} is VALID [2018-11-23 09:59:02,341 INFO L273 TraceCheckUtils]: 21: Hoare triple {3160#(= (_ bv15 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); {3164#(= (bvadd main_~i~0 (_ bv4294967280 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,342 INFO L273 TraceCheckUtils]: 22: Hoare triple {3164#(= (bvadd main_~i~0 (_ bv4294967280 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); {3168#(= (_ bv17 32) main_~i~0)} is VALID [2018-11-23 09:59:02,343 INFO L273 TraceCheckUtils]: 23: Hoare triple {3168#(= (_ bv17 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); {3172#(= (bvadd main_~i~0 (_ bv4294967278 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,344 INFO L273 TraceCheckUtils]: 24: Hoare triple {3172#(= (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); {3176#(= (_ bv19 32) main_~i~0)} is VALID [2018-11-23 09:59:02,345 INFO L273 TraceCheckUtils]: 25: Hoare triple {3176#(= (_ bv19 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); {3180#(= (bvadd main_~i~0 (_ bv4294967276 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,346 INFO L273 TraceCheckUtils]: 26: Hoare triple {3180#(= (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); {3184#(= (bvadd main_~i~0 (_ bv4294967275 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,347 INFO L273 TraceCheckUtils]: 27: Hoare triple {3184#(= (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); {3188#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} is VALID [2018-11-23 09:59:02,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {3188#(= (bvadd main_~i~0 (_ bv4294967274 32)) (_ bv0 32))} assume !~bvslt32(~i~0, 100000bv32); {3081#false} is VALID [2018-11-23 09:59:02,348 INFO L273 TraceCheckUtils]: 29: Hoare triple {3081#false} ~i~0 := 0bv32; {3081#false} is VALID [2018-11-23 09:59:02,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,349 INFO L273 TraceCheckUtils]: 32: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,349 INFO L273 TraceCheckUtils]: 33: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,350 INFO L273 TraceCheckUtils]: 34: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,350 INFO L273 TraceCheckUtils]: 35: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,351 INFO L273 TraceCheckUtils]: 36: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,351 INFO L273 TraceCheckUtils]: 37: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,351 INFO L273 TraceCheckUtils]: 38: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,351 INFO L273 TraceCheckUtils]: 39: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,352 INFO L273 TraceCheckUtils]: 40: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,352 INFO L273 TraceCheckUtils]: 41: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,352 INFO L273 TraceCheckUtils]: 42: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,352 INFO L273 TraceCheckUtils]: 43: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,353 INFO L273 TraceCheckUtils]: 44: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,353 INFO L273 TraceCheckUtils]: 45: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,353 INFO L273 TraceCheckUtils]: 46: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,353 INFO L273 TraceCheckUtils]: 47: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,354 INFO L273 TraceCheckUtils]: 48: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,354 INFO L273 TraceCheckUtils]: 49: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,354 INFO L273 TraceCheckUtils]: 50: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,354 INFO L273 TraceCheckUtils]: 51: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,355 INFO L273 TraceCheckUtils]: 52: Hoare triple {3081#false} assume !~bvslt32(~i~0, 100000bv32); {3081#false} is VALID [2018-11-23 09:59:02,355 INFO L273 TraceCheckUtils]: 53: Hoare triple {3081#false} ~i~0 := 0bv32; {3081#false} is VALID [2018-11-23 09:59:02,355 INFO L273 TraceCheckUtils]: 54: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,355 INFO L273 TraceCheckUtils]: 55: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,356 INFO L273 TraceCheckUtils]: 56: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,356 INFO L273 TraceCheckUtils]: 57: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,356 INFO L273 TraceCheckUtils]: 58: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,356 INFO L273 TraceCheckUtils]: 59: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,357 INFO L273 TraceCheckUtils]: 60: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,357 INFO L273 TraceCheckUtils]: 61: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,357 INFO L273 TraceCheckUtils]: 62: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,357 INFO L273 TraceCheckUtils]: 63: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,358 INFO L273 TraceCheckUtils]: 64: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,358 INFO L273 TraceCheckUtils]: 65: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,358 INFO L273 TraceCheckUtils]: 66: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,358 INFO L273 TraceCheckUtils]: 67: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,359 INFO L273 TraceCheckUtils]: 68: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,359 INFO L273 TraceCheckUtils]: 69: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,359 INFO L273 TraceCheckUtils]: 70: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,359 INFO L273 TraceCheckUtils]: 71: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,360 INFO L273 TraceCheckUtils]: 72: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,360 INFO L273 TraceCheckUtils]: 73: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,360 INFO L273 TraceCheckUtils]: 74: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,360 INFO L273 TraceCheckUtils]: 75: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,361 INFO L273 TraceCheckUtils]: 76: Hoare triple {3081#false} assume !~bvslt32(~i~0, 100000bv32); {3081#false} is VALID [2018-11-23 09:59:02,361 INFO L273 TraceCheckUtils]: 77: Hoare triple {3081#false} ~i~0 := 0bv32; {3081#false} is VALID [2018-11-23 09:59:02,361 INFO L273 TraceCheckUtils]: 78: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,361 INFO L273 TraceCheckUtils]: 79: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,361 INFO L273 TraceCheckUtils]: 80: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,362 INFO L273 TraceCheckUtils]: 81: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,362 INFO L273 TraceCheckUtils]: 82: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,362 INFO L273 TraceCheckUtils]: 83: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,362 INFO L273 TraceCheckUtils]: 84: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,363 INFO L273 TraceCheckUtils]: 85: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,363 INFO L273 TraceCheckUtils]: 86: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,363 INFO L273 TraceCheckUtils]: 87: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,363 INFO L273 TraceCheckUtils]: 88: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,364 INFO L273 TraceCheckUtils]: 89: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,364 INFO L273 TraceCheckUtils]: 90: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,376 INFO L273 TraceCheckUtils]: 91: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,377 INFO L273 TraceCheckUtils]: 92: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,377 INFO L273 TraceCheckUtils]: 93: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,377 INFO L273 TraceCheckUtils]: 94: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,377 INFO L273 TraceCheckUtils]: 95: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,377 INFO L273 TraceCheckUtils]: 96: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,378 INFO L273 TraceCheckUtils]: 97: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,378 INFO L273 TraceCheckUtils]: 98: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,378 INFO L273 TraceCheckUtils]: 99: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,378 INFO L273 TraceCheckUtils]: 100: Hoare triple {3081#false} assume !~bvslt32(~i~0, 100000bv32); {3081#false} is VALID [2018-11-23 09:59:02,378 INFO L273 TraceCheckUtils]: 101: Hoare triple {3081#false} ~i~0 := 0bv32; {3081#false} is VALID [2018-11-23 09:59:02,378 INFO L273 TraceCheckUtils]: 102: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,379 INFO L273 TraceCheckUtils]: 103: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,379 INFO L273 TraceCheckUtils]: 104: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,379 INFO L273 TraceCheckUtils]: 105: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,380 INFO L273 TraceCheckUtils]: 106: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,380 INFO L273 TraceCheckUtils]: 107: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,380 INFO L273 TraceCheckUtils]: 108: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,380 INFO L273 TraceCheckUtils]: 109: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,381 INFO L273 TraceCheckUtils]: 110: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,381 INFO L273 TraceCheckUtils]: 111: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,381 INFO L273 TraceCheckUtils]: 112: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,381 INFO L273 TraceCheckUtils]: 113: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,381 INFO L273 TraceCheckUtils]: 114: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,381 INFO L273 TraceCheckUtils]: 115: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,382 INFO L273 TraceCheckUtils]: 116: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,382 INFO L273 TraceCheckUtils]: 117: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,382 INFO L273 TraceCheckUtils]: 118: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,382 INFO L273 TraceCheckUtils]: 119: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,382 INFO L273 TraceCheckUtils]: 120: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,384 INFO L273 TraceCheckUtils]: 121: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,384 INFO L273 TraceCheckUtils]: 122: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,384 INFO L273 TraceCheckUtils]: 123: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:02,384 INFO L273 TraceCheckUtils]: 124: Hoare triple {3081#false} assume !~bvslt32(~i~0, 100000bv32); {3081#false} is VALID [2018-11-23 09:59:02,384 INFO L273 TraceCheckUtils]: 125: Hoare triple {3081#false} havoc ~x~0;~x~0 := 0bv32; {3081#false} is VALID [2018-11-23 09:59:02,385 INFO L273 TraceCheckUtils]: 126: Hoare triple {3081#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3081#false} is VALID [2018-11-23 09:59:02,385 INFO L256 TraceCheckUtils]: 127: Hoare triple {3081#false} call __VERIFIER_assert((if 45bv32 == #t~mem1 then 1bv32 else 0bv32)); {3081#false} is VALID [2018-11-23 09:59:02,385 INFO L273 TraceCheckUtils]: 128: Hoare triple {3081#false} ~cond := #in~cond; {3081#false} is VALID [2018-11-23 09:59:02,386 INFO L273 TraceCheckUtils]: 129: Hoare triple {3081#false} assume 0bv32 == ~cond; {3081#false} is VALID [2018-11-23 09:59:02,386 INFO L273 TraceCheckUtils]: 130: Hoare triple {3081#false} assume !false; {3081#false} is VALID [2018-11-23 09:59:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-23 09:59:02,398 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 09:59:04,310 INFO L273 TraceCheckUtils]: 130: Hoare triple {3081#false} assume !false; {3081#false} is VALID [2018-11-23 09:59:04,310 INFO L273 TraceCheckUtils]: 129: Hoare triple {3081#false} assume 0bv32 == ~cond; {3081#false} is VALID [2018-11-23 09:59:04,311 INFO L273 TraceCheckUtils]: 128: Hoare triple {3081#false} ~cond := #in~cond; {3081#false} is VALID [2018-11-23 09:59:04,311 INFO L256 TraceCheckUtils]: 127: Hoare triple {3081#false} call __VERIFIER_assert((if 45bv32 == #t~mem1 then 1bv32 else 0bv32)); {3081#false} is VALID [2018-11-23 09:59:04,311 INFO L273 TraceCheckUtils]: 126: Hoare triple {3081#false} assume !!~bvslt32(~x~0, 100000bv32);call #t~mem1 := read~intINTTYPE4(~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~x~0)), 4bv32); {3081#false} is VALID [2018-11-23 09:59:04,311 INFO L273 TraceCheckUtils]: 125: Hoare triple {3081#false} havoc ~x~0;~x~0 := 0bv32; {3081#false} is VALID [2018-11-23 09:59:04,311 INFO L273 TraceCheckUtils]: 124: Hoare triple {3081#false} assume !~bvslt32(~i~0, 100000bv32); {3081#false} is VALID [2018-11-23 09:59:04,312 INFO L273 TraceCheckUtils]: 123: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,312 INFO L273 TraceCheckUtils]: 122: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,312 INFO L273 TraceCheckUtils]: 121: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,312 INFO L273 TraceCheckUtils]: 120: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,312 INFO L273 TraceCheckUtils]: 119: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,312 INFO L273 TraceCheckUtils]: 118: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,313 INFO L273 TraceCheckUtils]: 117: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,313 INFO L273 TraceCheckUtils]: 116: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,313 INFO L273 TraceCheckUtils]: 115: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,313 INFO L273 TraceCheckUtils]: 114: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,313 INFO L273 TraceCheckUtils]: 113: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,313 INFO L273 TraceCheckUtils]: 112: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,313 INFO L273 TraceCheckUtils]: 111: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,314 INFO L273 TraceCheckUtils]: 110: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,314 INFO L273 TraceCheckUtils]: 109: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,314 INFO L273 TraceCheckUtils]: 108: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,314 INFO L273 TraceCheckUtils]: 107: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,314 INFO L273 TraceCheckUtils]: 106: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,314 INFO L273 TraceCheckUtils]: 105: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,314 INFO L273 TraceCheckUtils]: 104: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,315 INFO L273 TraceCheckUtils]: 103: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,315 INFO L273 TraceCheckUtils]: 102: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(46bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,315 INFO L273 TraceCheckUtils]: 101: Hoare triple {3081#false} ~i~0 := 0bv32; {3081#false} is VALID [2018-11-23 09:59:04,315 INFO L273 TraceCheckUtils]: 100: Hoare triple {3081#false} assume !~bvslt32(~i~0, 100000bv32); {3081#false} is VALID [2018-11-23 09:59:04,315 INFO L273 TraceCheckUtils]: 99: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,315 INFO L273 TraceCheckUtils]: 98: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,315 INFO L273 TraceCheckUtils]: 97: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,316 INFO L273 TraceCheckUtils]: 96: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,316 INFO L273 TraceCheckUtils]: 95: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,316 INFO L273 TraceCheckUtils]: 94: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,316 INFO L273 TraceCheckUtils]: 93: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,316 INFO L273 TraceCheckUtils]: 92: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,316 INFO L273 TraceCheckUtils]: 91: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,317 INFO L273 TraceCheckUtils]: 90: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,317 INFO L273 TraceCheckUtils]: 89: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,317 INFO L273 TraceCheckUtils]: 88: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,317 INFO L273 TraceCheckUtils]: 87: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,317 INFO L273 TraceCheckUtils]: 86: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,318 INFO L273 TraceCheckUtils]: 85: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,318 INFO L273 TraceCheckUtils]: 84: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,318 INFO L273 TraceCheckUtils]: 83: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,318 INFO L273 TraceCheckUtils]: 82: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,318 INFO L273 TraceCheckUtils]: 81: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,318 INFO L273 TraceCheckUtils]: 80: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,318 INFO L273 TraceCheckUtils]: 79: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,318 INFO L273 TraceCheckUtils]: 78: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(45bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,319 INFO L273 TraceCheckUtils]: 77: Hoare triple {3081#false} ~i~0 := 0bv32; {3081#false} is VALID [2018-11-23 09:59:04,319 INFO L273 TraceCheckUtils]: 76: Hoare triple {3081#false} assume !~bvslt32(~i~0, 100000bv32); {3081#false} is VALID [2018-11-23 09:59:04,319 INFO L273 TraceCheckUtils]: 75: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,319 INFO L273 TraceCheckUtils]: 74: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,319 INFO L273 TraceCheckUtils]: 73: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,320 INFO L273 TraceCheckUtils]: 72: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,320 INFO L273 TraceCheckUtils]: 71: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,320 INFO L273 TraceCheckUtils]: 70: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,320 INFO L273 TraceCheckUtils]: 69: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,320 INFO L273 TraceCheckUtils]: 68: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,321 INFO L273 TraceCheckUtils]: 67: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,321 INFO L273 TraceCheckUtils]: 66: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,321 INFO L273 TraceCheckUtils]: 65: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,321 INFO L273 TraceCheckUtils]: 64: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,321 INFO L273 TraceCheckUtils]: 63: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,322 INFO L273 TraceCheckUtils]: 62: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,322 INFO L273 TraceCheckUtils]: 61: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,322 INFO L273 TraceCheckUtils]: 60: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,322 INFO L273 TraceCheckUtils]: 59: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,322 INFO L273 TraceCheckUtils]: 58: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,323 INFO L273 TraceCheckUtils]: 57: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,323 INFO L273 TraceCheckUtils]: 56: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,323 INFO L273 TraceCheckUtils]: 55: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,323 INFO L273 TraceCheckUtils]: 54: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(44bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,323 INFO L273 TraceCheckUtils]: 53: Hoare triple {3081#false} ~i~0 := 0bv32; {3081#false} is VALID [2018-11-23 09:59:04,324 INFO L273 TraceCheckUtils]: 52: Hoare triple {3081#false} assume !~bvslt32(~i~0, 100000bv32); {3081#false} is VALID [2018-11-23 09:59:04,324 INFO L273 TraceCheckUtils]: 51: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,324 INFO L273 TraceCheckUtils]: 50: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,324 INFO L273 TraceCheckUtils]: 49: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,324 INFO L273 TraceCheckUtils]: 48: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,325 INFO L273 TraceCheckUtils]: 47: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,325 INFO L273 TraceCheckUtils]: 46: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,325 INFO L273 TraceCheckUtils]: 45: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,325 INFO L273 TraceCheckUtils]: 44: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,325 INFO L273 TraceCheckUtils]: 43: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,325 INFO L273 TraceCheckUtils]: 42: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,326 INFO L273 TraceCheckUtils]: 41: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,326 INFO L273 TraceCheckUtils]: 40: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,326 INFO L273 TraceCheckUtils]: 39: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,326 INFO L273 TraceCheckUtils]: 38: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,326 INFO L273 TraceCheckUtils]: 37: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,327 INFO L273 TraceCheckUtils]: 36: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,327 INFO L273 TraceCheckUtils]: 35: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,327 INFO L273 TraceCheckUtils]: 34: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,327 INFO L273 TraceCheckUtils]: 33: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,327 INFO L273 TraceCheckUtils]: 32: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,327 INFO L273 TraceCheckUtils]: 31: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,328 INFO L273 TraceCheckUtils]: 30: Hoare triple {3081#false} assume !!~bvslt32(~i~0, 100000bv32);call write~intINTTYPE4(43bv32, ~#a~0.base, ~bvadd32(~#a~0.offset, ~bvmul32(4bv32, ~i~0)), 4bv32);~i~0 := ~bvadd32(1bv32, ~i~0); {3081#false} is VALID [2018-11-23 09:59:04,328 INFO L273 TraceCheckUtils]: 29: Hoare triple {3081#false} ~i~0 := 0bv32; {3081#false} is VALID [2018-11-23 09:59:04,336 INFO L273 TraceCheckUtils]: 28: Hoare triple {3804#(bvslt main_~i~0 (_ bv100000 32))} assume !~bvslt32(~i~0, 100000bv32); {3081#false} is VALID [2018-11-23 09:59:04,339 INFO L273 TraceCheckUtils]: 27: Hoare triple {3808#(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); {3804#(bvslt main_~i~0 (_ bv100000 32))} is VALID [2018-11-23 09:59:04,346 INFO L273 TraceCheckUtils]: 26: Hoare triple {3812#(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); {3808#(bvslt (bvadd main_~i~0 (_ bv1 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,350 INFO L273 TraceCheckUtils]: 25: Hoare triple {3816#(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); {3812#(bvslt (bvadd main_~i~0 (_ bv2 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,356 INFO L273 TraceCheckUtils]: 24: Hoare triple {3820#(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); {3816#(bvslt (bvadd main_~i~0 (_ bv3 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,360 INFO L273 TraceCheckUtils]: 23: Hoare triple {3824#(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); {3820#(bvslt (bvadd main_~i~0 (_ bv4 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,366 INFO L273 TraceCheckUtils]: 22: Hoare triple {3828#(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); {3824#(bvslt (bvadd main_~i~0 (_ bv5 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,371 INFO L273 TraceCheckUtils]: 21: Hoare triple {3832#(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); {3828#(bvslt (bvadd main_~i~0 (_ bv6 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,378 INFO L273 TraceCheckUtils]: 20: Hoare triple {3836#(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); {3832#(bvslt (bvadd main_~i~0 (_ bv7 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,381 INFO L273 TraceCheckUtils]: 19: Hoare triple {3840#(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); {3836#(bvslt (bvadd main_~i~0 (_ bv8 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,387 INFO L273 TraceCheckUtils]: 18: Hoare triple {3844#(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); {3840#(bvslt (bvadd main_~i~0 (_ bv9 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,392 INFO L273 TraceCheckUtils]: 17: Hoare triple {3848#(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); {3844#(bvslt (bvadd main_~i~0 (_ bv10 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,396 INFO L273 TraceCheckUtils]: 16: Hoare triple {3852#(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); {3848#(bvslt (bvadd main_~i~0 (_ bv11 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,401 INFO L273 TraceCheckUtils]: 15: Hoare triple {3856#(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); {3852#(bvslt (bvadd main_~i~0 (_ bv12 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {3860#(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); {3856#(bvslt (bvadd main_~i~0 (_ bv13 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,412 INFO L273 TraceCheckUtils]: 13: Hoare triple {3864#(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); {3860#(bvslt (bvadd main_~i~0 (_ bv14 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,416 INFO L273 TraceCheckUtils]: 12: Hoare triple {3868#(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); {3864#(bvslt (bvadd main_~i~0 (_ bv15 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,421 INFO L273 TraceCheckUtils]: 11: Hoare triple {3872#(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); {3868#(bvslt (bvadd main_~i~0 (_ bv16 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,427 INFO L273 TraceCheckUtils]: 10: Hoare triple {3876#(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); {3872#(bvslt (bvadd main_~i~0 (_ bv17 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,432 INFO L273 TraceCheckUtils]: 9: Hoare triple {3880#(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); {3876#(bvslt (bvadd main_~i~0 (_ bv18 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,437 INFO L273 TraceCheckUtils]: 8: Hoare triple {3884#(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); {3880#(bvslt (bvadd main_~i~0 (_ bv19 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,442 INFO L273 TraceCheckUtils]: 7: Hoare triple {3888#(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); {3884#(bvslt (bvadd main_~i~0 (_ bv20 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,446 INFO L273 TraceCheckUtils]: 6: Hoare triple {3892#(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); {3888#(bvslt (bvadd main_~i~0 (_ bv21 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,447 INFO L273 TraceCheckUtils]: 5: Hoare triple {3080#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.alloc(400000bv32);~i~0 := 0bv32; {3892#(bvslt (bvadd main_~i~0 (_ bv22 32)) (_ bv100000 32))} is VALID [2018-11-23 09:59:04,447 INFO L256 TraceCheckUtils]: 4: Hoare triple {3080#true} call #t~ret2 := main(); {3080#true} is VALID [2018-11-23 09:59:04,447 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {3080#true} {3080#true} #100#return; {3080#true} is VALID [2018-11-23 09:59:04,447 INFO L273 TraceCheckUtils]: 2: Hoare triple {3080#true} assume true; {3080#true} is VALID [2018-11-23 09:59:04,448 INFO L273 TraceCheckUtils]: 1: Hoare triple {3080#true} #NULL.base, #NULL.offset := 0bv32, 0bv32;#valid := #valid[0bv32 := 0bv1]; {3080#true} is VALID [2018-11-23 09:59:04,448 INFO L256 TraceCheckUtils]: 0: Hoare triple {3080#true} call ULTIMATE.init(); {3080#true} is VALID [2018-11-23 09:59:04,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2018-11-23 09:59:04,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 09:59:04,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 48 [2018-11-23 09:59:04,463 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 131 [2018-11-23 09:59:04,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 09:59:04,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states. [2018-11-23 09:59:04,596 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:59:04,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-11-23 09:59:04,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-11-23 09:59:04,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2018-11-23 09:59:04,598 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand 48 states. [2018-11-23 09:59:08,109 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 7 [2018-11-23 09:59:08,599 WARN L180 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 7 [2018-11-23 09:59:09,105 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 7 [2018-11-23 09:59:09,688 WARN L180 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 7 [2018-11-23 09:59:10,245 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 7 [2018-11-23 09:59:10,866 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 7 [2018-11-23 09:59:11,440 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 7 [2018-11-23 09:59:46,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:46,603 INFO L93 Difference]: Finished difference Result 363 states and 492 transitions. [2018-11-23 09:59:46,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-11-23 09:59:46,603 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 131 [2018-11-23 09:59:46,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 09:59:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:59:46,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 404 transitions. [2018-11-23 09:59:46,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 09:59:46,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 404 transitions. [2018-11-23 09:59:46,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 404 transitions. [2018-11-23 09:59:47,803 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 404 edges. 404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 09:59:47,809 INFO L225 Difference]: With dead ends: 363 [2018-11-23 09:59:47,809 INFO L226 Difference]: Without dead ends: 256 [2018-11-23 09:59:47,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 215 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2018-11-23 09:59:47,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-11-23 09:59:48,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2018-11-23 09:59:48,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 09:59:48,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand 256 states. [2018-11-23 09:59:48,096 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 256 states. [2018-11-23 09:59:48,096 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 256 states. [2018-11-23 09:59:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:48,106 INFO L93 Difference]: Finished difference Result 256 states and 261 transitions. [2018-11-23 09:59:48,106 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 261 transitions. [2018-11-23 09:59:48,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:48,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:48,107 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand 256 states. [2018-11-23 09:59:48,107 INFO L87 Difference]: Start difference. First operand 256 states. Second operand 256 states. [2018-11-23 09:59:48,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 09:59:48,117 INFO L93 Difference]: Finished difference Result 256 states and 261 transitions. [2018-11-23 09:59:48,117 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 261 transitions. [2018-11-23 09:59:48,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 09:59:48,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 09:59:48,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 09:59:48,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 09:59:48,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-11-23 09:59:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 261 transitions. [2018-11-23 09:59:48,127 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 261 transitions. Word has length 131 [2018-11-23 09:59:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 09:59:48,127 INFO L480 AbstractCegarLoop]: Abstraction has 256 states and 261 transitions. [2018-11-23 09:59:48,127 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-11-23 09:59:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 261 transitions. [2018-11-23 09:59:48,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-23 09:59:48,132 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 09:59:48,132 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, 1, 1, 1, 1] [2018-11-23 09:59:48,132 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 09:59:48,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 09:59:48,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1085117186, now seen corresponding path program 5 times [2018-11-23 09:59:48,134 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 09:59:48,135 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:48,156 INFO L101 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1