java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/mcmillan2006.c.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1377b90 [2019-01-07 14:30:47,009 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 14:30:47,011 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 14:30:47,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 14:30:47,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 14:30:47,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 14:30:47,030 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 14:30:47,033 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 14:30:47,037 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 14:30:47,038 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 14:30:47,039 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 14:30:47,040 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 14:30:47,046 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 14:30:47,047 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 14:30:47,048 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 14:30:47,053 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 14:30:47,053 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 14:30:47,055 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 14:30:47,057 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 14:30:47,059 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 14:30:47,060 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 14:30:47,064 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 14:30:47,066 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 14:30:47,066 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 14:30:47,067 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 14:30:47,071 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 14:30:47,071 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 14:30:47,072 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 14:30:47,073 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 14:30:47,074 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 14:30:47,074 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 14:30:47,080 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 14:30:47,080 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 14:30:47,081 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 14:30:47,082 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 14:30:47,082 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 14:30:47,083 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_oct.epf [2019-01-07 14:30:47,106 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 14:30:47,106 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 14:30:47,108 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 14:30:47,108 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 14:30:47,109 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 14:30:47,109 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 14:30:47,109 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 14:30:47,109 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 14:30:47,109 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 14:30:47,110 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-07 14:30:47,110 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 14:30:47,110 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 14:30:47,110 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 14:30:47,111 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 14:30:47,111 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 14:30:47,112 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 14:30:47,112 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 14:30:47,112 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 14:30:47,112 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 14:30:47,112 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 14:30:47,114 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 14:30:47,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 14:30:47,115 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 14:30:47,115 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 14:30:47,115 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 14:30:47,115 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 14:30:47,115 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 14:30:47,117 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 14:30:47,117 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 14:30:47,117 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 14:30:47,117 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 14:30:47,118 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 14:30:47,118 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 14:30:47,118 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 14:30:47,118 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 14:30:47,118 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 14:30:47,118 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 14:30:47,119 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 14:30:47,119 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 14:30:47,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 14:30:47,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 14:30:47,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 14:30:47,195 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 14:30:47,196 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 14:30:47,196 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/mcmillan2006.c.i_3.bpl [2019-01-07 14:30:47,198 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/mcmillan2006.c.i_3.bpl' [2019-01-07 14:30:47,261 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 14:30:47,263 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 14:30:47,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 14:30:47,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 14:30:47,264 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 14:30:47,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:47" (1/1) ... [2019-01-07 14:30:47,293 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:47" (1/1) ... [2019-01-07 14:30:47,302 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 14:30:47,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 14:30:47,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 14:30:47,303 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 14:30:47,314 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:47" (1/1) ... [2019-01-07 14:30:47,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:47" (1/1) ... [2019-01-07 14:30:47,316 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:47" (1/1) ... [2019-01-07 14:30:47,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:47" (1/1) ... [2019-01-07 14:30:47,325 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:47" (1/1) ... [2019-01-07 14:30:47,327 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:47" (1/1) ... [2019-01-07 14:30:47,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:47" (1/1) ... [2019-01-07 14:30:47,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 14:30:47,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 14:30:47,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 14:30:47,333 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 14:30:47,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:47" (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 [2019-01-07 14:30:47,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 14:30:47,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 14:30:47,927 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 14:30:47,927 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-01-07 14:30:47,928 INFO L202 PluginConnector]: Adding new model mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:30:47 BoogieIcfgContainer [2019-01-07 14:30:47,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 14:30:47,930 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-07 14:30:47,930 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-07 14:30:47,933 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-07 14:30:47,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 02:30:47" (1/2) ... [2019-01-07 14:30:47,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3cfee4ed and model type mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.01 02:30:47, skipping insertion in model container [2019-01-07 14:30:47,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 02:30:47" (2/2) ... [2019-01-07 14:30:47,937 INFO L112 eAbstractionObserver]: Analyzing ICFG mcmillan2006.c.i_3.bpl [2019-01-07 14:30:47,947 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-07 14:30:47,958 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-07 14:30:47,976 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-07 14:30:48,010 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-07 14:30:48,011 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-07 14:30:48,011 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-07 14:30:48,011 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-07 14:30:48,011 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-07 14:30:48,011 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-07 14:30:48,012 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-07 14:30:48,012 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-07 14:30:48,027 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-01-07 14:30:48,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-01-07 14:30:48,033 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:30:48,034 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-01-07 14:30:48,037 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:30:48,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:30:48,043 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2019-01-07 14:30:48,046 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:30:48,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:30:48,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:30:48,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:30:48,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:30:48,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:30:48,271 INFO L273 TraceCheckUtils]: 0: Hoare triple {9#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~8, main_#t~mem5, main_#t~post4, main_~i~9, main_~n~7, main_~x~7.base, main_~x~7.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~n~7 := main_#t~nondet0;havoc main_#t~nondet0;assume !!(0 <= main_~n~7 && main_~n~7 <= 1000);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := main_~n~7 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~x~7.base, main_~x~7.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~8 := 0; {11#(= ULTIMATE.start_main_~i~8 0)} is VALID [2019-01-07 14:30:48,278 INFO L273 TraceCheckUtils]: 1: Hoare triple {11#(= ULTIMATE.start_main_~i~8 0)} assume !(main_~i~8 < main_~n~7);main_~i~9 := 0;assume !!(main_~i~9 < main_~n~7);read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := main_~x~7.base, main_~x~7.offset + main_~i~9 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];main_#t~mem5 := read~int_#value;__VERIFIER_assert_#in~cond := (if main_#t~mem5 == 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {10#false} is VALID [2019-01-07 14:30:48,279 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !false; {10#false} is VALID [2019-01-07 14:30:48,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:30:48,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-07 14:30:48,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-07 14:30:48,284 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-01-07 14:30:48,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 14:30:48,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-01-07 14:30:48,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-01-07 14:30:48,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:30:48,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-07 14:30:48,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-07 14:30:48,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:30:48,344 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-01-07 14:30:48,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:30:48,441 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-01-07 14:30:48,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-07 14:30:48,444 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-01-07 14:30:48,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-07 14:30:48,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:30:48,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-07 14:30:48,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-01-07 14:30:48,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-01-07 14:30:48,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2019-01-07 14:30:48,573 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-01-07 14:30:48,584 INFO L225 Difference]: With dead ends: 9 [2019-01-07 14:30:48,585 INFO L226 Difference]: Without dead ends: 5 [2019-01-07 14:30:48,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-07 14:30:48,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-01-07 14:30:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-01-07 14:30:48,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-01-07 14:30:48,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-01-07 14:30:48,620 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 14:30:48,620 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 14:30:48,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:30:48,622 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:30:48,622 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:30:48,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:30:48,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:30:48,623 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-01-07 14:30:48,623 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-01-07 14:30:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-07 14:30:48,629 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-01-07 14:30:48,629 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:30:48,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-07 14:30:48,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-01-07 14:30:48,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-01-07 14:30:48,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-01-07 14:30:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-07 14:30:48,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-01-07 14:30:48,634 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-01-07 14:30:48,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-07 14:30:48,635 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-01-07 14:30:48,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-07 14:30:48,638 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-01-07 14:30:48,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-01-07 14:30:48,639 INFO L394 BasicCegarLoop]: Found error trace [2019-01-07 14:30:48,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-01-07 14:30:48,639 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-01-07 14:30:48,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-07 14:30:48,640 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2019-01-07 14:30:48,640 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-01-07 14:30:48,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:30:48,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-07 14:30:48,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-07 14:30:48,642 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-01-07 14:30:48,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-07 14:30:49,005 INFO L273 TraceCheckUtils]: 0: Hoare triple {45#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~8, main_#t~mem5, main_#t~post4, main_~i~9, main_~n~7, main_~x~7.base, main_~x~7.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~n~7 := main_#t~nondet0;havoc main_#t~nondet0;assume !!(0 <= main_~n~7 && main_~n~7 <= 1000);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := main_~n~7 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~x~7.base, main_~x~7.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~8 := 0; {47#(and (= ULTIMATE.start_main_~i~8 0) (= ULTIMATE.start_main_~x~7.offset 0))} is VALID [2019-01-07 14:30:49,019 INFO L273 TraceCheckUtils]: 1: Hoare triple {47#(and (= ULTIMATE.start_main_~i~8 0) (= ULTIMATE.start_main_~x~7.offset 0))} assume !!(main_~i~8 < main_~n~7);write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 0, main_~x~7.base, main_~x~7.offset + main_~i~8 * 4, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];main_#t~post2 := main_~i~8;main_~i~8 := main_#t~post2 + 1;havoc main_#t~post2; {48#(and (= ULTIMATE.start_main_~x~7.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x~7.base) 0)))} is VALID [2019-01-07 14:30:49,030 INFO L273 TraceCheckUtils]: 2: Hoare triple {48#(and (= ULTIMATE.start_main_~x~7.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_main_~x~7.base) 0)))} assume !(main_~i~8 < main_~n~7);main_~i~9 := 0;assume !!(main_~i~9 < main_~n~7);read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := main_~x~7.base, main_~x~7.offset + main_~i~9 * 4, 4;havoc read~int_#value;assume read~int_#value == #memory_int[read~int_#ptr.base,read~int_#ptr.offset];main_#t~mem5 := read~int_#value;__VERIFIER_assert_#in~cond := (if main_#t~mem5 == 0 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {46#false} is VALID [2019-01-07 14:30:49,031 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-01-07 14:30:49,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-07 14:30:49,032 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-07 14:30:49,032 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-01-07 14:30:49,033 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-01-07 14:30:49,037 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-01-07 14:30:49,117 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-01-07 14:30:49,117 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 14:30:50,855 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-07 14:30:50,856 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-07 14:30:50,858 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 14:30:50,860 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 14:30:50,860 WARN L224 ngHoareTripleChecker]: Pre: {2147483647#(forall ((v_idx_7 Int) (v_idx_8 Int) (v_idx_9 Int) (v_idx_12 Int) (v_idx_3 Int) (v_idx_10 Int) (v_idx_4 Int) (v_idx_11 Int) (v_idx_5 Int) (v_idx_6 Int) (v_idx_1 Int) (v_idx_2 Int)) (exists ((v_v_9_1 Int) (v_v_10_1 (Array Int Int)) (v_v_11_1 Int) (v_v_8_1 (Array Int Int)) (v_v_0_1 Int) (v_v_1_1 Int) (v_v_2_1 Int) (v_v_3_1 (Array Int Int)) (v_v_4_1 Int) (v_v_5_1 Int) (v_v_6_1 Int) (v_v_7_1 Int)) (and (= (select |c_old(#length)| v_idx_9) v_v_2_1) (= (select v_v_10_1 v_idx_2) v_v_11_1) (= (select |c_#valid| v_idx_3) v_v_6_1) (= (select v_v_8_1 v_idx_1) v_v_9_1) (= (select |c_ULTIMATE.start_#Ultimate.alloc_old_#valid| v_idx_5) v_v_0_1) (= v_v_8_1 (select |c_#memory_int| v_idx_6)) (= (select |c_#length| v_idx_8) v_v_1_1) (= v_v_3_1 (select |c_ULTIMATE.start_write~int_old_#memory_int| v_idx_10)) (= v_v_5_1 (select |c_ULTIMATE.start_#Ultimate.alloc_old_#length| v_idx_12)) (= v_v_4_1 (select v_v_3_1 v_idx_11)) (= (select |c_old(#memory_int)| v_idx_7) v_v_10_1) (= v_v_7_1 (select |c_old(#valid)| v_idx_4)))))} [2019-01-07 14:30:50,861 WARN L228 ngHoareTripleChecker]: Action: #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~8, main_#t~mem5, main_#t~post4, main_~i~9, main_~n~7, main_~x~7.base, main_~x~7.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~n~7 := main_#t~nondet0;havoc main_#t~nondet0;assume !!(0 <= main_~n~7 && main_~n~7 <= 1000);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := main_~n~7 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~x~7.base, main_~x~7.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~8 := 0; [2019-01-07 14:30:50,862 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (= 0 |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed|)) (= |c_#length_primed| (store |c_ULTIMATE.start_#Ultimate.alloc_old_#length_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed| |c_ULTIMATE.start_#Ultimate.alloc_~size_primed|)) (= |c_ULTIMATE.start_#Ultimate.alloc_old_#length_primed| |c_#length|) (<= 0 (+ c_ULTIMATE.start_main_~n~7_primed 2147483648)) (= |c_#NULL.base_primed| 0) (= |c_ULTIMATE.start_#Ultimate.alloc_old_#valid_primed| (store |c_#valid| 0 0)) (= |c_ULTIMATE.start_main_#t~malloc1.offset_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.offset_primed|) (= c_ULTIMATE.start_main_~x~7.offset_primed |c_ULTIMATE.start_main_#t~malloc1.offset_primed|) (= c_ULTIMATE.start_main_~i~8_primed 0) (= (store |c_ULTIMATE.start_#Ultimate.alloc_old_#valid_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed| 1) |c_#valid_primed|) (<= c_ULTIMATE.start_main_~n~7_primed 1000) (= |c_ULTIMATE.start_main_#t~malloc1.base_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed|) (= |c_ULTIMATE.start_#Ultimate.alloc_#res.offset_primed| 0) (= 0 (select |c_ULTIMATE.start_#Ultimate.alloc_old_#valid_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed|)) (= c_ULTIMATE.start_main_~x~7.base_primed |c_ULTIMATE.start_main_#t~malloc1.base_primed|) (= |c_ULTIMATE.start_#Ultimate.alloc_~size_primed| (* 4 c_ULTIMATE.start_main_~n~7_primed)) (= |c_#NULL.offset_primed| 0) (<= c_ULTIMATE.start_main_~n~7_primed 2147483647) (<= 0 c_ULTIMATE.start_main_~n~7_primed)) [2019-01-07 14:30:50,865 WARN L230 ngHoareTripleChecker]: Post: {2147483646#(forall ((v_idx_25 Int) (v_idx_14 Int) (v_idx_26 Int) (v_idx_15 Int) (v_idx_23 Int) (v_idx_24 Int) (v_idx_13 Int) (v_idx_21 Int) (v_idx_22 Int) (v_idx_30 Int) (v_idx_20 Int) (v_idx_29 Int) (v_idx_18 Int) (v_idx_19 Int) (v_idx_27 Int) (v_idx_16 Int) (v_idx_28 Int) (v_idx_17 Int)) (exists ((v_b_6_1 Int) (v_v_24_1 Int) (v_b_7_1 Int) (v_v_25_1 Int) (v_v_10_1 (Array Int Int)) (v_v_11_1 Int) (v_v_23_1 Int) (v_v_31_1 Int) (v_v_30_1 Int) (v_v_19_1 Int) (v_v_17_1 Int) (v_v_18_1 Int) (v_v_29_1 Int) (v_b_11_1 Int) (v_v_9_1 Int) (v_v_8_1 (Array Int Int)) (v_v_1_1 Int) (v_v_2_1 Int) (v_b_2_1 Int) (v_v_3_1 (Array Int Int)) (v_v_4_1 Int) (v_b_3_1 Int) (v_b_10_1 Int) (v_v_7_1 Int)) (and (<= (- (- |c_#NULL.offset|) |c_#NULL.offset|) 0) (= v_v_10_1 (select |c_old(#memory_int)| v_idx_20)) (<= (- c_ULTIMATE.start_main_~x~7.offset (- c_ULTIMATE.start_main_~x~7.offset)) 0) (<= (- |c_#NULL.base| |c_ULTIMATE.start_main_#t~malloc1.offset|) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| v_v_18_1) 4000) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) |c_ULTIMATE.start_#Ultimate.alloc_~size|) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) v_v_30_1) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) (- v_v_30_1)) 0) (<= (- (- |c_ULTIMATE.start_main_#t~malloc1.offset|) (- v_v_30_1)) 4000) (<= (- |c_ULTIMATE.start_main_#t~malloc1.offset| (- |c_ULTIMATE.start_main_#t~malloc1.offset|)) 0) (= (select |c_ULTIMATE.start_#Ultimate.alloc_old_#length| v_idx_30) v_v_1_1) (<= (- c_ULTIMATE.start_main_~n~7 (- v_v_30_1)) 5000) (<= (- (- v_b_3_1) (- v_b_6_1)) (- 1)) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) |c_ULTIMATE.start_main_#t~malloc1.offset|) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.base| v_b_6_1) 0) (<= (- (- |c_#NULL.base|) (- |c_ULTIMATE.start_main_#t~malloc1.offset|)) 0) (<= (- v_b_10_1 v_b_7_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~x~7.offset) v_v_30_1) 0) (<= (- (- c_ULTIMATE.start_main_~i~8) (- v_v_24_1)) 1) (<= (- (- v_v_24_1) v_v_30_1) (- 1)) (<= (- |c_#NULL.offset| c_ULTIMATE.start_main_~n~7) 0) (<= (- (- |c_ULTIMATE.start_main_#t~malloc1.offset|) (- c_ULTIMATE.start_main_~n~7)) 1000) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) (- v_v_24_1)) 1) (<= (- (- v_b_11_1) (- v_b_7_1)) 0) (<= (- c_ULTIMATE.start_main_~i~8 (- c_ULTIMATE.start_main_~n~7)) 1000) (<= (- (- |c_#NULL.offset|) c_ULTIMATE.start_main_~n~7) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) (- |c_ULTIMATE.start_main_#t~malloc1.offset|)) 0) (<= (- |c_#NULL.base| (- |c_#NULL.base|)) 0) (= v_v_9_1 (select v_v_8_1 v_idx_13)) (<= (- c_ULTIMATE.start_main_~i~8 c_ULTIMATE.start_main_~n~7) 0) (<= (- |c_#NULL.base| (- v_v_18_1)) 0) (<= (- (- c_ULTIMATE.start_main_~i~8) v_v_30_1) 0) (<= (- c_ULTIMATE.start_main_~n~7 (- v_v_18_1)) 1000) (<= (- (- |c_ULTIMATE.start_main_#t~malloc1.offset|) c_ULTIMATE.start_main_~i~8) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) v_v_30_1) 0) (<= (- (- v_b_11_1) (- v_b_6_1)) (- 1)) (<= (- |c_#NULL.base| c_ULTIMATE.start_main_~n~7) 0) (<= (- |c_#NULL.base| |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) 0) (<= (- c_ULTIMATE.start_main_~n~7 (- c_ULTIMATE.start_main_~n~7)) 2000) (<= (- |c_#NULL.base| |c_ULTIMATE.start_#Ultimate.alloc_~size|) 0) (<= (- v_b_11_1 v_b_3_1) 0) (<= (- (- |c_#NULL.base|) |c_#NULL.offset|) 0) (<= (- |c_#NULL.offset| |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) 0) (<= (- |c_#NULL.base| c_ULTIMATE.start_main_~i~8) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| (- c_ULTIMATE.start_main_~x~7.offset)) 4000) (<= (- (- c_ULTIMATE.start_main_~n~7) (- v_v_24_1)) 1) (<= (- (- c_ULTIMATE.start_main_~x~7.offset) c_ULTIMATE.start_main_~x~7.offset) 0) (<= (- (- |c_#NULL.base|) (- v_v_30_1)) 4000) (<= (- |c_#NULL.base| (- |c_ULTIMATE.start_main_#t~malloc1.offset|)) 0) (= |c_ULTIMATE.start_#Ultimate.alloc_#res.base| v_b_2_1) (<= (- |c_#NULL.offset| (- v_v_24_1)) 1) (<= (- (- v_b_2_1) (- v_b_7_1)) 1) (<= (- (- |c_#NULL.offset|) (- |c_ULTIMATE.start_#Ultimate.alloc_~size|)) 4000) (<= (- |c_ULTIMATE.start_main_#t~malloc1.offset| c_ULTIMATE.start_main_~n~7) 0) (= v_b_2_1 v_b_10_1) (<= (- v_b_11_1 v_b_2_1) 1) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) (- v_v_18_1)) 0) (<= (- c_ULTIMATE.start_main_~n~7 v_v_24_1) 999) (<= (- (- c_ULTIMATE.start_main_~n~7) c_ULTIMATE.start_main_~n~7) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.base| v_b_7_1) (- 1)) (<= (- (- |c_#NULL.offset|) |c_ULTIMATE.start_#Ultimate.alloc_~size|) 0) (<= (- (- |c_ULTIMATE.start_main_#t~malloc1.offset|) (- c_ULTIMATE.start_main_~i~8)) 0) (<= (- (- c_ULTIMATE.start_main_~x~7.offset) (- v_v_30_1)) 4000) (<= (- (- |c_#NULL.offset|) |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) 0) (<= (- |c_ULTIMATE.start_main_#t~malloc1.offset| v_v_30_1) 0) (<= (- (- v_v_18_1) (- v_v_24_1)) 1) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| c_ULTIMATE.start_main_~i~8) 4000) (<= (- v_b_11_1 v_b_7_1) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| c_ULTIMATE.start_main_~n~7) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| (- v_v_24_1)) 4001) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| c_ULTIMATE.start_main_~n~7) 4000) (<= (- (- v_b_2_1) (- v_b_6_1)) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|)) 0) (<= (- c_ULTIMATE.start_main_~i~8 v_v_30_1) 0) (<= (- c_ULTIMATE.start_main_~x~7.offset (- v_v_30_1)) 4000) (<= (- (- |c_#NULL.offset|) |c_ULTIMATE.start_main_#t~malloc1.offset|) 0) (<= (- (- |c_#NULL.offset|) (- v_v_24_1)) 1) (<= (- (- |c_#NULL.base|) (- |c_ULTIMATE.start_#Ultimate.alloc_~size|)) 4000) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| |c_ULTIMATE.start_#Ultimate.alloc_~size|) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| c_ULTIMATE.start_main_~i~8) 0) (<= (- (- c_ULTIMATE.start_main_~n~7) c_ULTIMATE.start_main_~x~7.offset) 0) (<= (- |c_ULTIMATE.start_main_#t~malloc1.offset| (- v_v_30_1)) 4000) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) c_ULTIMATE.start_main_~n~7) 0) (<= (- (- c_ULTIMATE.start_main_~x~7.offset) v_v_24_1) (- 1)) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) c_ULTIMATE.start_main_~i~8) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.base|) (- v_b_2_1)) 0) (<= (- v_b_10_1 v_b_6_1) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) (- |c_ULTIMATE.start_#Ultimate.alloc_~size|)) 4000) (<= (- (- c_ULTIMATE.start_main_~x~7.offset) (- v_v_24_1)) 1) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| (- v_v_30_1)) 8000) (= v_b_7_1 (+ v_b_6_1 1)) (<= (- (- c_ULTIMATE.start_main_~i~8) c_ULTIMATE.start_main_~x~7.offset) 0) (or (= (select |c_#valid| v_idx_16) v_v_23_1) (<= v_b_6_1 v_idx_16)) (<= (- (- |c_ULTIMATE.start_main_#t~malloc1.offset|) v_v_24_1) (- 1)) (<= (- (- v_v_18_1) v_v_30_1) 0) (<= (- (- v_v_18_1) v_v_18_1) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) |c_ULTIMATE.start_#Ultimate.alloc_~size|) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.base| v_b_11_1) (- 1)) (<= (- v_b_3_1 v_b_6_1) 1) (<= (- (- v_v_30_1) v_v_30_1) 0) (<= (- (- c_ULTIMATE.start_main_~n~7) v_v_30_1) 0) (<= (- |c_#NULL.offset| |c_ULTIMATE.start_main_#t~malloc1.offset|) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) c_ULTIMATE.start_main_~n~7) 0) (<= (- v_b_11_1 v_b_6_1) 1) (<= (- v_b_2_1 v_b_7_1) (- 1)) (<= (- (- |c_#NULL.offset|) v_v_18_1) 0) (<= (- |c_#NULL.offset| (- |c_ULTIMATE.start_#Ultimate.alloc_~size|)) 4000) (<= (- v_b_2_1 v_b_3_1) (- 1)) (<= (- (- |c_#NULL.offset|) v_v_30_1) 0) (<= (- c_ULTIMATE.start_main_~i~8 (- v_v_30_1)) 4000) (= (select |c_old(#length)| v_idx_24) v_v_2_1) (<= (- (- v_v_24_1) (- v_v_30_1)) 3999) (<= (- |c_#NULL.base| (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|)) 0) (<= (- (- |c_#NULL.base|) c_ULTIMATE.start_main_~n~7) 0) (<= (- (- |c_ULTIMATE.start_main_#t~malloc1.offset|) c_ULTIMATE.start_main_~n~7) 0) (<= (- |c_ULTIMATE.start_main_#t~malloc1.offset| (- c_ULTIMATE.start_main_~x~7.offset)) 0) (= (+ v_b_2_1 1) (+ v_b_6_1 1)) (<= (- |c_#NULL.offset| (- c_ULTIMATE.start_main_~i~8)) 0) (<= (- (- |c_#NULL.offset|) c_ULTIMATE.start_main_~x~7.offset) 0) (<= (- (- |c_#NULL.offset|) (- c_ULTIMATE.start_main_~x~7.offset)) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.base| v_b_3_1) (- 1)) (<= (- |c_#NULL.base| c_ULTIMATE.start_main_~x~7.offset) 0) (<= (- (- |c_#NULL.base|) (- v_v_18_1)) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| (- |c_ULTIMATE.start_main_#t~malloc1.offset|)) 4000) (<= (- (- v_b_10_1) (- v_b_2_1)) 0) (= v_b_3_1 (+ v_b_6_1 1)) (<= (- (- |c_#NULL.base|) |c_#NULL.base|) 0) (<= (- c_ULTIMATE.start_main_~n~7 (- v_v_24_1)) 1001) (<= (- (- |c_#NULL.base|) (- c_ULTIMATE.start_main_~n~7)) 1000) (<= (- v_v_24_1 (- v_v_30_1)) 4001) (<= (- (- |c_#NULL.offset|) (- |c_ULTIMATE.start_main_#t~malloc1.offset|)) 0) (<= (- |c_#NULL.base| v_v_18_1) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) (- v_v_24_1)) 1) (<= (- (- |c_#NULL.base|) v_v_30_1) 0) (<= (- v_b_10_1 v_b_11_1) (- 1)) (<= (- (- v_b_10_1) (- v_b_7_1)) 1) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) v_v_18_1) 0) (<= (- |c_#NULL.base| (- v_v_24_1)) 1) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| (- v_v_30_1)) 4000) (<= (- |c_#NULL.base| |c_#NULL.offset|) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| (- c_ULTIMATE.start_main_~i~8)) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) v_v_24_1) (- 1)) (<= (- c_ULTIMATE.start_main_~x~7.offset v_v_18_1) 0) (<= (- (- |c_#NULL.base|) (- c_ULTIMATE.start_main_~i~8)) 0) (= (+ |c_ULTIMATE.start_#Ultimate.alloc_#res.base| 1) (+ v_b_6_1 1)) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| (- |c_ULTIMATE.start_main_#t~malloc1.offset|)) 0) (<= (- (- |c_#NULL.base|) (- v_v_24_1)) 1) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| |c_ULTIMATE.start_main_#t~malloc1.offset|) 0) (<= (- c_ULTIMATE.start_main_~i~8 (- c_ULTIMATE.start_main_~i~8)) 0) (<= (- (- |c_#NULL.base|) v_v_24_1) (- 1)) (or (< v_idx_18 v_b_7_1) (= (select |c_#valid| v_idx_18) v_v_25_1)) (<= (- (- |c_ULTIMATE.start_main_#t~malloc1.offset|) v_v_30_1) 0) (= (+ v_b_10_1 1) (+ v_b_6_1 1)) (<= (- (- v_b_11_1) (- v_b_3_1)) 0) (<= (- c_ULTIMATE.start_main_~i~8 v_v_18_1) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) (- v_v_30_1)) 4000) (<= (- (- c_ULTIMATE.start_main_~i~8) v_v_18_1) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) (- c_ULTIMATE.start_main_~x~7.offset)) 0) (<= (- (- c_ULTIMATE.start_main_~n~7) v_v_24_1) (- 1)) (<= (- |c_#NULL.base| (- c_ULTIMATE.start_main_~i~8)) 0) (<= (- (- c_ULTIMATE.start_main_~n~7) (- c_ULTIMATE.start_main_~x~7.offset)) 0) (<= (- |c_#NULL.base| v_v_30_1) 0) (<= (- |c_#NULL.offset| (- |c_ULTIMATE.start_main_#t~malloc1.offset|)) 0) (<= (- (- |c_#NULL.offset|) (- c_ULTIMATE.start_main_~n~7)) 1000) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| v_v_24_1) (- 1)) (<= (- (- |c_#NULL.base|) (- |c_#NULL.offset|)) 0) (<= (- c_ULTIMATE.start_main_~i~8 v_v_24_1) (- 1)) (<= (- c_ULTIMATE.start_main_~x~7.offset v_v_24_1) (- 1)) (<= (- (- c_ULTIMATE.start_main_~i~8) v_v_24_1) (- 1)) (<= (- v_v_18_1 v_v_24_1) (- 1)) (or (< v_idx_28 v_b_11_1) (= (select |c_#length| v_idx_28) v_v_31_1)) (<= (- (- v_b_11_1) (- v_b_2_1)) (- 1)) (<= (- |c_#NULL.base| (- v_v_30_1)) 4000) (<= (- (- c_ULTIMATE.start_main_~i~8) (- c_ULTIMATE.start_main_~n~7)) 1000) (<= (- c_ULTIMATE.start_main_~i~8 c_ULTIMATE.start_main_~x~7.offset) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| (- |c_ULTIMATE.start_#Ultimate.alloc_~size|)) 4000) (<= (- v_v_18_1 (- v_v_30_1)) 4000) (<= (- (- |c_ULTIMATE.start_main_#t~malloc1.offset|) |c_ULTIMATE.start_main_#t~malloc1.offset|) 0) (<= (- |c_#NULL.offset| c_ULTIMATE.start_main_~i~8) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| (- c_ULTIMATE.start_main_~n~7)) 5000) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.base| v_b_2_1) 0) (<= (- c_ULTIMATE.start_main_~n~7 v_v_30_1) 1000) (<= (- c_ULTIMATE.start_main_~n~7 v_v_18_1) 1000) (<= (- (- v_b_10_1) (- v_b_6_1)) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| v_v_30_1) 0) (<= (- |c_ULTIMATE.start_main_#t~malloc1.offset| c_ULTIMATE.start_main_~x~7.offset) 0) (<= (- |c_#NULL.offset| v_v_18_1) 0) (<= (- (- |c_#NULL.offset|) (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|)) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) (- c_ULTIMATE.start_main_~i~8)) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| (- v_v_24_1)) 1) (<= (- (- c_ULTIMATE.start_main_~i~8) c_ULTIMATE.start_main_~i~8) 0) (<= (- (- |c_#NULL.offset|) (- v_v_18_1)) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) v_v_18_1) 0) (or (< v_idx_27 v_b_10_1) (= (select |c_#length| v_idx_27) v_v_30_1) (<= v_b_11_1 v_idx_27)) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) (- c_ULTIMATE.start_main_~i~8)) 0) (<= (- (- |c_#NULL.base|) c_ULTIMATE.start_main_~i~8) 0) (<= (- |c_ULTIMATE.start_main_#t~malloc1.offset| (- c_ULTIMATE.start_main_~n~7)) 1000) (<= (- |c_#NULL.offset| c_ULTIMATE.start_main_~x~7.offset) 0) (<= (- |c_#NULL.base| (- |c_#NULL.offset|)) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| (- v_v_18_1)) 0) (<= (- (- |c_#NULL.offset|) v_v_24_1) (- 1)) (or (< v_idx_17 v_b_6_1) (<= v_b_7_1 v_idx_17) (= (select |c_#valid| v_idx_17) v_v_24_1)) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| v_v_18_1) 0) (<= (- v_v_18_1 (- v_v_24_1)) 1) (= v_v_3_1 (select |c_ULTIMATE.start_write~int_old_#memory_int| v_idx_25)) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| |c_ULTIMATE.start_main_#t~malloc1.offset|) 4000) (= (select v_v_10_1 v_idx_14) v_v_11_1) (<= (- |c_#NULL.offset| v_v_24_1) (- 1)) (= v_v_4_1 (select v_v_3_1 v_idx_29)) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.base|) (- v_b_7_1)) 1) (<= (- |c_#NULL.base| v_v_24_1) (- 1)) (<= (- c_ULTIMATE.start_main_~i~8 (- v_v_24_1)) 1) (<= (- v_v_24_1 v_v_30_1) 1) (<= (- (- v_v_18_1) v_v_24_1) (- 1)) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| (- c_ULTIMATE.start_main_~i~8)) 4000) (<= (- (- v_b_2_1) (- v_b_3_1)) 1) (= (select |c_old(#valid)| v_idx_15) v_v_7_1) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) v_v_24_1) (- 1)) (<= (- (- |c_ULTIMATE.start_main_#t~malloc1.offset|) (- c_ULTIMATE.start_main_~x~7.offset)) 0) (<= (- |c_ULTIMATE.start_main_#t~malloc1.offset| v_v_24_1) (- 1)) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.base| v_b_10_1) 0) (<= (- (- c_ULTIMATE.start_main_~n~7) (- v_v_18_1)) 0) (<= (- (- v_b_10_1) (- v_b_11_1)) 1) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) (- c_ULTIMATE.start_main_~x~7.offset)) 0) (<= (- v_v_24_1 (- v_v_24_1)) 2) (<= (- |c_ULTIMATE.start_main_#t~malloc1.offset| c_ULTIMATE.start_main_~i~8) 0) (<= (- |c_ULTIMATE.start_main_#t~malloc1.offset| (- v_v_24_1)) 1) (= v_b_11_1 (+ v_b_6_1 1)) (<= (- (- |c_ULTIMATE.start_main_#t~malloc1.offset|) c_ULTIMATE.start_main_~x~7.offset) 0) (<= (- (- c_ULTIMATE.start_main_~i~8) (- c_ULTIMATE.start_main_~x~7.offset)) 0) (<= (- v_v_30_1 (- v_v_30_1)) 8000) (<= (- (- c_ULTIMATE.start_main_~n~7) (- v_v_30_1)) 4000) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) (- |c_ULTIMATE.start_main_#t~malloc1.offset|)) 0) (<= (- v_b_10_1 v_b_3_1) (- 1)) (<= (- (- |c_#NULL.offset|) (- v_v_30_1)) 4000) (<= (- |c_#NULL.offset| (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|)) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| (- c_ULTIMATE.start_main_~n~7)) 1000) (<= (- |c_#NULL.offset| (- c_ULTIMATE.start_main_~x~7.offset)) 0) (<= (- (- c_ULTIMATE.start_main_~x~7.offset) (- v_v_18_1)) 0) (<= (- |c_#NULL.offset| (- v_v_18_1)) 0) (<= (- |c_#NULL.base| (- c_ULTIMATE.start_main_~x~7.offset)) 0) (<= (- (- v_v_24_1) v_v_24_1) (- 2)) (<= (- c_ULTIMATE.start_main_~n~7 (- c_ULTIMATE.start_main_~x~7.offset)) 1000) (<= (- (- |c_#NULL.base|) (- c_ULTIMATE.start_main_~x~7.offset)) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) (- c_ULTIMATE.start_main_~n~7)) 1000) (or (= (select |c_#length| v_idx_26) v_v_29_1) (<= v_b_10_1 v_idx_26)) (<= (- (- |c_ULTIMATE.start_main_#t~malloc1.offset|) (- v_v_18_1)) 0) (<= (- v_v_18_1 v_v_30_1) 0) (= v_b_6_1 v_b_2_1) (<= (- (- |c_ULTIMATE.start_main_#t~malloc1.offset|) v_v_18_1) 0) (<= (- (- c_ULTIMATE.start_main_~n~7) v_v_18_1) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.base|) (- v_b_6_1)) 0) (<= (- (- c_ULTIMATE.start_main_~x~7.offset) v_v_18_1) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| v_v_30_1) 0) (<= (- |c_#NULL.base| (- c_ULTIMATE.start_main_~n~7)) 1000) (<= (- v_v_18_1 (- v_v_18_1)) 0) (<= (- (- |c_#NULL.base|) |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) 0) (= v_b_2_1 (+ v_b_7_1 (- 1))) (<= (- (- c_ULTIMATE.start_main_~i~8) (- v_v_18_1)) 0) (<= (- c_ULTIMATE.start_main_~x~7.offset (- v_v_18_1)) 0) (<= (- (- |c_ULTIMATE.start_main_#t~malloc1.offset|) (- v_v_24_1)) 1) (or (= (select |c_ULTIMATE.start_#Ultimate.alloc_old_#valid| v_idx_23) v_v_19_1) (< v_idx_23 v_b_3_1)) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| (- c_ULTIMATE.start_main_~x~7.offset)) 0) (<= (- (- c_ULTIMATE.start_main_~i~8) (- v_v_30_1)) 4000) (<= (- (- |c_#NULL.base|) |c_ULTIMATE.start_#Ultimate.alloc_~size|) 0) (<= (- (- c_ULTIMATE.start_main_~i~8) c_ULTIMATE.start_main_~n~7) 0) (<= (- (- |c_#NULL.base|) v_v_18_1) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.base|) (- v_b_10_1)) 0) (<= (- |c_ULTIMATE.start_main_#t~malloc1.offset| (- c_ULTIMATE.start_main_~i~8)) 0) (<= (- c_ULTIMATE.start_main_~n~7 c_ULTIMATE.start_main_~x~7.offset) 1000) (<= (- (- v_b_10_1) (- v_b_3_1)) 1) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) |c_ULTIMATE.start_main_#t~malloc1.offset|) 0) (<= (- c_ULTIMATE.start_main_~x~7.offset (- v_v_24_1)) 1) (<= (- (- v_b_6_1) (- v_b_7_1)) 1) (<= (- |c_#NULL.offset| (- c_ULTIMATE.start_main_~n~7)) 1000) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.base|) (- v_b_11_1)) 1) (or (= (select |c_ULTIMATE.start_#Ultimate.alloc_old_#valid| v_idx_22) v_v_18_1) (< v_idx_22 v_b_2_1) (<= v_b_3_1 v_idx_22)) (<= (- (- |c_#NULL.offset|) c_ULTIMATE.start_main_~i~8) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.base|) (- v_b_3_1)) 1) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| (- v_v_18_1)) 4000) (<= (- c_ULTIMATE.start_main_~x~7.offset v_v_30_1) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) (- c_ULTIMATE.start_main_~n~7)) 1000) (<= (- |c_ULTIMATE.start_main_#t~malloc1.offset| (- v_v_18_1)) 0) (<= (- (- v_v_18_1) (- v_v_30_1)) 4000) (<= (- (- v_b_3_1) (- v_b_7_1)) 0) (<= (- (- |c_#NULL.offset|) (- c_ULTIMATE.start_main_~i~8)) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) c_ULTIMATE.start_main_~x~7.offset) 0) (<= (- |c_#NULL.offset| (- |c_#NULL.offset|)) 0) (<= (- c_ULTIMATE.start_main_~i~8 (- v_v_18_1)) 0) (<= (- (- |c_#NULL.base|) |c_ULTIMATE.start_main_#t~malloc1.offset|) 0) (<= (- (- |c_#NULL.base|) c_ULTIMATE.start_main_~x~7.offset) 0) (= v_v_8_1 (select |c_#memory_int| v_idx_19)) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) 0) (<= (- |c_#NULL.offset| |c_ULTIMATE.start_#Ultimate.alloc_~size|) 0) (<= (- (- |c_#NULL.base|) (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|)) 0) (<= (- |c_#NULL.base| (- |c_ULTIMATE.start_#Ultimate.alloc_~size|)) 4000) (<= (- v_b_6_1 v_b_7_1) (- 1)) (or (<= v_b_2_1 v_idx_21) (= (select |c_ULTIMATE.start_#Ultimate.alloc_old_#valid| v_idx_21) v_v_17_1)) (<= (- c_ULTIMATE.start_main_~i~8 (- c_ULTIMATE.start_main_~x~7.offset)) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) (- v_v_18_1)) 0) (<= (- |c_#NULL.offset| (- v_v_30_1)) 4000) (<= (- v_b_2_1 v_b_6_1) 0) (<= (- v_b_10_1 v_b_2_1) 0) (<= (- |c_ULTIMATE.start_main_#t~malloc1.offset| v_v_18_1) 0) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_~size|) c_ULTIMATE.start_main_~i~8) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| c_ULTIMATE.start_main_~x~7.offset) 4000) (= v_b_2_1 (+ v_b_3_1 (- 1))) (<= (- v_b_3_1 v_b_7_1) 0) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| (- |c_ULTIMATE.start_#Ultimate.alloc_~size|)) 8000) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_~size| v_v_24_1) 3999) (<= (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset| c_ULTIMATE.start_main_~x~7.offset) 0) (= v_b_2_1 (+ v_b_11_1 (- 1))) (<= (- (- |c_ULTIMATE.start_#Ultimate.alloc_#res.offset|) c_ULTIMATE.start_main_~x~7.offset) 0) (<= (- |c_#NULL.offset| v_v_30_1) 0))))} [2019-01-07 14:30:50,866 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 14:30:50,867 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 14:30:50,867 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 14:30:50,973 WARN L270 ngHoareTripleChecker]: Pre: {2147483647#true} [2019-01-07 14:30:50,974 WARN L274 ngHoareTripleChecker]: Action: #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];havoc main_#res;havoc main_#t~nondet0, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~post2, main_~i~8, main_#t~mem5, main_#t~post4, main_~i~9, main_~n~7, main_~x~7.base, main_~x~7.offset;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~n~7 := main_#t~nondet0;havoc main_#t~nondet0;assume !!(0 <= main_~n~7 && main_~n~7 <= 1000);#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := main_~n~7 * 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~x~7.base, main_~x~7.offset := main_#t~malloc1.base, main_#t~malloc1.offset;main_~i~8 := 0; [2019-01-07 14:30:50,975 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (and (not (= 0 |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed|)) (= |c_#length_primed| (store |c_ULTIMATE.start_#Ultimate.alloc_old_#length_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed| |c_ULTIMATE.start_#Ultimate.alloc_~size_primed|)) (= |c_ULTIMATE.start_#Ultimate.alloc_old_#length_primed| |c_#length|) (<= 0 (+ c_ULTIMATE.start_main_~n~7_primed 2147483648)) (= |c_#NULL.base_primed| 0) (= |c_ULTIMATE.start_#Ultimate.alloc_old_#valid_primed| (store |c_#valid| 0 0)) (= |c_ULTIMATE.start_main_#t~malloc1.offset_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.offset_primed|) (= c_ULTIMATE.start_main_~x~7.offset_primed |c_ULTIMATE.start_main_#t~malloc1.offset_primed|) (= c_ULTIMATE.start_main_~i~8_primed 0) (= (store |c_ULTIMATE.start_#Ultimate.alloc_old_#valid_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed| 1) |c_#valid_primed|) (<= c_ULTIMATE.start_main_~n~7_primed 1000) (= |c_ULTIMATE.start_main_#t~malloc1.base_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed|) (= |c_ULTIMATE.start_#Ultimate.alloc_#res.offset_primed| 0) (= 0 (select |c_ULTIMATE.start_#Ultimate.alloc_old_#valid_primed| |c_ULTIMATE.start_#Ultimate.alloc_#res.base_primed|)) (= c_ULTIMATE.start_main_~x~7.base_primed |c_ULTIMATE.start_main_#t~malloc1.base_primed|) (= |c_ULTIMATE.start_#Ultimate.alloc_~size_primed| (* 4 c_ULTIMATE.start_main_~n~7_primed)) (= |c_#NULL.offset_primed| 0) (<= c_ULTIMATE.start_main_~n~7_primed 2147483647) (<= 0 c_ULTIMATE.start_main_~n~7_primed))