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-a9d37a5-m [2019-02-28 13:33:16,464 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 13:33:16,466 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 13:33:16,483 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 13:33:16,483 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 13:33:16,484 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 13:33:16,486 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 13:33:16,488 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 13:33:16,490 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 13:33:16,492 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 13:33:16,493 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 13:33:16,493 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 13:33:16,496 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 13:33:16,499 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 13:33:16,500 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 13:33:16,501 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 13:33:16,502 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 13:33:16,506 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 13:33:16,517 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 13:33:16,522 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 13:33:16,525 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 13:33:16,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 13:33:16,528 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 13:33:16,530 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 13:33:16,530 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 13:33:16,531 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 13:33:16,532 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 13:33:16,533 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 13:33:16,537 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 13:33:16,539 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 13:33:16,539 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 13:33:16,540 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 13:33:16,541 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 13:33:16,542 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 13:33:16,543 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 13:33:16,544 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 13:33:16,544 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-02-28 13:33:16,567 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 13:33:16,568 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 13:33:16,569 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 13:33:16,570 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 13:33:16,571 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 13:33:16,571 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 13:33:16,571 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 13:33:16,571 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 13:33:16,572 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 13:33:16,572 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-28 13:33:16,572 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 13:33:16,573 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 13:33:16,573 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 13:33:16,574 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 13:33:16,575 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 13:33:16,575 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 13:33:16,575 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 13:33:16,576 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 13:33:16,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 13:33:16,576 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 13:33:16,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 13:33:16,576 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 13:33:16,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 13:33:16,578 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 13:33:16,579 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 13:33:16,579 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 13:33:16,579 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 13:33:16,579 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 13:33:16,580 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 13:33:16,580 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 13:33:16,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:33:16,580 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 13:33:16,581 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 13:33:16,581 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 13:33:16,581 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 13:33:16,581 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 13:33:16,581 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 13:33:16,582 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 13:33:16,582 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 13:33:16,644 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 13:33:16,661 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 13:33:16,668 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 13:33:16,670 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 13:33:16,672 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 13:33:16,673 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-02-28 13:33:16,673 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/mcmillan2006.c.i_3.bpl' [2019-02-28 13:33:16,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 13:33:16,752 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 13:33:16,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 13:33:16,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 13:33:16,753 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 13:33:16,772 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 28.02 01:33:16" (1/1) ... [2019-02-28 13:33:16,785 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 28.02 01:33:16" (1/1) ... [2019-02-28 13:33:16,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 13:33:16,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 13:33:16,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 13:33:16,796 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 13:33:16,809 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 28.02 01:33:16" (1/1) ... [2019-02-28 13:33:16,809 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 28.02 01:33:16" (1/1) ... [2019-02-28 13:33:16,810 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 28.02 01:33:16" (1/1) ... [2019-02-28 13:33:16,811 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 28.02 01:33:16" (1/1) ... [2019-02-28 13:33:16,815 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 28.02 01:33:16" (1/1) ... [2019-02-28 13:33:16,817 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 28.02 01:33:16" (1/1) ... [2019-02-28 13:33:16,818 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 28.02 01:33:16" (1/1) ... [2019-02-28 13:33:16,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 13:33:16,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 13:33:16,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 13:33:16,821 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 13:33:16,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:16" (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:16092 -smt2 -in -t:200000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:200000 [2019-02-28 13:33:16,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 13:33:16,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 13:33:17,294 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 13:33:17,294 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-28 13:33:17,296 INFO L202 PluginConnector]: Adding new model mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 01:33:17 BoogieIcfgContainer [2019-02-28 13:33:17,296 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 13:33:17,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-28 13:33:17,297 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-28 13:33:17,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-28 13:33:17,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 01:33:16" (1/2) ... [2019-02-28 13:33:17,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ae46058 and model type mcmillan2006.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.02 01:33:17, skipping insertion in model container [2019-02-28 13:33:17,302 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 28.02 01:33:17" (2/2) ... [2019-02-28 13:33:17,304 INFO L112 eAbstractionObserver]: Analyzing ICFG mcmillan2006.c.i_3.bpl [2019-02-28 13:33:17,314 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-28 13:33:17,323 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-28 13:33:17,342 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-28 13:33:17,375 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-28 13:33:17,375 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-28 13:33:17,376 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-28 13:33:17,376 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-28 13:33:17,376 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-28 13:33:17,376 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-28 13:33:17,376 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-28 13:33:17,377 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-28 13:33:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2019-02-28 13:33:17,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-28 13:33:17,398 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:33:17,399 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-28 13:33:17,402 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:33:17,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:33:17,409 INFO L82 PathProgramCache]: Analyzing trace with hash 30017, now seen corresponding path program 1 times [2019-02-28 13:33:17,411 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:33:17,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:17,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:33:17,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:17,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:33:17,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:17,667 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-02-28 13:33:17,673 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-02-28 13:33:17,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {10#false} assume !false; {10#false} is VALID [2019-02-28 13:33:17,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:17,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-28 13:33:17,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-28 13:33:17,679 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-28 13:33:17,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:33:17,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-28 13:33:17,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-28 13:33:17,732 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:17,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-28 13:33:17,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-28 13:33:17,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-28 13:33:17,743 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2019-02-28 13:33:17,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:17,858 INFO L93 Difference]: Finished difference Result 9 states and 10 transitions. [2019-02-28 13:33:17,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-28 13:33:17,858 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-28 13:33:17,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-28 13:33:17,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:33:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-02-28 13:33:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-28 13:33:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 10 transitions. [2019-02-28 13:33:17,868 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 10 transitions. [2019-02-28 13:33:17,970 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-28 13:33:17,981 INFO L225 Difference]: With dead ends: 9 [2019-02-28 13:33:17,981 INFO L226 Difference]: Without dead ends: 5 [2019-02-28 13:33:17,984 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-02-28 13:33:18,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-02-28 13:33:18,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-02-28 13:33:18,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-28 13:33:18,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5 states. Second operand 5 states. [2019-02-28 13:33:18,071 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:33:18,071 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:33:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:18,075 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:33:18,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:33:18,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:18,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:18,077 INFO L74 IsIncluded]: Start isIncluded. First operand 5 states. Second operand 5 states. [2019-02-28 13:33:18,077 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 5 states. [2019-02-28 13:33:18,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-28 13:33:18,081 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-02-28 13:33:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:33:18,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-28 13:33:18,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-28 13:33:18,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-28 13:33:18,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-28 13:33:18,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-02-28 13:33:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-02-28 13:33:18,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-02-28 13:33:18,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-28 13:33:18,092 INFO L480 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-02-28 13:33:18,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-28 13:33:18,093 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-02-28 13:33:18,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-28 13:33:18,093 INFO L394 BasicCegarLoop]: Found error trace [2019-02-28 13:33:18,093 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-28 13:33:18,095 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-28 13:33:18,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-28 13:33:18,096 INFO L82 PathProgramCache]: Analyzing trace with hash 928552, now seen corresponding path program 1 times [2019-02-28 13:33:18,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-28 13:33:18,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:18,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-28 13:33:18,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-28 13:33:18,099 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-28 13:33:18,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-28 13:33:18,530 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-02-28 13:33:18,536 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-02-28 13:33:18,537 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-02-28 13:33:18,538 INFO L273 TraceCheckUtils]: 3: Hoare triple {46#false} assume !false; {46#false} is VALID [2019-02-28 13:33:18,538 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-28 13:33:18,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-28 13:33:18,541 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-28 13:33:18,542 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 5 with the following transitions: [2019-02-28 13:33:18,546 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9] [2019-02-28 13:33:18,610 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-28 13:33:18,611 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 13:33:27,919 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1997 treesize of output 1995 [2019-02-28 13:33:27,957 INFO L315 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,008 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1996 treesize of output 1994 [2019-02-28 13:33:28,060 INFO L315 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,093 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1995 treesize of output 1993 [2019-02-28 13:33:28,136 INFO L315 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,166 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1993 treesize of output 1991 [2019-02-28 13:33:28,201 INFO L315 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,245 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2000 treesize of output 1998 [2019-02-28 13:33:28,293 INFO L315 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,323 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1995 treesize of output 1993 [2019-02-28 13:33:28,347 INFO L315 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,402 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1995 treesize of output 1993 [2019-02-28 13:33:28,458 INFO L315 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,494 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1992 treesize of output 1990 [2019-02-28 13:33:28,539 INFO L315 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,578 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1994 treesize of output 1992 [2019-02-28 13:33:28,620 INFO L315 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,657 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2000 treesize of output 1998 [2019-02-28 13:33:28,700 INFO L315 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,738 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1994 treesize of output 1992 [2019-02-28 13:33:28,788 INFO L315 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,826 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1998 treesize of output 1996 [2019-02-28 13:33:28,852 INFO L315 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,871 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1990 treesize of output 1988 [2019-02-28 13:33:28,898 INFO L315 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,916 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1996 treesize of output 1994 [2019-02-28 13:33:28,941 INFO L315 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:28,963 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1994 treesize of output 1992 [2019-02-28 13:33:28,991 INFO L315 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:29,019 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1994 treesize of output 1992 [2019-02-28 13:33:29,047 INFO L315 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:29,066 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1997 treesize of output 1995 [2019-02-28 13:33:29,096 INFO L315 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:29,115 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1992 treesize of output 1990 [2019-02-28 13:33:29,143 INFO L315 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:29,164 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1999 treesize of output 1997 [2019-02-28 13:33:29,193 INFO L315 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:29,212 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1992 treesize of output 1990 [2019-02-28 13:33:29,242 INFO L315 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:29,262 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1997 treesize of output 1995 [2019-02-28 13:33:29,292 INFO L315 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:29,312 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1994 treesize of output 1992 [2019-02-28 13:33:29,344 INFO L315 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:29,363 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1997 treesize of output 1995 [2019-02-28 13:33:29,394 INFO L315 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:29,414 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1999 treesize of output 1997 [2019-02-28 13:33:29,448 INFO L315 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:29,487 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1992 treesize of output 1990 [2019-02-28 13:33:29,536 INFO L315 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:29,557 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1995 treesize of output 1993 [2019-02-28 13:33:29,591 INFO L315 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-02-28 13:33:29,613 INFO L442 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1997 treesize of output 1995 [2019-02-28 13:33:29,651 INFO L315 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts.