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/veris.c_NetBSD-libc__loop.i_2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-14 16:40:21,927 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-14 16:40:21,930 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-14 16:40:21,944 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-14 16:40:21,944 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-14 16:40:21,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-14 16:40:21,947 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-14 16:40:21,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-14 16:40:21,950 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-14 16:40:21,951 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-14 16:40:21,952 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-14 16:40:21,952 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-14 16:40:21,953 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-14 16:40:21,954 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-14 16:40:21,955 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-14 16:40:21,956 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-14 16:40:21,957 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-14 16:40:21,959 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-14 16:40:21,961 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-14 16:40:21,962 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-14 16:40:21,963 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-14 16:40:21,964 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-14 16:40:21,966 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-14 16:40:21,967 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-14 16:40:21,967 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-14 16:40:21,968 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-14 16:40:21,969 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-14 16:40:21,970 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-14 16:40:21,971 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-14 16:40:21,972 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-14 16:40:21,972 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-14 16:40:21,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-14 16:40:21,973 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-14 16:40:21,973 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-14 16:40:21,974 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-14 16:40:21,975 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-14 16:40:21,975 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-14 16:40:21,987 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-14 16:40:21,988 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-14 16:40:21,989 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-14 16:40:21,989 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-14 16:40:21,989 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-14 16:40:21,989 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-14 16:40:21,989 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-14 16:40:21,990 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-14 16:40:21,990 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-14 16:40:21,990 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-14 16:40:21,990 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-14 16:40:21,990 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-14 16:40:21,991 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-14 16:40:21,991 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-14 16:40:21,991 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-14 16:40:21,992 INFO L133 SettingsManager]: * Use SBE=true [2019-02-14 16:40:21,992 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-14 16:40:21,992 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-14 16:40:21,992 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-14 16:40:21,992 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-14 16:40:21,993 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-14 16:40:21,993 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-14 16:40:21,993 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-14 16:40:21,993 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-14 16:40:21,993 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-14 16:40:21,994 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-14 16:40:21,994 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-14 16:40:21,995 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-14 16:40:21,995 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-14 16:40:21,995 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-14 16:40:21,995 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:40:21,995 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-14 16:40:21,996 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-14 16:40:21,996 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-14 16:40:21,996 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-14 16:40:21,996 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-14 16:40:21,996 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-14 16:40:21,997 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-14 16:40:21,997 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-14 16:40:22,045 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-14 16:40:22,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-14 16:40:22,061 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-14 16:40:22,063 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-14 16:40:22,063 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-14 16:40:22,064 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/veris.c_NetBSD-libc__loop.i_2.bpl [2019-02-14 16:40:22,064 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/veris.c_NetBSD-libc__loop.i_2.bpl' [2019-02-14 16:40:22,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-14 16:40:22,115 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-14 16:40:22,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-14 16:40:22,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-14 16:40:22,117 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-14 16:40:22,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:40:22" (1/1) ... [2019-02-14 16:40:22,144 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:40:22" (1/1) ... [2019-02-14 16:40:22,153 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-14 16:40:22,154 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-14 16:40:22,154 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-14 16:40:22,154 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-14 16:40:22,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:40:22" (1/1) ... [2019-02-14 16:40:22,166 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:40:22" (1/1) ... [2019-02-14 16:40:22,167 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:40:22" (1/1) ... [2019-02-14 16:40:22,167 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:40:22" (1/1) ... [2019-02-14 16:40:22,172 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:40:22" (1/1) ... [2019-02-14 16:40:22,175 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:40:22" (1/1) ... [2019-02-14 16:40:22,176 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:40:22" (1/1) ... [2019-02-14 16:40:22,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-14 16:40:22,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-14 16:40:22,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-14 16:40:22,181 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-14 16:40:22,184 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:40:22" (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-02-14 16:40:22,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-14 16:40:22,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-14 16:40:22,634 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-14 16:40:22,635 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-02-14 16:40:22,636 INFO L202 PluginConnector]: Adding new model veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:40:22 BoogieIcfgContainer [2019-02-14 16:40:22,636 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-14 16:40:22,637 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-14 16:40:22,637 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-14 16:40:22,641 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-14 16:40:22,641 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:40:22" (1/2) ... [2019-02-14 16:40:22,643 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39c08fac and model type veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 04:40:22, skipping insertion in model container [2019-02-14 16:40:22,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "veris.c_NetBSD-libc__loop.i_2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:40:22" (2/2) ... [2019-02-14 16:40:22,646 INFO L112 eAbstractionObserver]: Analyzing ICFG veris.c_NetBSD-libc__loop.i_2.bpl [2019-02-14 16:40:22,656 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-14 16:40:22,666 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-14 16:40:22,683 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-14 16:40:22,721 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-14 16:40:22,722 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-14 16:40:22,722 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-14 16:40:22,722 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-14 16:40:22,722 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-14 16:40:22,722 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-14 16:40:22,723 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-14 16:40:22,723 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-14 16:40:22,738 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states. [2019-02-14 16:40:22,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-02-14 16:40:22,745 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:40:22,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-02-14 16:40:22,748 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:40:22,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:40:22,755 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2019-02-14 16:40:22,758 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:40:22,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:40:22,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:40:22,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:40:22,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:40:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:40:23,050 INFO L273 TraceCheckUtils]: 0: Hoare triple {10#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~tmp.base, ~tmp.offset := 0, 0;havoc main_#res;havoc main_#t~ret2, main_~#pathbuf~6.base, main_~#pathbuf~6.offset, main_~bound~6.base, main_~bound~6.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := 8;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_~#pathbuf~6.base, main_~#pathbuf~6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~bound~6.base, main_~bound~6.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 8 - 4;~tmp.base, ~tmp.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 8 - 4;glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base, glob2_#in~pathlim.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset, main_~bound~6.base, main_~bound~6.offset;havoc glob2_#res;havoc glob2_#t~post0.base, glob2_#t~post0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset, glob2_~pathlim.base, glob2_~pathlim.offset, glob2_~p~4.base, glob2_~p~4.offset;glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset;glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset;havoc glob2_~p~4.base, glob2_~p~4.offset;glob2_~p~4.base, glob2_~p~4.offset := glob2_~pathbuf.base, glob2_~pathbuf.offset; {12#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} is VALID [2019-02-14 16:40:23,072 INFO L273 TraceCheckUtils]: 1: Hoare triple {12#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {13#(= ULTIMATE.start___VERIFIER_assert_~cond 1)} is VALID [2019-02-14 16:40:23,087 INFO L273 TraceCheckUtils]: 2: Hoare triple {13#(= ULTIMATE.start___VERIFIER_assert_~cond 1)} assume __VERIFIER_assert_~cond == 0;assume !false; {11#false} is VALID [2019-02-14 16:40:23,088 INFO L273 TraceCheckUtils]: 3: Hoare triple {11#false} assume !false; {11#false} is VALID [2019-02-14 16:40:23,090 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-14 16:40:23,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:40:23,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-14 16:40:23,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:40:23,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-14 16:40:23,098 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:40:23,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:40:23,114 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:40:23,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:40:23,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:40:23,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:40:23,124 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 4 states. [2019-02-14 16:40:23,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:40:23,361 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2019-02-14 16:40:23,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-02-14 16:40:23,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-02-14 16:40:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:40:23,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:40:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-02-14 16:40:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:40:23,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2019-02-14 16:40:23,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 13 transitions. [2019-02-14 16:40:23,527 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:40:23,538 INFO L225 Difference]: With dead ends: 12 [2019-02-14 16:40:23,539 INFO L226 Difference]: Without dead ends: 8 [2019-02-14 16:40:23,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-14 16:40:23,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-02-14 16:40:23,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 7. [2019-02-14 16:40:23,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:40:23,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 7 states. [2019-02-14 16:40:23,593 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 7 states. [2019-02-14 16:40:23,593 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 7 states. [2019-02-14 16:40:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:40:23,595 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-14 16:40:23,596 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-14 16:40:23,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:40:23,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:40:23,597 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 8 states. [2019-02-14 16:40:23,597 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 8 states. [2019-02-14 16:40:23,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:40:23,599 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-02-14 16:40:23,599 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-02-14 16:40:23,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:40:23,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:40:23,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:40:23,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:40:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:40:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-02-14 16:40:23,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2019-02-14 16:40:23,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:40:23,604 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-02-14 16:40:23,604 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:40:23,604 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-02-14 16:40:23,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-14 16:40:23,604 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:40:23,605 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2019-02-14 16:40:23,605 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:40:23,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:40:23,605 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2019-02-14 16:40:23,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:40:23,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:40:23,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:40:23,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:40:23,607 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:40:23,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:40:24,126 INFO L273 TraceCheckUtils]: 0: Hoare triple {65#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~tmp.base, ~tmp.offset := 0, 0;havoc main_#res;havoc main_#t~ret2, main_~#pathbuf~6.base, main_~#pathbuf~6.offset, main_~bound~6.base, main_~bound~6.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;#Ultimate.alloc_~size := 8;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_~#pathbuf~6.base, main_~#pathbuf~6.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;main_~bound~6.base, main_~bound~6.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 8 - 4;~tmp.base, ~tmp.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset + 8 - 4;glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset, glob2_#in~pathlim.base, glob2_#in~pathlim.offset := main_~#pathbuf~6.base, main_~#pathbuf~6.offset, main_~bound~6.base, main_~bound~6.offset;havoc glob2_#res;havoc glob2_#t~post0.base, glob2_#t~post0.offset, glob2_~pathbuf.base, glob2_~pathbuf.offset, glob2_~pathlim.base, glob2_~pathlim.offset, glob2_~p~4.base, glob2_~p~4.offset;glob2_~pathbuf.base, glob2_~pathbuf.offset := glob2_#in~pathbuf.base, glob2_#in~pathbuf.offset;glob2_~pathlim.base, glob2_~pathlim.offset := glob2_#in~pathlim.base, glob2_#in~pathlim.offset;havoc glob2_~p~4.base, glob2_~p~4.offset;glob2_~p~4.base, glob2_~p~4.offset := glob2_~pathbuf.base, glob2_~pathbuf.offset; {67#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} is VALID [2019-02-14 16:40:24,128 INFO L273 TraceCheckUtils]: 1: Hoare triple {67#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {68#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (or (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} is VALID [2019-02-14 16:40:24,130 INFO L273 TraceCheckUtils]: 2: Hoare triple {68#(and (<= (+ ULTIMATE.start_glob2_~p~4.offset 4) ~tmp.offset) (or (= 0 ULTIMATE.start___VERIFIER_assert_~cond) (= ULTIMATE.start___VERIFIER_assert_~cond 1)) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} assume !(__VERIFIER_assert_~cond == 0);write~int_old_#memory_int := #memory_int;write~int_#value, write~int_#ptr.base, write~int_#ptr.offset, write~int_#sizeOfWrittenType := 1, glob2_~p~4.base, glob2_~p~4.offset, 4;havoc #memory_int;assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base,write~int_#ptr.offset := write~int_#value];glob2_#t~post0.base, glob2_#t~post0.offset := glob2_~p~4.base, glob2_~p~4.offset;glob2_~p~4.base, glob2_~p~4.offset := glob2_#t~post0.base, glob2_#t~post0.offset + 4;havoc glob2_#t~post0.base, glob2_#t~post0.offset; {69#(and (<= ULTIMATE.start_glob2_~p~4.offset ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} is VALID [2019-02-14 16:40:24,147 INFO L273 TraceCheckUtils]: 3: Hoare triple {69#(and (<= ULTIMATE.start_glob2_~p~4.offset ~tmp.offset) (= ~tmp.base ULTIMATE.start_glob2_~p~4.base))} assume !!(glob2_~p~4.base == glob2_~pathlim.base && glob2_~p~4.offset <= glob2_~pathlim.offset);__VERIFIER_assert_#in~cond := (if glob2_~p~4.base == ~tmp.base && glob2_~p~4.offset <= ~tmp.offset then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {70#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} is VALID [2019-02-14 16:40:24,161 INFO L273 TraceCheckUtils]: 4: Hoare triple {70#(not (= 0 ULTIMATE.start___VERIFIER_assert_~cond))} assume __VERIFIER_assert_~cond == 0;assume !false; {66#false} is VALID [2019-02-14 16:40:24,161 INFO L273 TraceCheckUtils]: 5: Hoare triple {66#false} assume !false; {66#false} is VALID [2019-02-14 16:40:24,162 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:40:24,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:40:24,163 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:40:24,164 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-14 16:40:24,166 INFO L207 CegarAbsIntRunner]: [0], [2], [6], [8], [10] [2019-02-14 16:40:24,224 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:40:24,225 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:40:47,176 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4104 treesize of output 4097 [2019-02-14 16:40:47,211 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:47,271 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4103 treesize of output 4096 [2019-02-14 16:40:47,305 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:47,350 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4102 treesize of output 4095 [2019-02-14 16:40:47,391 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:47,444 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4109 treesize of output 4102 [2019-02-14 16:40:47,476 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:47,535 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4106 treesize of output 4099 [2019-02-14 16:40:47,574 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:47,623 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4102 treesize of output 4095 [2019-02-14 16:40:47,660 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:47,709 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4107 treesize of output 4100 [2019-02-14 16:40:47,739 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:47,764 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4100 treesize of output 4093 [2019-02-14 16:40:47,799 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:47,826 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4104 treesize of output 4097 [2019-02-14 16:40:47,858 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:47,884 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4102 treesize of output 4095 [2019-02-14 16:40:47,918 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:47,943 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4104 treesize of output 4097 [2019-02-14 16:40:47,975 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,000 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4100 treesize of output 4093 [2019-02-14 16:40:48,037 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,062 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4098 treesize of output 4091 [2019-02-14 16:40:48,098 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,123 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4096 treesize of output 4089 [2019-02-14 16:40:48,160 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,192 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4102 treesize of output 4095 [2019-02-14 16:40:48,231 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,260 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4101 treesize of output 4094 [2019-02-14 16:40:48,302 INFO L267 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,334 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4105 treesize of output 4098 [2019-02-14 16:40:48,397 INFO L267 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,430 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4102 treesize of output 4095 [2019-02-14 16:40:48,474 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,502 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4098 treesize of output 4091 [2019-02-14 16:40:48,545 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,577 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4098 treesize of output 4091 [2019-02-14 16:40:48,621 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,651 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4105 treesize of output 4098 [2019-02-14 16:40:48,702 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,737 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4103 treesize of output 4096 [2019-02-14 16:40:48,782 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,812 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4100 treesize of output 4093 [2019-02-14 16:40:48,861 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,891 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4100 treesize of output 4093 [2019-02-14 16:40:48,938 INFO L267 ElimStorePlain]: Start of recursive call 25: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:48,972 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4107 treesize of output 4100 [2019-02-14 16:40:49,019 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:49,049 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4105 treesize of output 4098 [2019-02-14 16:40:49,099 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:49,133 INFO L478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 4100 treesize of output 4093 [2019-02-14 16:40:49,187 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 1 xjuncts.