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/matrix.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-1de736e-m [2019-02-14 16:37:19,092 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-14 16:37:19,094 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-14 16:37:19,110 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-14 16:37:19,111 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-14 16:37:19,112 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-14 16:37:19,113 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-14 16:37:19,115 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-14 16:37:19,116 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-14 16:37:19,117 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-14 16:37:19,118 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-14 16:37:19,118 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-14 16:37:19,119 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-14 16:37:19,120 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-14 16:37:19,121 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-14 16:37:19,122 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-14 16:37:19,123 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-14 16:37:19,125 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-14 16:37:19,127 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-14 16:37:19,129 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-14 16:37:19,130 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-14 16:37:19,131 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-14 16:37:19,134 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-14 16:37:19,134 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-14 16:37:19,134 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-14 16:37:19,135 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-14 16:37:19,136 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-14 16:37:19,137 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-14 16:37:19,138 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-14 16:37:19,139 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-14 16:37:19,139 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-14 16:37:19,140 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-14 16:37:19,140 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-14 16:37:19,140 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-14 16:37:19,141 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-14 16:37:19,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-14 16:37:19,142 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:37:19,165 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-14 16:37:19,165 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-14 16:37:19,166 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-14 16:37:19,166 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-14 16:37:19,166 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-14 16:37:19,166 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-14 16:37:19,167 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-14 16:37:19,167 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-14 16:37:19,167 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-14 16:37:19,167 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-02-14 16:37:19,167 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-14 16:37:19,168 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-14 16:37:19,168 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-14 16:37:19,168 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-14 16:37:19,169 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-14 16:37:19,169 INFO L133 SettingsManager]: * Use SBE=true [2019-02-14 16:37:19,169 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-14 16:37:19,169 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-14 16:37:19,169 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-14 16:37:19,170 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-14 16:37:19,170 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-14 16:37:19,170 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-14 16:37:19,170 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-14 16:37:19,170 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-14 16:37:19,171 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-14 16:37:19,171 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-14 16:37:19,171 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-14 16:37:19,171 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-14 16:37:19,171 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-14 16:37:19,172 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-14 16:37:19,172 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-02-14 16:37:19,172 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-14 16:37:19,172 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-14 16:37:19,172 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-14 16:37:19,173 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-14 16:37:19,173 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-14 16:37:19,173 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-02-14 16:37:19,173 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-14 16:37:19,173 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-14 16:37:19,222 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-14 16:37:19,237 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-14 16:37:19,243 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-14 16:37:19,245 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-14 16:37:19,245 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-14 16:37:19,246 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/matrix.i_4.bpl [2019-02-14 16:37:19,247 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/matrix.i_4.bpl' [2019-02-14 16:37:19,308 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-14 16:37:19,310 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-14 16:37:19,311 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-14 16:37:19,311 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-14 16:37:19,311 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-14 16:37:19,329 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:19" (1/1) ... [2019-02-14 16:37:19,344 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:19" (1/1) ... [2019-02-14 16:37:19,354 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-14 16:37:19,355 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-14 16:37:19,355 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-14 16:37:19,355 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-14 16:37:19,367 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:19" (1/1) ... [2019-02-14 16:37:19,367 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:19" (1/1) ... [2019-02-14 16:37:19,368 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:19" (1/1) ... [2019-02-14 16:37:19,369 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:19" (1/1) ... [2019-02-14 16:37:19,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:19" (1/1) ... [2019-02-14 16:37:19,377 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:19" (1/1) ... [2019-02-14 16:37:19,378 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:19" (1/1) ... [2019-02-14 16:37:19,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-14 16:37:19,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-14 16:37:19,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-14 16:37:19,382 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-14 16:37:19,383 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:19" (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:37:19,450 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-14 16:37:19,451 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-14 16:37:20,006 INFO L695 $ProcedureCfgBuilder]: dead code at ProgramPoint ULTIMATE.startFINAL: assume true; [2019-02-14 16:37:20,007 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-14 16:37:20,007 INFO L286 CfgBuilder]: Removed 2 assue(true) statements. [2019-02-14 16:37:20,010 INFO L202 PluginConnector]: Adding new model matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:37:20 BoogieIcfgContainer [2019-02-14 16:37:20,010 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-14 16:37:20,011 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-02-14 16:37:20,011 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-02-14 16:37:20,014 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-02-14 16:37:20,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.02 04:37:19" (1/2) ... [2019-02-14 16:37:20,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e2fd1c and model type matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.02 04:37:20, skipping insertion in model container [2019-02-14 16:37:20,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.02 04:37:20" (2/2) ... [2019-02-14 16:37:20,019 INFO L112 eAbstractionObserver]: Analyzing ICFG matrix.i_4.bpl [2019-02-14 16:37:20,030 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-02-14 16:37:20,038 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-02-14 16:37:20,056 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-02-14 16:37:20,093 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-02-14 16:37:20,093 INFO L383 AbstractCegarLoop]: Hoare is true [2019-02-14 16:37:20,093 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-02-14 16:37:20,094 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-02-14 16:37:20,094 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-02-14 16:37:20,094 INFO L387 AbstractCegarLoop]: Difference is false [2019-02-14 16:37:20,094 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-02-14 16:37:20,094 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-02-14 16:37:20,109 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-02-14 16:37:20,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-02-14 16:37:20,115 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:37:20,116 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-02-14 16:37:20,119 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:37:20,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:37:20,125 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-02-14 16:37:20,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:37:20,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:37:20,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:37:20,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:37:20,173 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:37:20,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:37:20,479 INFO L273 TraceCheckUtils]: 0: Hoare triple {8#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {10#(and (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~N_COL~5) (<= (div ULTIMATE.start_main_~N_COL~5 4294967296) (div ULTIMATE.start_main_~j~5 4294967296)))} is VALID [2019-02-14 16:37:20,482 INFO L273 TraceCheckUtils]: 1: Hoare triple {10#(and (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~N_COL~5) (<= (div ULTIMATE.start_main_~N_COL~5 4294967296) (div ULTIMATE.start_main_~j~5 4294967296)))} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {9#false} is VALID [2019-02-14 16:37:20,482 INFO L273 TraceCheckUtils]: 2: Hoare triple {9#false} assume !false; {9#false} is VALID [2019-02-14 16:37:20,487 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:37:20,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:37:20,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-02-14 16:37:20,490 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:37:20,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-14 16:37:20,496 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:37:20,500 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2019-02-14 16:37:20,539 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-14 16:37:20,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-02-14 16:37:20,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-02-14 16:37:20,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:37:20,553 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-02-14 16:37:20,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:37:20,710 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2019-02-14 16:37:20,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-02-14 16:37:20,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-02-14 16:37:20,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:37:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:37:20,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-14 16:37:20,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-02-14 16:37:20,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-02-14 16:37:20,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 17 transitions. [2019-02-14 16:37:20,793 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:37:20,805 INFO L225 Difference]: With dead ends: 11 [2019-02-14 16:37:20,806 INFO L226 Difference]: Without dead ends: 7 [2019-02-14 16:37:20,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-02-14 16:37:20,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-14 16:37:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 6. [2019-02-14 16:37:20,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:37:20,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 6 states. [2019-02-14 16:37:20,924 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 6 states. [2019-02-14 16:37:20,924 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 6 states. [2019-02-14 16:37:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:37:20,926 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-02-14 16:37:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-14 16:37:20,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:37:20,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:37:20,927 INFO L74 IsIncluded]: Start isIncluded. First operand 6 states. Second operand 7 states. [2019-02-14 16:37:20,927 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 7 states. [2019-02-14 16:37:20,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:37:20,929 INFO L93 Difference]: Finished difference Result 7 states and 9 transitions. [2019-02-14 16:37:20,929 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 9 transitions. [2019-02-14 16:37:20,930 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:37:20,930 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:37:20,930 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:37:20,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:37:20,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-02-14 16:37:20,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2019-02-14 16:37:20,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 7 transitions. Word has length 3 [2019-02-14 16:37:20,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:37:20,934 INFO L480 AbstractCegarLoop]: Abstraction has 6 states and 7 transitions. [2019-02-14 16:37:20,934 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-02-14 16:37:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 7 transitions. [2019-02-14 16:37:20,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-02-14 16:37:20,935 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:37:20,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-02-14 16:37:20,935 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:37:20,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:37:20,936 INFO L82 PathProgramCache]: Analyzing trace with hash 28852267, now seen corresponding path program 1 times [2019-02-14 16:37:20,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:37:20,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:37:20,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:37:20,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:37:20,937 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:37:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:37:21,298 INFO L273 TraceCheckUtils]: 0: Hoare triple {56#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {58#(and (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) 0) (<= 1 ULTIMATE.start_main_~N_LIN~5))} is VALID [2019-02-14 16:37:21,300 INFO L273 TraceCheckUtils]: 1: Hoare triple {58#(and (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) 0) (<= 1 ULTIMATE.start_main_~N_LIN~5))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {59#(and (<= (+ ULTIMATE.start_main_~k~5 1) ULTIMATE.start_main_~N_LIN~5) (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) (div ULTIMATE.start_main_~k~5 4294967296)))} is VALID [2019-02-14 16:37:21,310 INFO L273 TraceCheckUtils]: 2: Hoare triple {59#(and (<= (+ ULTIMATE.start_main_~k~5 1) ULTIMATE.start_main_~N_LIN~5) (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) (div ULTIMATE.start_main_~k~5 4294967296)))} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {57#false} is VALID [2019-02-14 16:37:21,310 INFO L273 TraceCheckUtils]: 3: Hoare triple {57#false} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {57#false} is VALID [2019-02-14 16:37:21,311 INFO L273 TraceCheckUtils]: 4: Hoare triple {57#false} assume !false; {57#false} is VALID [2019-02-14 16:37:21,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-02-14 16:37:21,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-02-14 16:37:21,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-02-14 16:37:21,312 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-02-14 16:37:21,314 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-14 16:37:21,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:37:21,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2019-02-14 16:37:21,351 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:37:21,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-02-14 16:37:21,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-02-14 16:37:21,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-02-14 16:37:21,352 INFO L87 Difference]: Start difference. First operand 6 states and 7 transitions. Second operand 4 states. [2019-02-14 16:37:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:37:21,551 INFO L93 Difference]: Finished difference Result 11 states and 14 transitions. [2019-02-14 16:37:21,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-02-14 16:37:21,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2019-02-14 16:37:21,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:37:21,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:37:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-14 16:37:21,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-02-14 16:37:21,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions. [2019-02-14 16:37:21,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions. [2019-02-14 16:37:21,597 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:37:21,598 INFO L225 Difference]: With dead ends: 11 [2019-02-14 16:37:21,598 INFO L226 Difference]: Without dead ends: 7 [2019-02-14 16:37:21,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-02-14 16:37:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-02-14 16:37:21,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-02-14 16:37:21,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:37:21,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2019-02-14 16:37:21,652 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-14 16:37:21,652 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-14 16:37:21,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:37:21,653 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-02-14 16:37:21,654 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-14 16:37:21,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:37:21,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:37:21,655 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2019-02-14 16:37:21,655 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2019-02-14 16:37:21,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:37:21,656 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2019-02-14 16:37:21,657 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-14 16:37:21,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:37:21,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:37:21,657 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:37:21,657 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:37:21,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:37:21,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2019-02-14 16:37:21,659 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2019-02-14 16:37:21,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:37:21,659 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2019-02-14 16:37:21,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-02-14 16:37:21,659 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2019-02-14 16:37:21,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-02-14 16:37:21,660 INFO L394 BasicCegarLoop]: Found error trace [2019-02-14 16:37:21,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-02-14 16:37:21,660 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-02-14 16:37:21,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:37:21,660 INFO L82 PathProgramCache]: Analyzing trace with hash 894489354, now seen corresponding path program 1 times [2019-02-14 16:37:21,661 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-02-14 16:37:21,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:37:21,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:37:21,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-02-14 16:37:21,662 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-02-14 16:37:21,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:37:22,121 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 9 [2019-02-14 16:37:22,658 WARN L181 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 17 [2019-02-14 16:37:22,829 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} is VALID [2019-02-14 16:37:22,831 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {112#(and (= ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296))) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (= (+ ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~k~5 4294967296))) (+ ULTIMATE.start_main_~k~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296)))))} is VALID [2019-02-14 16:37:22,834 INFO L273 TraceCheckUtils]: 2: Hoare triple {112#(and (= ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296))) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (= (+ ULTIMATE.start_main_~j~5 (* 4294967296 (div ULTIMATE.start_main_~k~5 4294967296))) (+ ULTIMATE.start_main_~k~5 (* 4294967296 (div ULTIMATE.start_main_~j~5 4294967296)))))} assume !!(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~matriz~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296 := main_#t~nondet3];havoc main_#t~nondet3;assume main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296] >= main_~maior~5;main_~maior~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296];main_#t~post2 := main_~k~5;main_~k~5 := main_#t~post2 + 1;havoc main_#t~post2; {113#(and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)))} is VALID [2019-02-14 16:37:22,835 INFO L273 TraceCheckUtils]: 3: Hoare triple {113#(and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)))} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-02-14 16:37:22,836 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {110#false} is VALID [2019-02-14 16:37:22,837 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#false} assume !false; {110#false} is VALID [2019-02-14 16:37:22,838 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:37:22,838 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:37:22,839 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-02-14 16:37:22,840 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 7 with the following transitions: [2019-02-14 16:37:22,842 INFO L207 CegarAbsIntRunner]: [0], [5], [7], [9], [15], [17] [2019-02-14 16:37:22,900 INFO L148 AbstractInterpreter]: Using domain ArrayDomain [2019-02-14 16:37:22,901 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-14 16:37:23,346 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-02-14 16:37:28,153 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 339 treesize of output 321 [2019-02-14 16:37:28,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:30,030 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-14 16:37:30,033 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:30,281 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-14 16:37:30,284 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:30,526 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-14 16:37:30,529 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:30,741 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-14 16:37:30,744 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:31,173 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-14 16:37:31,183 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:31,277 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:37:31,277 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:7855, output treesize:179 [2019-02-14 16:37:38,168 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 339 treesize of output 321 [2019-02-14 16:37:38,180 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:39,882 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-14 16:37:39,884 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:40,423 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2019-02-14 16:37:40,431 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:40,570 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-14 16:37:40,573 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:40,822 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-14 16:37:40,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:40,930 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:37:40,931 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:7865, output treesize:180 [2019-02-14 16:37:41,397 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 329 treesize of output 311 [2019-02-14 16:37:41,411 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:42,781 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2019-02-14 16:37:42,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:42,950 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 41 [2019-02-14 16:37:42,954 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:37:43,499 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:37:43,500 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:6552, output treesize:178 [2019-02-14 16:37:59,414 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 334 treesize of output 316 [2019-02-14 16:37:59,427 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:00,923 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2019-02-14 16:38:00,927 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:01,337 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:38:01,341 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:01,516 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-14 16:38:01,519 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:01,789 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2019-02-14 16:38:01,792 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:01,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:38:01,973 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:5111, output treesize:180 [2019-02-14 16:38:02,407 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 377 treesize of output 359 [2019-02-14 16:38:02,421 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:04,515 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2019-02-14 16:38:04,518 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:04,703 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2019-02-14 16:38:04,705 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:04,869 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2019-02-14 16:38:04,872 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:04,988 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 39 [2019-02-14 16:38:04,991 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:05,097 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 35 [2019-02-14 16:38:05,101 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:05,312 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:38:05,312 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:8881, output treesize:150 [2019-02-14 16:38:12,330 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:38:12,343 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:14,576 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:38:14,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:14,791 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:38:14,795 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:15,184 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:38:15,195 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:15,373 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:38:15,375 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:15,524 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:38:15,526 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:15,703 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:38:15,704 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:5673, output treesize:196 [2019-02-14 16:38:17,228 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:38:17,243 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:19,581 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:38:19,587 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:20,102 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-02-14 16:38:20,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:20,262 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:38:20,265 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:20,404 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:38:20,408 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:20,533 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:38:20,536 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:20,626 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:38:20,627 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:11092, output treesize:197 [2019-02-14 16:38:21,085 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 399 treesize of output 381 [2019-02-14 16:38:21,097 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:23,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:38:23,003 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:23,638 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:38:23,639 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:4722, output treesize:221 [2019-02-14 16:38:26,284 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:38:26,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:28,644 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:38:28,647 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:28,853 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-02-14 16:38:28,857 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:29,055 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:38:29,064 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:29,229 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:38:29,232 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:29,367 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:38:29,371 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:29,647 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:38:29,647 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:13309, output treesize:195 [2019-02-14 16:38:30,326 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:38:30,336 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:32,767 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-14 16:38:32,769 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:33,015 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:38:33,018 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:33,237 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:38:33,240 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:33,395 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:38:33,398 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:33,743 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:38:33,743 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:13309, output treesize:195 [2019-02-14 16:38:35,289 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:38:35,300 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:37,370 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:38:37,376 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:37,561 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:38:37,564 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:37,743 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:38:37,746 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:38,091 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:38:38,095 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:38,879 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:38:38,882 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:38,972 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:38:38,973 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:5673, output treesize:195 [2019-02-14 16:38:41,161 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:38:41,172 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:43,497 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:38:43,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:44,053 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-02-14 16:38:44,061 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:44,242 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:38:44,245 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:44,509 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:38:44,512 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:38:44,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:38:44,601 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:13309, output treesize:196 [2019-02-14 16:38:44,627 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:38:44,628 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_83, v_prenex_80, v_v_316_1, v_prenex_78, v_prenex_81, v_prenex_84, v_prenex_79, v_prenex_82]. (let ((.cse108 (select (select ULTIMATE.start_main_~matriz~5 v_idx_181) v_idx_177))) (let ((.cse95 (* 2 ULTIMATE.start_main_~N_LIN~5)) (.cse100 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~j~5)) (.cse103 (* 2 ULTIMATE.start_main_~k~5)) (.cse98 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse102 (+ ULTIMATE.start_main_~k~5 1)) (.cse106 (+ ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~N_COL~5)) (.cse105 (+ ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse96 (* 2 ULTIMATE.start_main_~j~5)) (.cse94 (- ULTIMATE.start_main_~k~5)) (.cse104 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse99 (- ULTIMATE.start_main_~N_COL~5)) (.cse93 (- ULTIMATE.start_main_~N_LIN~5)) (.cse97 (- ULTIMATE.start_main_~j~5)) (.cse101 (+ ULTIMATE.start_main_~j~5 1)) (.cse107 (+ ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~N_LIN~5)) (.cse109 (+ .cse108 2147483649))) (let ((.cse72 (<= 0 (+ .cse108 ULTIMATE.start_main_~N_COL~5 2147483647))) (.cse73 (<= ULTIMATE.start_main_~j~5 (+ .cse108 2147483648))) (.cse74 (<= ULTIMATE.start_main_~N_COL~5 .cse109)) (.cse75 (<= ULTIMATE.start_main_~N_LIN~5 .cse109)) (.cse76 (<= 0 (+ .cse108 ULTIMATE.start_main_~j~5 2147483648))) (.cse77 (<= 0 (+ (* 2 .cse108) 4294967296))) (.cse78 (<= ULTIMATE.start_main_~k~5 .cse109)) (.cse79 (<= 0 (+ .cse108 ULTIMATE.start_main_~N_LIN~5 2147483647))) (.cse80 (<= 0 (+ .cse108 ULTIMATE.start_main_~k~5 2147483648))) (.cse69 (< (+ ULTIMATE.start_main_~j~5 v_idx_177) 0)) (.cse13 (< (+ v_idx_181 ULTIMATE.start_main_~k~5) 1)) (.cse35 (<= 2 (+ ULTIMATE.start_main_~N_LIN~5 v_idx_177))) (.cse0 (<= 1 .cse107)) (.cse1 (<= ULTIMATE.start_main_~k~5 .cse101)) (.cse2 (<= (- ULTIMATE.start_main_~j~5 .cse97) 0)) (.cse3 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse4 (<= (- .cse97 ULTIMATE.start_main_~j~5) 0)) (.cse5 (<= (- .cse93 .cse97) (- 1))) (.cse6 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5) 0)) (.cse7 (<= (- .cse99 ULTIMATE.start_main_~j~5) (- 1))) (.cse8 (<= (- .cse93 ULTIMATE.start_main_~j~5) (- 1))) (.cse9 (<= (- ULTIMATE.start_main_~N_COL~5 .cse99) 2)) (.cse10 (<= .cse104 2)) (.cse11 (<= (- .cse97 ULTIMATE.start_main_~k~5) 0)) (.cse12 (<= (- ULTIMATE.start_main_~j~5 .cse94) 1)) (.cse14 (<= 0 .cse96)) (.cse15 (<= .cse105 2)) (.cse16 (<= (- .cse99 ULTIMATE.start_main_~k~5) (- 1))) (.cse17 (<= .cse106 1)) (.cse18 (<= (- ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5) 0)) (.cse19 (<= ULTIMATE.start_main_~N_COL~5 .cse101)) (.cse20 (<= (- .cse94 ULTIMATE.start_main_~k~5) 0)) (.cse21 (<= ULTIMATE.start_main_~N_COL~5 .cse102)) (.cse22 (<= .cse101 ULTIMATE.start_main_~N_COL~5)) (.cse23 (<= (- ULTIMATE.start_main_~k~5 .cse94) 2)) (.cse66 (<= 2 (+ v_idx_181 ULTIMATE.start_main_~N_LIN~5))) (.cse24 (<= (- ULTIMATE.start_main_~N_COL~5 .cse93) 2)) (.cse25 (<= .cse107 1)) (.cse26 (<= 1 .cse98)) (.cse27 (<= (- .cse93 ULTIMATE.start_main_~k~5) (- 1))) (.cse68 (<= 0 (+ ULTIMATE.start_main_~j~5 v_idx_176))) (.cse28 (<= 1 .cse106)) (.cse29 (<= (- .cse99 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse30 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse94) 2)) (.cse31 (<= ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse32 (<= .cse103 2)) (.cse33 (<= (- .cse99 .cse94) 0)) (.cse34 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse36 (<= (- ULTIMATE.start_main_~N_COL~5 .cse97) 1)) (.cse37 (<= 2 .cse105)) (.cse38 (<= 1 .cse104)) (.cse39 (<= ULTIMATE.start_main_~N_LIN~5 .cse101)) (.cse40 (<= (- ULTIMATE.start_main_~N_COL~5 .cse94) 2)) (.cse41 (<= 0 .cse100)) (.cse42 (<= (- .cse99 ULTIMATE.start_main_~N_COL~5) (- 2))) (.cse43 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse93) 2)) (.cse44 (<= 0 .cse103)) (.cse45 (<= ULTIMATE.start_main_~N_LIN~5 .cse102)) (.cse46 (<= .cse101 ULTIMATE.start_main_~N_LIN~5)) (.cse47 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~k~5) 1)) (.cse48 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~j~5) 1)) (.cse49 (<= .cse100 1)) (.cse50 (<= (- .cse99 .cse97) (- 1))) (.cse51 (<= .cse95 2)) (.cse52 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse97) 1)) (.cse53 (<= (- .cse99 .cse93) 0)) (.cse54 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse55 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~k~5) 1)) (.cse56 (<= .cse98 2)) (.cse57 (<= (- .cse93 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse58 (<= (- .cse97 .cse94) 1)) (.cse59 (<= .cse96 0)) (.cse60 (<= 2 .cse95)) (.cse61 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5)) (.cse62 (<= (- .cse93 .cse94) 0)) (.cse63 (<= ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5)) (.cse64 (< (+ ULTIMATE.start_main_~N_LIN~5 v_idx_178) 2))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (let ((.cse65 (select v_prenex_80 v_idx_177))) (let ((.cse67 (+ .cse65 2147483649))) (and .cse0 .cse1 (<= 0 (+ .cse65 ULTIMATE.start_main_~j~5 2147483648)) .cse2 .cse3 .cse4 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse65 2147483648)) .cse5 .cse6 (<= 0 (+ .cse65 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse7 (<= ULTIMATE.start_main_~j~5 (+ .cse65 2147483648)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse66 .cse24 .cse25 .cse26 (<= ULTIMATE.start_main_~N_COL~5 .cse67) .cse27 .cse68 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 (<= ULTIMATE.start_main_~N_LIN~5 .cse67) .cse57 .cse58 (<= 0 (+ .cse65 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse59 .cse60 (<= ULTIMATE.start_main_~k~5 .cse67) (<= 0 (+ (* 2 .cse65) 4294967296)) .cse61 .cse62 .cse63))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse69 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse68 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse69 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (let ((.cse71 (select v_v_316_1 v_idx_177))) (let ((.cse70 (+ .cse71 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= ULTIMATE.start_main_~N_COL~5 .cse70) (<= 0 (+ .cse71 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 0 (+ .cse71 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 (<= 0 (+ .cse71 ULTIMATE.start_main_~j~5 2147483648)) .cse39 .cse40 .cse41 .cse42 (<= ULTIMATE.start_main_~k~5 .cse70) .cse43 .cse44 (<= 0 (+ (* 2 .cse71) 4294967296)) .cse45 .cse46 (<= ULTIMATE.start_main_~j~5 (+ .cse71 2147483648)) .cse47 .cse48 (<= ULTIMATE.start_main_~N_LIN~5 .cse70) (<= 0 (+ ULTIMATE.start_main_~k~5 .cse71 2147483648)) .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse68 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse69 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse68 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse72 .cse6 .cse73 .cse7 .cse74 .cse8 .cse9 .cse10 .cse11 .cse75 .cse76 .cse12 .cse77 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse78 .cse24 .cse25 .cse26 .cse27 .cse79 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse80 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse69 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse68 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse66 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse69 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse69 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse66 .cse24 .cse25 .cse26 .cse27 .cse68 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (let ((.cse81 (select v_prenex_83 v_idx_177))) (let ((.cse82 (+ .cse81 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse81 2147483648)) .cse24 (<= ULTIMATE.start_main_~N_COL~5 .cse82) .cse25 .cse26 (<= 0 (+ (* 2 .cse81) 4294967296)) .cse27 .cse68 (<= ULTIMATE.start_main_~k~5 .cse82) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 (<= 0 (+ .cse81 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 (<= ULTIMATE.start_main_~N_LIN~5 .cse82) .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 (<= 0 (+ .cse81 ULTIMATE.start_main_~N_LIN~5 2147483647)) (<= 0 (+ .cse81 ULTIMATE.start_main_~j~5 2147483648)) .cse59 .cse60 .cse61 .cse62 .cse63 (<= ULTIMATE.start_main_~j~5 (+ .cse81 2147483648)) .cse64))) (let ((.cse84 (select v_prenex_78 v_idx_177))) (let ((.cse83 (+ .cse84 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= ULTIMATE.start_main_~N_LIN~5 .cse83) .cse8 .cse9 .cse10 .cse11 (<= 0 (+ .cse84 ULTIMATE.start_main_~j~5 2147483648)) .cse12 (<= ULTIMATE.start_main_~N_COL~5 .cse83) .cse14 .cse15 .cse16 .cse17 .cse18 (<= ULTIMATE.start_main_~k~5 .cse83) .cse19 (<= 0 (+ .cse84 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse20 .cse21 .cse22 .cse23 .cse66 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse84 2147483648)) .cse37 (<= 0 (+ .cse84 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 (<= 0 (+ (* 2 .cse84) 4294967296)) (<= ULTIMATE.start_main_~j~5 (+ .cse84 2147483648)) .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse66 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse68 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (let ((.cse85 (select v_prenex_81 v_idx_177))) (let ((.cse86 (+ .cse85 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (<= ULTIMATE.start_main_~j~5 (+ .cse85 2147483648)) .cse13 .cse14 .cse15 .cse16 (<= 0 (+ .cse85 ULTIMATE.start_main_~N_LIN~5 2147483647)) (<= 0 (+ .cse85 ULTIMATE.start_main_~j~5 2147483648)) .cse17 .cse18 (<= ULTIMATE.start_main_~k~5 .cse86) .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (<= 0 (+ (* 2 .cse85) 4294967296)) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 (<= ULTIMATE.start_main_~N_LIN~5 .cse86) .cse43 .cse44 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse85 2147483648)) .cse45 .cse46 .cse47 .cse48 .cse49 (<= ULTIMATE.start_main_~N_COL~5 .cse86) .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 (<= 0 (+ .cse85 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse72 .cse6 .cse73 .cse7 .cse74 .cse8 .cse9 .cse10 .cse75 .cse76 .cse11 .cse12 .cse77 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse78 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse79 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse80 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (let ((.cse87 (select v_prenex_84 v_idx_177))) (let ((.cse88 (+ .cse87 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 (+ .cse87 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse5 .cse6 .cse7 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse87 2147483648)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse66 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 (<= ULTIMATE.start_main_~N_LIN~5 .cse88) .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 (<= ULTIMATE.start_main_~N_COL~5 .cse88) .cse55 .cse56 (<= ULTIMATE.start_main_~j~5 (+ .cse87 2147483648)) .cse57 .cse58 (<= ULTIMATE.start_main_~k~5 .cse88) (<= 0 (+ .cse87 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse59 .cse60 .cse61 .cse62 (<= 0 (+ .cse87 ULTIMATE.start_main_~j~5 2147483648)) .cse63 (<= 0 (+ (* 2 .cse87) 4294967296))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (let ((.cse90 (select v_prenex_79 v_idx_177))) (let ((.cse89 (+ .cse90 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~N_COL~5 .cse89) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= ULTIMATE.start_main_~N_LIN~5 .cse89) (<= 0 (+ .cse90 ULTIMATE.start_main_~j~5 2147483648)) .cse20 (<= ULTIMATE.start_main_~j~5 (+ .cse90 2147483648)) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse68 (<= ULTIMATE.start_main_~k~5 .cse89) .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse90 2147483648)) .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 (<= 0 (+ (* 2 .cse90) 4294967296)) .cse59 .cse60 .cse61 (<= 0 (+ .cse90 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse62 .cse63 (<= 0 (+ .cse90 ULTIMATE.start_main_~N_LIN~5 2147483647))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse72 .cse6 .cse73 .cse7 .cse74 .cse8 .cse9 .cse10 .cse11 .cse75 .cse76 .cse12 .cse77 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse78 .cse24 .cse25 .cse26 .cse27 .cse68 .cse79 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse80 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse66 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse69 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse69 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse66 .cse24 .cse25 .cse26 .cse27 .cse68 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse68 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse69 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse66 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse66 .cse24 .cse25 .cse26 .cse27 .cse68 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse69 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse66 .cse24 .cse25 .cse26 .cse27 .cse68 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse69 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse72 .cse6 .cse73 .cse7 .cse74 .cse8 .cse9 .cse10 .cse11 .cse75 .cse76 .cse12 .cse77 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse78 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse68 .cse79 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse80 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse68 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse69 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse68 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse35 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63) (let ((.cse92 (select v_prenex_82 v_idx_177))) (let ((.cse91 (+ .cse92 2147483649))) (and .cse0 .cse1 (<= ULTIMATE.start_main_~k~5 .cse91) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= ULTIMATE.start_main_~N_LIN~5 .cse91) .cse10 .cse11 (<= ULTIMATE.start_main_~N_COL~5 .cse91) .cse12 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= ULTIMATE.start_main_~j~5 (+ .cse92 2147483648)) .cse22 .cse23 .cse66 .cse24 .cse25 .cse26 .cse27 .cse68 .cse28 .cse29 .cse30 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse92 2147483648)) .cse31 .cse32 .cse33 .cse34 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 (<= 0 (+ (* 2 .cse92) 4294967296)) .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 (<= 0 (+ .cse92 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 (<= 0 (+ .cse92 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse61 .cse62 .cse63 (<= 0 (+ .cse92 ULTIMATE.start_main_~j~5 2147483648)) .cse64))))))) [2019-02-14 16:38:44,630 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse6 (- ULTIMATE.start_main_~N_LIN~5))) (let ((.cse0 (<= (- (- ULTIMATE.start_main_~N_COL~5) .cse6) 0)) (.cse1 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse2 (<= (* 2 ULTIMATE.start_main_~j~5) 0)) (.cse3 (<= 2 (* 2 ULTIMATE.start_main_~N_LIN~5))) (.cse4 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5)) (.cse5 (<= (- .cse6 (- ULTIMATE.start_main_~k~5)) 0))) (or (and .cse0 .cse1 .cse2 (<= 2 (+ ULTIMATE.start_main_~N_LIN~5 v_idx_177)) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 (+ (select (select ULTIMATE.start_main_~matriz~5 v_idx_181) v_idx_177) ULTIMATE.start_main_~N_LIN~5 2147483647))) (and .cse0 .cse1 (< (+ v_idx_181 ULTIMATE.start_main_~k~5) 1) .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= 2 (+ v_idx_181 ULTIMATE.start_main_~N_LIN~5)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (+ ULTIMATE.start_main_~j~5 v_idx_177) 0))))) [2019-02-14 16:39:02,518 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:39:02,529 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:04,752 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:39:04,755 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:05,090 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:39:05,098 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:05,368 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:39:05,371 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:05,643 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:39:05,643 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:4393, output treesize:196 [2019-02-14 16:39:05,661 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:39:05,662 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_v_316_1, v_prenex_87, v_prenex_88, v_prenex_89, v_prenex_90, v_prenex_85, v_prenex_86, v_prenex_91]. (let ((.cse86 (* 2 ULTIMATE.start_main_~N_LIN~5)) (.cse91 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~j~5)) (.cse94 (* 2 ULTIMATE.start_main_~k~5)) (.cse89 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse93 (+ ULTIMATE.start_main_~k~5 1)) (.cse97 (+ ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~N_COL~5)) (.cse96 (+ ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse87 (* 2 ULTIMATE.start_main_~j~5)) (.cse85 (- ULTIMATE.start_main_~k~5)) (.cse95 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse90 (- ULTIMATE.start_main_~N_COL~5)) (.cse84 (- ULTIMATE.start_main_~N_LIN~5)) (.cse88 (- ULTIMATE.start_main_~j~5)) (.cse92 (+ ULTIMATE.start_main_~j~5 1)) (.cse98 (+ ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~N_LIN~5))) (let ((.cse65 (< (+ v_idx_208 ULTIMATE.start_main_~N_LIN~5) 2)) (.cse7 (<= 2 (+ ULTIMATE.start_main_~N_LIN~5 v_idx_211))) (.cse0 (<= 1 .cse98)) (.cse1 (<= ULTIMATE.start_main_~k~5 .cse92)) (.cse2 (<= (- ULTIMATE.start_main_~j~5 .cse88) 0)) (.cse3 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse4 (<= (- .cse88 ULTIMATE.start_main_~j~5) 0)) (.cse5 (<= (- .cse84 .cse88) (- 1))) (.cse6 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5) 0)) (.cse67 (< (+ ULTIMATE.start_main_~k~5 v_idx_211) 1)) (.cse8 (<= (- .cse90 ULTIMATE.start_main_~j~5) (- 1))) (.cse9 (<= (- .cse84 ULTIMATE.start_main_~j~5) (- 1))) (.cse10 (<= (- ULTIMATE.start_main_~N_COL~5 .cse90) 2)) (.cse11 (<= .cse95 2)) (.cse12 (<= (- .cse88 ULTIMATE.start_main_~k~5) 0)) (.cse13 (<= (- ULTIMATE.start_main_~j~5 .cse85) 1)) (.cse14 (<= 0 .cse87)) (.cse15 (<= .cse96 2)) (.cse16 (<= (- .cse90 ULTIMATE.start_main_~k~5) (- 1))) (.cse17 (<= .cse97 1)) (.cse18 (<= (- ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5) 0)) (.cse20 (<= ULTIMATE.start_main_~N_COL~5 .cse92)) (.cse21 (<= (- .cse85 ULTIMATE.start_main_~k~5) 0)) (.cse22 (<= ULTIMATE.start_main_~N_COL~5 .cse93)) (.cse23 (<= .cse92 ULTIMATE.start_main_~N_COL~5)) (.cse24 (<= (- ULTIMATE.start_main_~k~5 .cse85) 2)) (.cse25 (<= (- ULTIMATE.start_main_~N_COL~5 .cse84) 2)) (.cse27 (<= .cse98 1)) (.cse28 (<= 1 .cse89)) (.cse29 (<= (- .cse84 ULTIMATE.start_main_~k~5) (- 1))) (.cse30 (<= 1 .cse97)) (.cse31 (<= (- .cse90 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse32 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse85) 2)) (.cse33 (<= ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse34 (<= .cse94 2)) (.cse35 (<= (- .cse90 .cse85) 0)) (.cse71 (<= 0 (+ v_idx_206 ULTIMATE.start_main_~j~5))) (.cse36 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse37 (<= (- ULTIMATE.start_main_~N_COL~5 .cse88) 1)) (.cse38 (<= 2 .cse96)) (.cse39 (<= 1 .cse95)) (.cse40 (<= ULTIMATE.start_main_~N_LIN~5 .cse92)) (.cse41 (<= (- ULTIMATE.start_main_~N_COL~5 .cse85) 2)) (.cse42 (<= 0 .cse91)) (.cse43 (<= (- .cse90 ULTIMATE.start_main_~N_COL~5) (- 2))) (.cse44 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse84) 2)) (.cse45 (<= 0 .cse94)) (.cse46 (<= ULTIMATE.start_main_~N_LIN~5 .cse93)) (.cse47 (<= .cse92 ULTIMATE.start_main_~N_LIN~5)) (.cse48 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~k~5) 1)) (.cse49 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~j~5) 1)) (.cse50 (<= .cse91 1)) (.cse51 (<= (- .cse90 .cse88) (- 1))) (.cse52 (<= .cse86 2)) (.cse53 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse88) 1)) (.cse54 (<= (- .cse90 .cse84) 0)) (.cse55 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse56 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~k~5) 1)) (.cse57 (<= .cse89 2)) (.cse58 (<= (- .cse84 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse59 (<= (- .cse88 .cse85) 1)) (.cse60 (<= .cse87 0)) (.cse61 (<= 2 .cse86)) (.cse62 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5)) (.cse63 (<= (- .cse84 .cse85) 0)) (.cse64 (<= ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5))) (or (let ((.cse19 (select v_prenex_87 v_idx_207))) (let ((.cse26 (+ .cse19 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= 0 (+ .cse19 ULTIMATE.start_main_~j~5 2147483648)) .cse20 (<= 0 (+ .cse19 ULTIMATE.start_main_~k~5 2147483648)) .cse21 .cse22 .cse23 .cse24 .cse25 (<= ULTIMATE.start_main_~k~5 .cse26) (<= ULTIMATE.start_main_~N_LIN~5 .cse26) (<= 0 (+ .cse19 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (<= ULTIMATE.start_main_~j~5 (+ .cse19 2147483648)) .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 (<= 0 (+ (* 2 .cse19) 4294967296)) .cse62 .cse63 (<= ULTIMATE.start_main_~N_COL~5 .cse26) .cse64 (<= 0 (+ .cse19 ULTIMATE.start_main_~N_COL~5 2147483647))))) (let ((.cse68 (select v_prenex_88 v_idx_207))) (let ((.cse66 (+ .cse68 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse65 .cse6 (<= ULTIMATE.start_main_~N_COL~5 .cse66) .cse67 .cse8 .cse9 .cse10 .cse11 (<= 0 (+ .cse68 ULTIMATE.start_main_~j~5 2147483648)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= ULTIMATE.start_main_~k~5 .cse66) .cse37 .cse38 (<= 0 (+ .cse68 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse39 .cse40 .cse41 .cse42 (<= ULTIMATE.start_main_~j~5 (+ .cse68 2147483648)) .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 (<= 0 (+ .cse68 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse52 .cse53 .cse54 .cse55 .cse56 (<= ULTIMATE.start_main_~N_LIN~5 .cse66) (<= 0 (+ .cse68 ULTIMATE.start_main_~k~5 2147483648)) .cse57 .cse58 .cse59 (<= 0 (+ (* 2 .cse68) 4294967296)) .cse60 .cse61 .cse62 .cse63 .cse64))) (let ((.cse70 (select v_v_316_1 v_idx_207))) (let ((.cse69 (+ .cse70 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse65 (<= ULTIMATE.start_main_~k~5 .cse69) (<= 0 (+ .cse70 ULTIMATE.start_main_~j~5 2147483648)) .cse6 .cse7 .cse8 (<= 0 (+ (* 2 .cse70) 4294967296)) .cse9 (<= ULTIMATE.start_main_~j~5 (+ .cse70 2147483648)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 0 (+ .cse70 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse17 .cse18 (<= ULTIMATE.start_main_~N_COL~5 .cse69) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 (<= 0 (+ .cse70 ULTIMATE.start_main_~k~5 2147483648)) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse71 .cse36 .cse37 (<= ULTIMATE.start_main_~N_LIN~5 .cse69) (<= 0 (+ .cse70 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64))) (let ((.cse72 (select v_prenex_89 v_idx_207))) (let ((.cse73 (+ .cse72 2147483649))) (and .cse0 .cse1 (<= 0 (+ .cse72 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse2 .cse3 .cse4 (<= 0 (+ .cse72 ULTIMATE.start_main_~k~5 2147483648)) .cse5 .cse65 .cse6 .cse67 .cse8 (<= 0 (+ .cse72 ULTIMATE.start_main_~j~5 2147483648)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse71 .cse36 .cse37 .cse38 .cse39 .cse40 (<= 0 (+ .cse72 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse41 .cse42 .cse43 .cse44 .cse45 (<= ULTIMATE.start_main_~N_LIN~5 .cse73) .cse46 .cse47 (<= ULTIMATE.start_main_~j~5 (+ .cse72 2147483648)) .cse48 .cse49 (<= ULTIMATE.start_main_~N_COL~5 .cse73) .cse50 (<= ULTIMATE.start_main_~k~5 .cse73) .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 (<= 0 (+ (* 2 .cse72) 4294967296)) .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64))) (let ((.cse75 (select v_prenex_90 v_idx_207))) (let ((.cse74 (+ .cse75 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse67 .cse8 .cse9 .cse10 (<= ULTIMATE.start_main_~N_LIN~5 .cse74) .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 (<= 0 (+ .cse75 ULTIMATE.start_main_~j~5 2147483648)) .cse21 .cse22 (<= 0 (+ .cse75 ULTIMATE.start_main_~k~5 2147483648)) .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= ULTIMATE.start_main_~k~5 .cse74) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 (<= ULTIMATE.start_main_~j~5 (+ .cse75 2147483648)) (<= 0 (+ .cse75 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 (<= 0 (+ (* 2 .cse75) 4294967296)) .cse57 .cse58 (<= ULTIMATE.start_main_~N_COL~5 .cse74) .cse59 (<= 0 (+ .cse75 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse60 .cse61 .cse62 .cse63 .cse64))) (let ((.cse76 (select v_prenex_85 v_idx_207))) (let ((.cse77 (+ .cse76 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~j~5 (+ .cse76 2147483648)) .cse5 .cse6 (<= 0 (+ (* 2 .cse76) 4294967296)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 (<= 0 (+ .cse76 ULTIMATE.start_main_~j~5 2147483648)) .cse23 .cse24 .cse25 (<= 0 (+ .cse76 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse27 .cse28 .cse29 (<= 0 (+ .cse76 ULTIMATE.start_main_~k~5 2147483648)) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse71 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 (<= ULTIMATE.start_main_~N_LIN~5 .cse77) .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 (<= 0 (+ .cse76 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse58 .cse59 .cse60 (<= ULTIMATE.start_main_~N_COL~5 .cse77) .cse61 .cse62 .cse63 (<= ULTIMATE.start_main_~k~5 .cse77) .cse64))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 (<= 2 (+ v_idx_207 ULTIMATE.start_main_~N_LIN~5)) .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (< (+ v_idx_207 ULTIMATE.start_main_~j~5) 0) .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (let ((.cse78 (select v_prenex_86 v_idx_207))) (let ((.cse79 (+ .cse78 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 (+ .cse78 ULTIMATE.start_main_~k~5 2147483648)) .cse5 .cse65 .cse6 (<= ULTIMATE.start_main_~k~5 .cse79) .cse7 .cse8 (<= 0 (+ .cse78 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 (<= 0 (+ .cse78 ULTIMATE.start_main_~j~5 2147483648)) .cse17 .cse18 .cse20 (<= 0 (+ (* 2 .cse78) 4294967296)) .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 (<= 0 (+ .cse78 ULTIMATE.start_main_~N_COL~5 2147483647)) (<= ULTIMATE.start_main_~N_LIN~5 .cse79) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 (<= ULTIMATE.start_main_~N_COL~5 .cse79) .cse62 .cse63 .cse64 (<= ULTIMATE.start_main_~j~5 (+ .cse78 2147483648))))) (let ((.cse81 (select (select ULTIMATE.start_main_~matriz~5 v_idx_211) v_idx_207))) (let ((.cse80 (+ .cse81 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~N_LIN~5 .cse80) .cse5 .cse6 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse81 2147483648)) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= ULTIMATE.start_main_~j~5 (+ .cse81 2147483648)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 (<= 0 (+ (* 2 .cse81) 4294967296)) .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 (<= ULTIMATE.start_main_~N_COL~5 .cse80) .cse46 .cse47 .cse48 .cse49 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse81 2147483647)) .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 (<= ULTIMATE.start_main_~k~5 .cse80) (<= 0 (+ ULTIMATE.start_main_~j~5 .cse81 2147483648)) .cse60 .cse61 .cse62 .cse63 .cse64 (<= 0 (+ ULTIMATE.start_main_~N_COL~5 .cse81 2147483647))))) (let ((.cse82 (select v_prenex_91 v_idx_207))) (let ((.cse83 (+ .cse82 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 (+ .cse82 ULTIMATE.start_main_~k~5 2147483648)) .cse5 (<= 0 (+ .cse82 ULTIMATE.start_main_~j~5 2147483648)) .cse6 .cse67 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= 0 (+ .cse82 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 (<= ULTIMATE.start_main_~N_COL~5 .cse83) .cse21 .cse22 .cse23 .cse24 .cse25 .cse27 .cse28 .cse29 (<= ULTIMATE.start_main_~k~5 .cse83) (<= ULTIMATE.start_main_~N_LIN~5 .cse83) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse71 (<= 0 (+ (* 2 .cse82) 4294967296)) .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (<= ULTIMATE.start_main_~j~5 (+ .cse82 2147483648)) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 (<= 0 (+ .cse82 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse62 .cse63 .cse64)))))) [2019-02-14 16:39:05,662 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse6 (- ULTIMATE.start_main_~N_LIN~5))) (let ((.cse0 (<= (- (- ULTIMATE.start_main_~N_COL~5) .cse6) 0)) (.cse1 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse2 (<= (* 2 ULTIMATE.start_main_~j~5) 0)) (.cse3 (<= 2 (* 2 ULTIMATE.start_main_~N_LIN~5))) (.cse4 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5)) (.cse5 (<= (- .cse6 (- ULTIMATE.start_main_~k~5)) 0))) (or (and .cse0 .cse1 .cse2 (< (+ ULTIMATE.start_main_~k~5 v_idx_211) 1) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 (+ ULTIMATE.start_main_~N_COL~5 (select (select ULTIMATE.start_main_~matriz~5 v_idx_211) v_idx_207) 2147483647))) (and .cse0 .cse1 .cse2 (<= 2 (+ ULTIMATE.start_main_~N_LIN~5 v_idx_211)) .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (+ v_idx_207 ULTIMATE.start_main_~j~5) 0)) (and .cse0 .cse1 .cse2 .cse3 (<= 2 (+ v_idx_207 ULTIMATE.start_main_~N_LIN~5)) .cse4 .cse5)))) [2019-02-14 16:39:07,520 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:39:07,534 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:09,701 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:39:09,703 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:10,029 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:39:10,032 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:10,168 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:39:10,171 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:10,551 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:39:10,557 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:10,671 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:39:10,672 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:7157, output treesize:195 [2019-02-14 16:39:12,558 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:39:12,568 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:14,668 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:39:14,671 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:15,082 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:39:15,085 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:15,422 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:39:15,423 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:5504, output treesize:195 [2019-02-14 16:39:16,167 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 389 [2019-02-14 16:39:16,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:18,019 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-02-14 16:39:18,022 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:18,655 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:39:18,658 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:18,857 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:39:18,858 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:8268, output treesize:196 [2019-02-14 16:39:20,750 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 389 [2019-02-14 16:39:20,767 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:22,641 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-02-14 16:39:22,644 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:22,806 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:39:22,809 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:23,207 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:39:23,210 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:23,471 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:39:23,471 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:11072, output treesize:195 [2019-02-14 16:39:24,759 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:39:24,771 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:27,233 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:39:27,267 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:27,468 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-02-14 16:39:27,471 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:27,640 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:39:27,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:27,816 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:39:27,823 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:27,963 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:39:27,966 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:28,215 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:39:28,216 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:13309, output treesize:197 [2019-02-14 16:39:44,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:39:44,062 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:46,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:39:46,296 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:46,536 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:39:46,539 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:47,028 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:39:47,034 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:47,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:39:47,196 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:47,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:39:47,288 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:5504, output treesize:195 [2019-02-14 16:39:48,818 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:39:48,830 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:51,153 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-14 16:39:51,157 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:51,401 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:39:51,403 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:51,636 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-02-14 16:39:51,639 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:51,823 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-02-14 16:39:51,826 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:52,016 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:39:52,018 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:52,191 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:39:52,195 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:52,333 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:39:52,339 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:52,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:39:52,427 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:7741, output treesize:195 [2019-02-14 16:39:54,219 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:39:54,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:56,225 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2019-02-14 16:39:56,229 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:56,418 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:39:56,422 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:56,915 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:39:56,919 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:57,074 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:39:57,077 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:57,306 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:39:57,307 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:5765, output treesize:195 [2019-02-14 16:39:57,889 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 394 [2019-02-14 16:39:57,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:39:59,876 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-02-14 16:39:59,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:00,100 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:40:00,104 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:00,304 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:40:00,308 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:00,456 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:40:00,460 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:00,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:40:00,808 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:4457, output treesize:196 [2019-02-14 16:40:02,572 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:40:02,585 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:04,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2019-02-14 16:40:04,654 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:05,019 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:40:05,022 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:05,375 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:40:05,378 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:05,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:40:05,677 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:05,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:40:05,767 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:5504, output treesize:195 [2019-02-14 16:40:07,471 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:40:07,486 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:09,638 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:40:09,641 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:09,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:40:09,833 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:09,976 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:40:09,980 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:10,106 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:40:10,109 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:10,361 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:40:10,362 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:4818, output treesize:195 [2019-02-14 16:40:26,642 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:40:26,658 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:28,875 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:40:28,878 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:29,101 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:40:29,105 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:29,321 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-14 16:40:29,325 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:29,536 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:40:29,540 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:29,711 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:40:29,715 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:29,980 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:40:29,980 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:4393, output treesize:195 [2019-02-14 16:40:31,589 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:40:31,605 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:33,808 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 55 [2019-02-14 16:40:33,813 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:34,027 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:40:34,030 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:34,236 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:40:34,239 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:34,426 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-02-14 16:40:34,430 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:34,608 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:40:34,612 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:34,749 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:40:34,753 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:34,924 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:40:34,925 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:7741, output treesize:197 [2019-02-14 16:40:37,562 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 389 [2019-02-14 16:40:37,584 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:39,975 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-02-14 16:40:39,978 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:40,135 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:40:40,139 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:40,276 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:40:40,280 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:40,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:40:40,534 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:12198, output treesize:195 [2019-02-14 16:40:40,556 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:40:40,557 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_187, v_v_316_1, v_prenex_189, v_prenex_183, v_prenex_185, v_prenex_184, v_prenex_188, v_prenex_186]. (let ((.cse109 (select (select ULTIMATE.start_main_~matriz~5 v_idx_421) v_idx_417))) (let ((.cse95 (* 2 ULTIMATE.start_main_~N_LIN~5)) (.cse100 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~j~5)) (.cse103 (* 2 ULTIMATE.start_main_~k~5)) (.cse98 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse102 (+ ULTIMATE.start_main_~k~5 1)) (.cse106 (+ ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~N_COL~5)) (.cse105 (+ ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse96 (* 2 ULTIMATE.start_main_~j~5)) (.cse94 (- ULTIMATE.start_main_~k~5)) (.cse104 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse99 (- ULTIMATE.start_main_~N_COL~5)) (.cse93 (- ULTIMATE.start_main_~N_LIN~5)) (.cse97 (- ULTIMATE.start_main_~j~5)) (.cse101 (+ ULTIMATE.start_main_~j~5 1)) (.cse107 (+ ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~N_LIN~5)) (.cse108 (+ .cse109 2147483649))) (let ((.cse72 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse109 2147483647))) (.cse73 (<= 0 (+ (* 2 .cse109) 4294967296))) (.cse74 (<= ULTIMATE.start_main_~j~5 (+ .cse109 2147483648))) (.cse75 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse109 2147483648))) (.cse76 (<= 0 (+ ULTIMATE.start_main_~N_COL~5 .cse109 2147483647))) (.cse77 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse109 2147483648))) (.cse78 (<= ULTIMATE.start_main_~k~5 .cse108)) (.cse79 (<= ULTIMATE.start_main_~N_LIN~5 .cse108)) (.cse80 (<= ULTIMATE.start_main_~N_COL~5 .cse108)) (.cse14 (< (+ v_idx_418 ULTIMATE.start_main_~N_LIN~5) 2)) (.cse67 (< (+ v_idx_421 ULTIMATE.start_main_~k~5) 1)) (.cse63 (< (+ v_idx_417 ULTIMATE.start_main_~j~5) 0)) (.cse65 (<= 2 (+ v_idx_417 ULTIMATE.start_main_~N_LIN~5))) (.cse0 (<= 1 .cse107)) (.cse1 (<= ULTIMATE.start_main_~k~5 .cse101)) (.cse2 (<= (- ULTIMATE.start_main_~j~5 .cse97) 0)) (.cse3 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse4 (<= (- .cse97 ULTIMATE.start_main_~j~5) 0)) (.cse5 (<= (- .cse93 .cse97) (- 1))) (.cse6 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5) 0)) (.cse7 (<= 2 (+ v_idx_421 ULTIMATE.start_main_~N_LIN~5))) (.cse8 (<= (- .cse99 ULTIMATE.start_main_~j~5) (- 1))) (.cse9 (<= (- .cse93 ULTIMATE.start_main_~j~5) (- 1))) (.cse10 (<= (- ULTIMATE.start_main_~N_COL~5 .cse99) 2)) (.cse11 (<= .cse104 2)) (.cse12 (<= (- .cse97 ULTIMATE.start_main_~k~5) 0)) (.cse13 (<= (- ULTIMATE.start_main_~j~5 .cse94) 1)) (.cse15 (<= 0 .cse96)) (.cse16 (<= .cse105 2)) (.cse17 (<= (- .cse99 ULTIMATE.start_main_~k~5) (- 1))) (.cse18 (<= .cse106 1)) (.cse19 (<= (- ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5) 0)) (.cse20 (<= ULTIMATE.start_main_~N_COL~5 .cse101)) (.cse21 (<= (- .cse94 ULTIMATE.start_main_~k~5) 0)) (.cse22 (<= ULTIMATE.start_main_~N_COL~5 .cse102)) (.cse23 (<= .cse101 ULTIMATE.start_main_~N_COL~5)) (.cse24 (<= (- ULTIMATE.start_main_~k~5 .cse94) 2)) (.cse25 (<= (- ULTIMATE.start_main_~N_COL~5 .cse93) 2)) (.cse26 (<= .cse107 1)) (.cse27 (<= 1 .cse98)) (.cse28 (<= (- .cse93 ULTIMATE.start_main_~k~5) (- 1))) (.cse29 (<= 1 .cse106)) (.cse30 (<= (- .cse99 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse31 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse94) 2)) (.cse32 (<= ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse33 (<= .cse103 2)) (.cse34 (<= (- .cse99 .cse94) 0)) (.cse35 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse36 (<= (- ULTIMATE.start_main_~N_COL~5 .cse97) 1)) (.cse37 (<= 2 .cse105)) (.cse38 (<= 1 .cse104)) (.cse39 (<= ULTIMATE.start_main_~N_LIN~5 .cse101)) (.cse40 (<= (- ULTIMATE.start_main_~N_COL~5 .cse94) 2)) (.cse41 (<= 0 .cse100)) (.cse42 (<= (- .cse99 ULTIMATE.start_main_~N_COL~5) (- 2))) (.cse43 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse93) 2)) (.cse44 (<= 0 .cse103)) (.cse45 (<= ULTIMATE.start_main_~N_LIN~5 .cse102)) (.cse46 (<= .cse101 ULTIMATE.start_main_~N_LIN~5)) (.cse47 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~k~5) 1)) (.cse48 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~j~5) 1)) (.cse49 (<= .cse100 1)) (.cse50 (<= (- .cse99 .cse97) (- 1))) (.cse51 (<= .cse95 2)) (.cse52 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse97) 1)) (.cse53 (<= (- .cse99 .cse93) 0)) (.cse54 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse55 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~k~5) 1)) (.cse66 (<= 0 (+ v_idx_416 ULTIMATE.start_main_~j~5))) (.cse56 (<= .cse98 2)) (.cse57 (<= (- .cse93 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse58 (<= (- .cse97 .cse94) 1)) (.cse59 (<= .cse96 0)) (.cse60 (<= 2 .cse95)) (.cse61 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5)) (.cse62 (<= (- .cse93 .cse94) 0)) (.cse64 (<= ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse65 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse65 .cse37 .cse38 .cse39 .cse40 .cse41 .cse67 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64) (let ((.cse69 (select v_prenex_187 v_idx_417))) (let ((.cse68 (+ .cse69 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~N_LIN~5 .cse68) (<= 0 (+ ULTIMATE.start_main_~k~5 .cse69 2147483648)) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_main_~N_COL~5 .cse68) (<= ULTIMATE.start_main_~j~5 (+ .cse69 2147483648)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse69 2147483647)) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse67 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 (<= ULTIMATE.start_main_~k~5 .cse68) .cse56 (<= 0 (+ (* 2 .cse69) 4294967296)) .cse57 .cse58 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse69 2147483648)) .cse59 .cse60 .cse61 .cse62 .cse64 (<= 0 (+ .cse69 ULTIMATE.start_main_~N_COL~5 2147483647))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse65 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse67 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64) (let ((.cse70 (select v_v_316_1 v_idx_417))) (let ((.cse71 (+ .cse70 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 (+ (* 2 .cse70) 4294967296)) (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse70 2147483647)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 (<= ULTIMATE.start_main_~N_COL~5 .cse71) .cse20 (<= ULTIMATE.start_main_~N_LIN~5 .cse71) (<= 0 (+ ULTIMATE.start_main_~j~5 .cse70 2147483648)) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse70 2147483648)) .cse36 (<= 0 (+ .cse70 ULTIMATE.start_main_~N_COL~5 2147483647)) (<= ULTIMATE.start_main_~j~5 (+ .cse70 2147483648)) .cse37 .cse38 .cse39 .cse40 (<= ULTIMATE.start_main_~k~5 .cse71) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse72 .cse5 .cse6 .cse73 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse74 .cse20 .cse75 .cse21 .cse22 .cse76 .cse77 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse78 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse79 .cse61 .cse80 .cse62 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse65 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse67 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse72 .cse5 .cse6 .cse73 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse74 .cse20 .cse75 .cse21 .cse22 .cse76 .cse77 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse78 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse79 .cse80 .cse62 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse72 .cse5 .cse6 .cse73 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse74 .cse20 .cse75 .cse21 .cse22 .cse76 .cse77 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse78 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse79 .cse61 .cse80 .cse62 .cse64) (let ((.cse81 (select v_prenex_189 v_idx_417))) (let ((.cse82 (+ .cse81 2147483649))) (and .cse0 .cse1 .cse2 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse81 2147483647)) (<= ULTIMATE.start_main_~k~5 .cse82) .cse3 .cse4 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse81 2147483648)) .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse81 2147483648)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= ULTIMATE.start_main_~N_LIN~5 .cse82) .cse22 .cse23 .cse24 (<= 0 (+ (* 2 .cse81) 4294967296)) .cse25 (<= ULTIMATE.start_main_~j~5 (+ .cse81 2147483648)) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 (<= ULTIMATE.start_main_~N_COL~5 .cse82) .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (<= 0 (+ .cse81 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse41 .cse67 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse65 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64) (let ((.cse83 (select v_prenex_183 v_idx_417))) (let ((.cse84 (+ .cse83 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~j~5 (+ .cse83 2147483648)) .cse5 .cse6 (<= ULTIMATE.start_main_~N_LIN~5 .cse84) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 (<= ULTIMATE.start_main_~N_COL~5 .cse84) .cse25 .cse26 .cse27 .cse28 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse83 2147483648)) (<= 0 (+ .cse83 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (<= 0 (+ (* 2 .cse83) 4294967296)) .cse35 .cse36 .cse37 (<= ULTIMATE.start_main_~k~5 .cse84) .cse38 .cse39 .cse40 .cse41 .cse42 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse83 2147483647)) .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse83 2147483648)) .cse58 .cse59 .cse60 .cse61 .cse62 .cse64))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse65 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse65 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse65 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse67 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse67 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse67 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse67 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse65 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse67 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (let ((.cse86 (select v_prenex_185 v_idx_417))) (let ((.cse85 (+ .cse86 2147483649))) (and .cse0 .cse1 (<= ULTIMATE.start_main_~N_LIN~5 .cse85) .cse2 .cse3 .cse4 (<= 0 (+ (* 2 .cse86) 4294967296)) .cse5 (<= ULTIMATE.start_main_~j~5 (+ .cse86 2147483648)) .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 (<= ULTIMATE.start_main_~N_COL~5 .cse85) .cse34 .cse35 .cse36 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse86 2147483648)) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse67 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 (<= 0 (+ .cse86 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 (<= ULTIMATE.start_main_~k~5 .cse85) .cse59 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse86 2147483647)) .cse60 .cse61 .cse62 .cse64 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse86 2147483648))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (let ((.cse87 (select v_prenex_184 v_idx_417))) (let ((.cse88 (+ .cse87 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 0 (+ (* 2 .cse87) 4294967296)) .cse7 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse87 2147483647)) (<= ULTIMATE.start_main_~N_COL~5 .cse88) .cse8 .cse9 .cse10 (<= ULTIMATE.start_main_~N_LIN~5 .cse88) .cse11 (<= ULTIMATE.start_main_~j~5 (+ .cse87 2147483648)) .cse12 .cse13 .cse14 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse87 2147483648)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (<= 0 (+ .cse87 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 (<= ULTIMATE.start_main_~k~5 .cse88) .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse87 2147483648)) .cse62 .cse64))) (let ((.cse89 (select v_prenex_188 v_idx_417))) (let ((.cse90 (+ .cse89 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 0 (+ .cse89 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse6 (<= ULTIMATE.start_main_~k~5 .cse90) .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse89 2147483647)) (<= ULTIMATE.start_main_~j~5 (+ .cse89 2147483648)) .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse89 2147483648)) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse67 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 (<= 0 (+ (* 2 .cse89) 4294967296)) (<= ULTIMATE.start_main_~N_LIN~5 .cse90) .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse89 2147483648)) .cse58 .cse59 .cse60 (<= ULTIMATE.start_main_~N_COL~5 .cse90) .cse61 .cse62 .cse64))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse65 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse65 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64) (let ((.cse91 (select v_prenex_186 v_idx_417))) (let ((.cse92 (+ .cse91 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse91 2147483648)) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 (+ .cse91 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse12 .cse13 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= ULTIMATE.start_main_~N_COL~5 .cse92) .cse21 .cse22 .cse23 .cse24 .cse25 (<= ULTIMATE.start_main_~j~5 (+ .cse91 2147483648)) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (<= 0 (+ ULTIMATE.start_main_~N_LIN~5 .cse91 2147483647)) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 (<= 0 (+ ULTIMATE.start_main_~j~5 .cse91 2147483648)) .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse66 .cse56 (<= ULTIMATE.start_main_~N_LIN~5 .cse92) .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse64 (<= 0 (+ (* 2 .cse91) 4294967296)) (<= ULTIMATE.start_main_~k~5 .cse92)))))))) [2019-02-14 16:40:40,558 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse6 (- ULTIMATE.start_main_~N_LIN~5))) (let ((.cse0 (<= (- (- ULTIMATE.start_main_~N_COL~5) .cse6) 0)) (.cse1 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse2 (<= (* 2 ULTIMATE.start_main_~j~5) 0)) (.cse3 (<= 2 (* 2 ULTIMATE.start_main_~N_LIN~5))) (.cse4 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5)) (.cse5 (<= (- .cse6 (- ULTIMATE.start_main_~k~5)) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (+ v_idx_417 ULTIMATE.start_main_~j~5) 0)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~N_COL~5 (+ (select (select ULTIMATE.start_main_~matriz~5 v_idx_421) v_idx_417) 2147483649)) .cse5) (and .cse0 .cse1 .cse2 .cse3 (<= 2 (+ v_idx_417 ULTIMATE.start_main_~N_LIN~5)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (+ v_idx_421 ULTIMATE.start_main_~k~5) 1)) (and (<= 2 (+ v_idx_421 ULTIMATE.start_main_~N_LIN~5)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5)))) [2019-02-14 16:40:41,179 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:40:41,193 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:43,756 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-14 16:40:43,759 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:44,021 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:40:44,024 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:44,201 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:40:44,205 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:44,346 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:40:44,350 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:44,734 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:40:44,737 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:44,830 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:40:44,831 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:13309, output treesize:195 [2019-02-14 16:40:46,631 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:40:46,643 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:49,023 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:40:49,027 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:49,244 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:40:49,247 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:49,456 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:40:49,459 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:49,631 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-14 16:40:49,635 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:49,795 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:40:49,798 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:49,934 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:40:49,937 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:50,108 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:40:50,109 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:6359, output treesize:195 [2019-02-14 16:40:51,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 394 [2019-02-14 16:40:51,901 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:53,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:40:53,984 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:54,343 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:40:54,347 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:54,694 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:40:54,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:54,876 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:40:54,879 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:55,017 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:40:55,020 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:40:55,109 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:40:55,110 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:6423, output treesize:195 [2019-02-14 16:41:09,773 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 389 [2019-02-14 16:41:09,786 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:11,567 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:41:11,571 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:11,838 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:41:11,840 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:11,966 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:41:11,969 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:12,220 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:41:12,221 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:5829, output treesize:197 [2019-02-14 16:41:14,019 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 394 [2019-02-14 16:41:14,031 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:16,199 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-02-14 16:41:16,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:16,386 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:41:16,389 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:16,567 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:41:16,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:16,716 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:41:16,719 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:17,051 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:41:17,051 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:8332, output treesize:195 [2019-02-14 16:41:19,146 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 389 [2019-02-14 16:41:19,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:21,090 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:41:21,094 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:21,508 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:41:21,515 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:21,855 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:41:21,856 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:11072, output treesize:196 [2019-02-14 16:41:22,446 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 415 treesize of output 389 [2019-02-14 16:41:22,460 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:24,233 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-02-14 16:41:24,237 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:24,403 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:41:24,406 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:24,548 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:41:24,552 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:24,681 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:41:24,685 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:25,028 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:41:25,028 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:4882, output treesize:196 [2019-02-14 16:41:26,893 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 389 [2019-02-14 16:41:26,905 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:28,921 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:41:28,924 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:29,506 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:41:29,506 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:5504, output treesize:196 [2019-02-14 16:41:31,804 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:41:31,816 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:34,181 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-02-14 16:41:34,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:34,614 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:41:34,618 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:34,804 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:41:34,807 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:34,982 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:41:34,986 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:35,129 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:41:35,132 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:35,258 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:41:35,261 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:35,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:41:35,350 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:8288, output treesize:197 [2019-02-14 16:41:49,857 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:41:49,869 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:51,880 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:41:51,883 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:52,091 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-02-14 16:41:52,094 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:52,293 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:41:52,296 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:52,463 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:41:52,467 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:52,606 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:41:52,610 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:52,739 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:41:52,742 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:52,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:41:52,912 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:7157, output treesize:196 [2019-02-14 16:41:54,637 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 394 [2019-02-14 16:41:54,661 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:56,952 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-02-14 16:41:56,955 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:57,144 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:41:57,148 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:57,432 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:41:57,434 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:57,569 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:41:57,572 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:41:57,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:41:57,836 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:11136, output treesize:196 [2019-02-14 16:42:00,021 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 389 [2019-02-14 16:42:00,034 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:01,920 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-14 16:42:01,923 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:02,094 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:42:02,098 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:02,377 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:42:02,380 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:02,768 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:42:02,772 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:02,866 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:42:02,866 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:8268, output treesize:195 [2019-02-14 16:42:03,460 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:42:03,474 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:05,828 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:42:05,832 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:06,046 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:42:06,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:06,238 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:42:06,242 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:06,386 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:42:06,390 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:06,640 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:42:06,643 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:06,815 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:42:06,816 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:6359, output treesize:196 [2019-02-14 16:42:08,708 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 389 [2019-02-14 16:42:08,722 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:10,542 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-14 16:42:10,546 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:10,708 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:42:10,712 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:10,848 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:42:10,852 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:10,977 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:42:10,981 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:11,230 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:42:11,231 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:4393, output treesize:197 [2019-02-14 16:42:12,804 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 425 treesize of output 399 [2019-02-14 16:42:12,823 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:15,086 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:42:15,093 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:15,361 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:42:15,365 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:15,563 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:42:15,567 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:15,926 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2019-02-14 16:42:15,931 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:16,108 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:42:16,112 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:16,253 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:42:16,256 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:16,348 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:42:16,349 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 8 variables, input treesize:4882, output treesize:196 [2019-02-14 16:42:30,933 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:42:30,943 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:32,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:42:33,001 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:33,366 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:42:33,370 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:33,544 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:42:33,547 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:33,687 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:42:33,691 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:33,942 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:42:33,943 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:7741, output treesize:197 [2019-02-14 16:42:35,829 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:42:35,845 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:38,119 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:42:38,123 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:38,341 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:42:38,344 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:38,560 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-02-14 16:42:38,563 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:38,777 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:42:38,780 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:39,181 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:42:39,185 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:39,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:42:39,279 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:9961, output treesize:197 [2019-02-14 16:42:41,708 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:42:41,721 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:44,228 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:42:44,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:44,509 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:42:44,513 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:44,860 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:42:44,861 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:8268, output treesize:195 [2019-02-14 16:42:45,508 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:42:45,521 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:47,725 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:42:47,729 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:48,127 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-02-14 16:42:48,131 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:48,505 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:42:48,509 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:48,599 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:42:48,600 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:8268, output treesize:196 [2019-02-14 16:42:50,489 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:42:50,518 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:52,553 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:42:52,556 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:52,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:42:52,741 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:52,885 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:42:52,888 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:53,259 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:42:53,263 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:53,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:42:53,433 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:6359, output treesize:195 [2019-02-14 16:42:55,026 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:42:55,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:57,470 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-02-14 16:42:57,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:57,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:42:57,895 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:58,081 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:42:58,084 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:58,232 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:42:58,235 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:58,492 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:42:58,495 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:42:58,589 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:42:58,590 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:8268, output treesize:195 [2019-02-14 16:43:12,840 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:43:12,852 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:15,170 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:43:15,173 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:15,360 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:43:15,364 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:15,878 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:43:15,887 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:16,056 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:43:16,056 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:13349, output treesize:196 [2019-02-14 16:43:16,827 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:43:16,838 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:19,020 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:43:19,023 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:19,204 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:43:19,207 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:19,346 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:43:19,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:19,736 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:43:19,739 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:19,835 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:43:19,836 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:4393, output treesize:196 [2019-02-14 16:43:22,007 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:43:22,020 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:24,233 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-02-14 16:43:24,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:24,453 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:43:24,456 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:24,642 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-02-14 16:43:24,645 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:24,827 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:43:24,830 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:25,099 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:43:25,106 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:25,279 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:43:25,279 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:7741, output treesize:197 [2019-02-14 16:43:25,863 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:43:25,877 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:28,111 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:43:28,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:28,348 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:43:28,351 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:28,895 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:43:28,899 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:29,071 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:43:29,072 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:4393, output treesize:195 [2019-02-14 16:43:43,704 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 389 [2019-02-14 16:43:43,716 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:45,493 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:43:45,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:45,770 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:43:45,774 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:46,119 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:43:46,120 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:4393, output treesize:195 [2019-02-14 16:43:46,751 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:43:46,764 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:48,953 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:43:48,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:49,157 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:43:49,160 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:49,346 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:43:49,349 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:49,527 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:43:49,533 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:49,679 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:43:49,683 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:43:49,940 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:43:49,940 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:6359, output treesize:195 [2019-02-14 16:44:05,434 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 389 [2019-02-14 16:44:05,447 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:07,659 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 54 [2019-02-14 16:44:07,662 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:07,854 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2019-02-14 16:44:07,859 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:08,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:44:08,006 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:08,345 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:44:08,346 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:13309, output treesize:195 [2019-02-14 16:44:08,982 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:44:08,997 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:11,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:44:11,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:11,400 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:44:11,403 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:11,618 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:44:11,621 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:12,024 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:44:12,028 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:12,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:44:12,207 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:4393, output treesize:196 [2019-02-14 16:44:28,329 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:44:28,342 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:30,379 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:44:30,382 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:30,558 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:44:30,561 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:31,058 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:44:31,059 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:6359, output treesize:195 [2019-02-14 16:44:31,698 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:44:31,711 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:33,896 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:44:33,899 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:34,264 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:44:34,269 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:34,450 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:44:34,454 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:34,978 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:44:34,982 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:35,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:44:35,160 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:5673, output treesize:195 [2019-02-14 16:44:50,871 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 389 [2019-02-14 16:44:50,883 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:52,547 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:44:52,551 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:52,941 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:44:52,944 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:53,276 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:44:53,277 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 8 variables, input treesize:4818, output treesize:196 [2019-02-14 16:44:54,139 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:44:54,152 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:56,355 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-14 16:44:56,358 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:56,586 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2019-02-14 16:44:56,590 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:56,795 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:44:56,799 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:56,998 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:44:57,002 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:57,181 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:44:57,185 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:57,360 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:44:57,363 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:57,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:44:57,506 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2019-02-14 16:44:57,598 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:44:57,598 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:7157, output treesize:196 [2019-02-14 16:45:14,596 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 394 [2019-02-14 16:45:14,609 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:16,707 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:45:16,710 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:17,045 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:45:17,049 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:17,318 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:45:17,322 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:17,448 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:45:17,451 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:17,627 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:45:17,628 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:10035, output treesize:196 [2019-02-14 16:45:18,282 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:45:18,296 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:20,412 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-14 16:45:20,416 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:20,829 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-02-14 16:45:20,833 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:21,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:45:21,004 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:21,343 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:45:21,343 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:5673, output treesize:195 [2019-02-14 16:45:21,361 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:45:21,362 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_431, v_prenex_433, v_v_316_1, v_prenex_428, v_prenex_432, v_prenex_429, v_prenex_434, v_prenex_430]. (let ((.cse107 (select (select ULTIMATE.start_main_~matriz~5 v_idx_1003) v_idx_999))) (let ((.cse93 (* 2 ULTIMATE.start_main_~N_LIN~5)) (.cse98 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~j~5)) (.cse101 (* 2 ULTIMATE.start_main_~k~5)) (.cse96 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse100 (+ ULTIMATE.start_main_~k~5 1)) (.cse104 (+ ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~N_COL~5)) (.cse103 (+ ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse94 (* 2 ULTIMATE.start_main_~j~5)) (.cse92 (- ULTIMATE.start_main_~k~5)) (.cse102 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse97 (- ULTIMATE.start_main_~N_COL~5)) (.cse91 (- ULTIMATE.start_main_~N_LIN~5)) (.cse95 (- ULTIMATE.start_main_~j~5)) (.cse99 (+ ULTIMATE.start_main_~j~5 1)) (.cse105 (+ ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~N_LIN~5)) (.cse106 (+ .cse107 2147483649))) (let ((.cse6 (<= 2 (+ v_idx_1003 ULTIMATE.start_main_~N_LIN~5))) (.cse68 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse107 2147483648))) (.cse69 (<= 0 (+ .cse107 ULTIMATE.start_main_~N_COL~5 2147483647))) (.cse67 (<= 0 (+ v_idx_998 ULTIMATE.start_main_~j~5))) (.cse71 (<= 0 (+ (* 2 .cse107) 4294967296))) (.cse72 (<= ULTIMATE.start_main_~j~5 (+ .cse107 2147483648))) (.cse73 (<= 0 (+ .cse107 ULTIMATE.start_main_~N_LIN~5 2147483647))) (.cse74 (<= 0 (+ .cse107 ULTIMATE.start_main_~j~5 2147483648))) (.cse75 (<= ULTIMATE.start_main_~N_COL~5 .cse106)) (.cse76 (<= ULTIMATE.start_main_~k~5 .cse106)) (.cse77 (<= ULTIMATE.start_main_~N_LIN~5 .cse106)) (.cse0 (<= 1 .cse105)) (.cse1 (<= ULTIMATE.start_main_~k~5 .cse99)) (.cse2 (<= (- ULTIMATE.start_main_~j~5 .cse95) 0)) (.cse3 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse4 (<= (- .cse95 ULTIMATE.start_main_~j~5) 0)) (.cse7 (<= (- .cse91 .cse95) (- 1))) (.cse8 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5) 0)) (.cse9 (<= (- .cse97 ULTIMATE.start_main_~j~5) (- 1))) (.cse10 (<= (- .cse91 ULTIMATE.start_main_~j~5) (- 1))) (.cse11 (<= (- ULTIMATE.start_main_~N_COL~5 .cse97) 2)) (.cse78 (< (+ v_idx_1003 ULTIMATE.start_main_~k~5) 1)) (.cse12 (<= .cse102 2)) (.cse13 (<= (- .cse95 ULTIMATE.start_main_~k~5) 0)) (.cse14 (<= (- ULTIMATE.start_main_~j~5 .cse92) 1)) (.cse15 (<= 0 .cse94)) (.cse16 (<= .cse103 2)) (.cse17 (<= (- .cse97 ULTIMATE.start_main_~k~5) (- 1))) (.cse18 (<= .cse104 1)) (.cse70 (< (+ v_idx_1000 ULTIMATE.start_main_~N_LIN~5) 2)) (.cse20 (<= (- ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5) 0)) (.cse21 (<= ULTIMATE.start_main_~N_COL~5 .cse99)) (.cse22 (<= (- .cse92 ULTIMATE.start_main_~k~5) 0)) (.cse23 (<= ULTIMATE.start_main_~N_COL~5 .cse100)) (.cse24 (<= .cse99 ULTIMATE.start_main_~N_COL~5)) (.cse25 (<= (- ULTIMATE.start_main_~k~5 .cse92) 2)) (.cse26 (<= (- ULTIMATE.start_main_~N_COL~5 .cse91) 2)) (.cse27 (<= .cse105 1)) (.cse28 (<= 1 .cse96)) (.cse29 (<= (- .cse91 ULTIMATE.start_main_~k~5) (- 1))) (.cse30 (<= 1 .cse104)) (.cse31 (<= (- .cse97 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse32 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse92) 2)) (.cse33 (<= ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse34 (<= .cse101 2)) (.cse35 (<= (- .cse97 .cse92) 0)) (.cse36 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse37 (<= (- ULTIMATE.start_main_~N_COL~5 .cse95) 1)) (.cse38 (<= 2 .cse103)) (.cse39 (<= 1 .cse102)) (.cse40 (<= ULTIMATE.start_main_~N_LIN~5 .cse99)) (.cse41 (<= (- ULTIMATE.start_main_~N_COL~5 .cse92) 2)) (.cse42 (<= 0 .cse98)) (.cse43 (<= (- .cse97 ULTIMATE.start_main_~N_COL~5) (- 2))) (.cse44 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse91) 2)) (.cse45 (<= 0 .cse101)) (.cse46 (<= ULTIMATE.start_main_~N_LIN~5 .cse100)) (.cse47 (<= .cse99 ULTIMATE.start_main_~N_LIN~5)) (.cse48 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~k~5) 1)) (.cse49 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~j~5) 1)) (.cse50 (<= .cse98 1)) (.cse51 (<= (- .cse97 .cse95) (- 1))) (.cse52 (<= .cse93 2)) (.cse53 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse95) 1)) (.cse54 (<= (- .cse97 .cse91) 0)) (.cse55 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse56 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~k~5) 1)) (.cse57 (<= .cse96 2)) (.cse58 (<= (- .cse91 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse59 (<= (- .cse95 .cse92) 1)) (.cse60 (<= .cse94 0)) (.cse61 (<= 2 .cse93)) (.cse62 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5)) (.cse63 (<= (- .cse91 .cse92) 0)) (.cse64 (<= ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5))) (or (let ((.cse5 (select v_prenex_433 v_idx_999))) (let ((.cse19 (+ .cse5 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 (+ .cse5 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 (<= ULTIMATE.start_main_~N_COL~5 .cse19) .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (<= 0 (+ .cse5 ULTIMATE.start_main_~N_COL~5 2147483647)) (<= 0 (+ .cse5 ULTIMATE.start_main_~j~5 2147483648)) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (<= ULTIMATE.start_main_~k~5 .cse19) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 (<= ULTIMATE.start_main_~j~5 (+ .cse5 2147483648)) (<= 0 (+ (* 2 .cse5) 4294967296)) .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 (<= ULTIMATE.start_main_~N_LIN~5 .cse19) .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 (<= 0 (+ .cse5 ULTIMATE.start_main_~k~5 2147483648)) .cse64))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 (< (+ v_idx_999 ULTIMATE.start_main_~j~5) 0) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (let ((.cse65 (select v_v_316_1 v_idx_999))) (let ((.cse66 (+ .cse65 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~j~5 (+ .cse65 2147483648)) (<= 0 (+ .cse65 ULTIMATE.start_main_~j~5 2147483648)) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= ULTIMATE.start_main_~k~5 .cse66) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse67 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (<= 0 (+ .cse65 ULTIMATE.start_main_~k~5 2147483648)) .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= ULTIMATE.start_main_~N_COL~5 .cse66) .cse36 .cse37 (<= 0 (+ .cse65 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (<= ULTIMATE.start_main_~N_LIN~5 .cse66) .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 (<= 0 (+ .cse65 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse60 .cse61 (<= 0 (+ (* 2 .cse65) 4294967296)) .cse62 .cse63 .cse64))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 2 (+ v_idx_999 ULTIMATE.start_main_~N_LIN~5)) .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse68 .cse8 .cse9 .cse10 .cse11 .cse69 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse70 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse71 .cse33 .cse72 .cse34 .cse73 .cse35 .cse36 .cse74 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse75 .cse52 .cse53 .cse54 .cse55 .cse56 .cse76 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse77 .cse64) (let ((.cse80 (select v_prenex_428 v_idx_999))) (let ((.cse79 (+ .cse80 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse78 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse67 .cse22 .cse23 .cse24 .cse25 .cse26 (<= ULTIMATE.start_main_~k~5 .cse79) (<= 0 (+ .cse80 ULTIMATE.start_main_~j~5 2147483648)) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= ULTIMATE.start_main_~N_LIN~5 .cse79) .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 (<= 0 (+ (* 2 .cse80) 4294967296)) .cse44 .cse45 (<= 0 (+ .cse80 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse46 .cse47 .cse48 .cse49 (<= ULTIMATE.start_main_~j~5 (+ .cse80 2147483648)) .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 (<= ULTIMATE.start_main_~N_COL~5 .cse79) .cse60 .cse61 .cse62 .cse63 .cse64 (<= 0 (+ .cse80 ULTIMATE.start_main_~k~5 2147483648)) (<= 0 (+ .cse80 ULTIMATE.start_main_~N_COL~5 2147483647))))) (let ((.cse81 (select v_prenex_431 v_idx_999))) (let ((.cse82 (+ .cse81 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= 0 (+ .cse81 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse7 .cse8 (<= ULTIMATE.start_main_~k~5 .cse82) .cse9 (<= 0 (+ .cse81 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse10 .cse11 .cse78 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse70 .cse18 .cse20 (<= 0 (+ .cse81 ULTIMATE.start_main_~k~5 2147483648)) .cse21 (<= ULTIMATE.start_main_~j~5 (+ .cse81 2147483648)) .cse67 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 (<= 0 (+ (* 2 .cse81) 4294967296)) (<= ULTIMATE.start_main_~N_COL~5 .cse82) .cse38 .cse39 .cse40 .cse41 .cse42 (<= 0 (+ .cse81 ULTIMATE.start_main_~j~5 2147483648)) .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 (<= ULTIMATE.start_main_~N_LIN~5 .cse82) .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64))) (let ((.cse83 (select v_prenex_432 v_idx_999))) (let ((.cse84 (+ .cse83 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 (<= 0 (+ .cse83 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse8 (<= ULTIMATE.start_main_~k~5 .cse84) .cse9 (<= 0 (+ (* 2 .cse83) 4294967296)) (<= 0 (+ .cse83 ULTIMATE.start_main_~j~5 2147483648)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse70 .cse20 .cse21 (<= ULTIMATE.start_main_~j~5 (+ .cse83 2147483648)) .cse67 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (<= 0 (+ .cse83 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 (<= 0 (+ .cse83 ULTIMATE.start_main_~k~5 2147483648)) .cse48 .cse49 (<= ULTIMATE.start_main_~N_COL~5 .cse84) .cse50 (<= ULTIMATE.start_main_~N_LIN~5 .cse84) .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse68 .cse8 .cse9 .cse10 .cse11 .cse69 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse71 .cse30 .cse31 .cse32 .cse72 .cse33 .cse73 .cse34 .cse35 .cse74 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse75 .cse52 .cse53 .cse54 .cse55 .cse56 .cse76 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse77 .cse64) (let ((.cse85 (select v_prenex_429 v_idx_999))) (let ((.cse86 (+ .cse85 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 0 (+ .cse85 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse12 (<= 0 (+ .cse85 ULTIMATE.start_main_~k~5 2147483648)) (<= ULTIMATE.start_main_~N_COL~5 .cse86) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse70 .cse20 .cse21 .cse22 (<= ULTIMATE.start_main_~N_LIN~5 .cse86) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 (<= 0 (+ .cse85 ULTIMATE.start_main_~j~5 2147483648)) .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 (<= 0 (+ (* 2 .cse85) 4294967296)) .cse58 .cse59 (<= 0 (+ .cse85 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse60 (<= ULTIMATE.start_main_~j~5 (+ .cse85 2147483648)) .cse61 .cse62 .cse63 .cse64 (<= ULTIMATE.start_main_~k~5 .cse86)))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse68 .cse8 .cse9 .cse10 .cse11 .cse69 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse70 .cse20 .cse21 .cse67 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse71 .cse33 .cse72 .cse34 .cse73 .cse35 .cse36 .cse74 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse75 .cse52 .cse53 .cse54 .cse55 .cse56 .cse76 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse77 .cse64) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse68 .cse8 .cse9 .cse10 .cse11 .cse69 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 .cse21 .cse67 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse71 .cse30 .cse31 .cse32 .cse72 .cse33 .cse73 .cse34 .cse35 .cse74 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse75 .cse52 .cse53 .cse54 .cse55 .cse56 .cse76 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse77 .cse64) (let ((.cse87 (select v_prenex_434 v_idx_999))) (let ((.cse88 (+ .cse87 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse9 .cse10 .cse11 .cse78 (<= 0 (+ .cse87 ULTIMATE.start_main_~j~5 2147483648)) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse20 (<= 0 (+ (* 2 .cse87) 4294967296)) .cse21 (<= ULTIMATE.start_main_~j~5 (+ .cse87 2147483648)) .cse22 .cse23 .cse24 .cse25 .cse26 (<= 0 (+ .cse87 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 (<= ULTIMATE.start_main_~N_COL~5 .cse88) .cse36 (<= 0 (+ .cse87 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 (<= ULTIMATE.start_main_~N_LIN~5 .cse88) .cse46 .cse47 .cse48 .cse49 (<= 0 (+ .cse87 ULTIMATE.start_main_~k~5 2147483648)) (<= ULTIMATE.start_main_~k~5 .cse88) .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64))) (let ((.cse90 (select v_prenex_430 v_idx_999))) (let ((.cse89 (+ .cse90 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 (<= ULTIMATE.start_main_~N_COL~5 .cse89) .cse8 (<= ULTIMATE.start_main_~k~5 .cse89) .cse9 .cse10 .cse11 .cse78 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse70 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 (<= 0 (+ .cse90 ULTIMATE.start_main_~k~5 2147483648)) .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 (<= ULTIMATE.start_main_~N_LIN~5 .cse89) .cse50 (<= 0 (+ (* 2 .cse90) 4294967296)) .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 (<= 0 (+ .cse90 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse57 (<= 0 (+ .cse90 ULTIMATE.start_main_~j~5 2147483648)) .cse58 .cse59 (<= 0 (+ .cse90 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse60 .cse61 .cse62 .cse63 .cse64 (<= ULTIMATE.start_main_~j~5 (+ .cse90 2147483648))))))))) [2019-02-14 16:45:21,362 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse6 (- ULTIMATE.start_main_~N_LIN~5))) (let ((.cse0 (<= (- (- ULTIMATE.start_main_~N_COL~5) .cse6) 0)) (.cse1 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse2 (<= (* 2 ULTIMATE.start_main_~j~5) 0)) (.cse3 (<= 2 (* 2 ULTIMATE.start_main_~N_LIN~5))) (.cse4 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5)) (.cse5 (<= (- .cse6 (- ULTIMATE.start_main_~k~5)) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (+ v_idx_1003 ULTIMATE.start_main_~k~5) 1)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_main_~N_LIN~5 (+ (select (select ULTIMATE.start_main_~matriz~5 v_idx_1003) v_idx_999) 2147483649))) (and .cse0 .cse1 .cse2 .cse3 (<= 2 (+ v_idx_999 ULTIMATE.start_main_~N_LIN~5)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 (+ v_idx_1003 ULTIMATE.start_main_~N_LIN~5))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (+ v_idx_999 ULTIMATE.start_main_~j~5) 0))))) [2019-02-14 16:45:37,990 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 407 treesize of output 389 [2019-02-14 16:45:38,003 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:40,253 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:45:40,257 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:40,400 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:45:40,404 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:40,664 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:45:40,668 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:40,845 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:45:40,846 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 8 variables, input treesize:11072, output treesize:195 [2019-02-14 16:45:41,549 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:45:41,563 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:43,864 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:45:43,868 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:44,280 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:45:44,284 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:44,468 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:45:44,471 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:44,615 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:45:44,619 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:44,914 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:45:44,919 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:45:45,048 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:45:45,049 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:5504, output treesize:195 [2019-02-14 16:46:01,900 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 412 treesize of output 394 [2019-02-14 16:46:01,914 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:04,206 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:46:04,211 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:04,411 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:46:04,463 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:04,650 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:46:04,654 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:04,808 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:46:04,812 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:05,083 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:46:05,087 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:05,286 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:46:05,287 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:12183, output treesize:195 [2019-02-14 16:46:05,310 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:46:05,312 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_prenex_450, v_prenex_452, v_v_316_1, v_prenex_453, v_prenex_455, v_prenex_449, v_prenex_451, v_prenex_454]. (let ((.cse105 (select (select ULTIMATE.start_main_~matriz~5 v_idx_1075) v_idx_1071))) (let ((.cse95 (* 2 ULTIMATE.start_main_~N_LIN~5)) (.cse101 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~j~5)) (.cse104 (* 2 ULTIMATE.start_main_~k~5)) (.cse98 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse103 (+ ULTIMATE.start_main_~k~5 1)) (.cse108 (+ ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~N_COL~5)) (.cse107 (+ ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse96 (* 2 ULTIMATE.start_main_~j~5)) (.cse94 (- ULTIMATE.start_main_~k~5)) (.cse106 (+ ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse100 (- ULTIMATE.start_main_~N_COL~5)) (.cse99 (+ .cse105 2147483649)) (.cse93 (- ULTIMATE.start_main_~N_LIN~5)) (.cse97 (- ULTIMATE.start_main_~j~5)) (.cse102 (+ ULTIMATE.start_main_~j~5 1)) (.cse109 (+ ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~N_LIN~5))) (let ((.cse38 (<= 0 (+ ULTIMATE.start_main_~j~5 v_idx_1070))) (.cse67 (<= 2 (+ v_idx_1075 ULTIMATE.start_main_~N_LIN~5))) (.cse68 (<= 2 (+ ULTIMATE.start_main_~N_LIN~5 v_idx_1071))) (.cse69 (< (+ ULTIMATE.start_main_~j~5 v_idx_1071) 0)) (.cse33 (< (+ ULTIMATE.start_main_~k~5 v_idx_1075) 1)) (.cse0 (<= 1 .cse109)) (.cse1 (<= ULTIMATE.start_main_~k~5 .cse102)) (.cse2 (<= (- ULTIMATE.start_main_~j~5 .cse97) 0)) (.cse3 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_LIN~5)) (.cse4 (<= (- .cse97 ULTIMATE.start_main_~j~5) 0)) (.cse5 (< (+ v_idx_1072 ULTIMATE.start_main_~N_LIN~5) 2)) (.cse7 (<= (- .cse93 .cse97) (- 1))) (.cse8 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5) 0)) (.cse74 (<= ULTIMATE.start_main_~N_LIN~5 .cse99)) (.cse75 (<= 0 (+ (* 2 .cse105) 4294967296))) (.cse10 (<= (- .cse100 ULTIMATE.start_main_~j~5) (- 1))) (.cse11 (<= (- .cse93 ULTIMATE.start_main_~j~5) (- 1))) (.cse76 (<= 0 (+ .cse105 ULTIMATE.start_main_~N_COL~5 2147483647))) (.cse12 (<= (- ULTIMATE.start_main_~N_COL~5 .cse100) 2)) (.cse13 (<= .cse106 2)) (.cse14 (<= (- .cse97 ULTIMATE.start_main_~k~5) 0)) (.cse15 (<= (- ULTIMATE.start_main_~j~5 .cse94) 1)) (.cse77 (<= ULTIMATE.start_main_~N_COL~5 .cse99)) (.cse16 (<= 0 .cse96)) (.cse17 (<= .cse107 2)) (.cse18 (<= (- .cse100 ULTIMATE.start_main_~k~5) (- 1))) (.cse19 (<= .cse108 1)) (.cse20 (<= (- ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5) 0)) (.cse21 (<= ULTIMATE.start_main_~N_COL~5 .cse102)) (.cse22 (<= (- .cse94 ULTIMATE.start_main_~k~5) 0)) (.cse78 (<= 0 (+ .cse105 ULTIMATE.start_main_~j~5 2147483648))) (.cse23 (<= ULTIMATE.start_main_~N_COL~5 .cse103)) (.cse24 (<= .cse102 ULTIMATE.start_main_~N_COL~5)) (.cse25 (<= (- ULTIMATE.start_main_~k~5 .cse94) 2)) (.cse26 (<= (- ULTIMATE.start_main_~N_COL~5 .cse93) 2)) (.cse27 (<= .cse109 1)) (.cse28 (<= 1 .cse98)) (.cse79 (<= ULTIMATE.start_main_~j~5 (+ .cse105 2147483648))) (.cse29 (<= (- .cse93 ULTIMATE.start_main_~k~5) (- 1))) (.cse30 (<= 1 .cse108)) (.cse31 (<= (- .cse100 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse32 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse94) 2)) (.cse34 (<= ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~N_COL~5)) (.cse80 (<= 0 (+ .cse105 ULTIMATE.start_main_~N_LIN~5 2147483647))) (.cse35 (<= .cse104 2)) (.cse36 (<= (- .cse100 .cse94) 0)) (.cse37 (<= ULTIMATE.start_main_~k~5 ULTIMATE.start_main_~N_COL~5)) (.cse39 (<= (- ULTIMATE.start_main_~N_COL~5 .cse97) 1)) (.cse40 (<= 2 .cse107)) (.cse41 (<= 1 .cse106)) (.cse42 (<= ULTIMATE.start_main_~N_LIN~5 .cse102)) (.cse43 (<= (- ULTIMATE.start_main_~N_COL~5 .cse94) 2)) (.cse44 (<= 0 .cse101)) (.cse45 (<= (- .cse100 ULTIMATE.start_main_~N_COL~5) (- 2))) (.cse81 (<= 0 (+ .cse105 ULTIMATE.start_main_~k~5 2147483648))) (.cse46 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse93) 2)) (.cse47 (<= 0 .cse104)) (.cse48 (<= ULTIMATE.start_main_~N_LIN~5 .cse103)) (.cse49 (<= .cse102 ULTIMATE.start_main_~N_LIN~5)) (.cse50 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~k~5) 1)) (.cse51 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~j~5) 1)) (.cse52 (<= .cse101 1)) (.cse53 (<= (- .cse100 .cse97) (- 1))) (.cse54 (<= .cse95 2)) (.cse55 (<= (- ULTIMATE.start_main_~N_LIN~5 .cse97) 1)) (.cse56 (<= (- .cse100 .cse93) 0)) (.cse57 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse58 (<= (- ULTIMATE.start_main_~N_LIN~5 ULTIMATE.start_main_~k~5) 1)) (.cse82 (<= ULTIMATE.start_main_~k~5 .cse99)) (.cse59 (<= .cse98 2)) (.cse60 (<= (- .cse93 ULTIMATE.start_main_~N_LIN~5) (- 2))) (.cse61 (<= (- .cse97 .cse94) 1)) (.cse62 (<= .cse96 0)) (.cse63 (<= 2 .cse95)) (.cse64 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5)) (.cse65 (<= (- .cse93 .cse94) 0)) (.cse66 (<= ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~N_LIN~5))) (or (let ((.cse9 (select v_prenex_450 v_idx_1071))) (let ((.cse6 (+ .cse9 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= ULTIMATE.start_main_~N_COL~5 .cse6) .cse7 .cse8 (<= 0 (+ .cse9 ULTIMATE.start_main_~N_COL~5 2147483647)) (<= ULTIMATE.start_main_~N_LIN~5 .cse6) .cse10 .cse11 .cse12 (<= 0 (+ .cse9 ULTIMATE.start_main_~j~5 2147483648)) .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 (<= ULTIMATE.start_main_~k~5 .cse6) .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 (<= 0 (+ (* 2 .cse9) 4294967296)) .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 (<= 0 (+ .cse9 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse64 .cse65 (<= ULTIMATE.start_main_~j~5 (+ .cse9 2147483648)) .cse66 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse9 2147483648))))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse67 .cse41 .cse68 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse69 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (let ((.cse71 (select v_prenex_452 v_idx_1071))) (let ((.cse70 (+ .cse71 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 (<= ULTIMATE.start_main_~k~5 .cse70) .cse13 .cse14 (<= 0 (+ .cse71 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 (<= ULTIMATE.start_main_~N_LIN~5 .cse70) .cse21 (<= 0 (+ (* 2 .cse71) 4294967296)) .cse22 .cse23 .cse24 .cse25 .cse26 (<= ULTIMATE.start_main_~N_COL~5 .cse70) .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse67 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 (<= 0 (+ .cse71 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 (<= 0 (+ .cse71 ULTIMATE.start_main_~j~5 2147483648)) .cse59 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse71 2147483648)) .cse60 .cse61 .cse62 (<= ULTIMATE.start_main_~j~5 (+ .cse71 2147483648)) .cse63 .cse64 .cse65 .cse66))) (let ((.cse73 (select v_v_316_1 v_idx_1071))) (let ((.cse72 (+ .cse73 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~N_COL~5 .cse72) (<= 0 (+ (* 2 .cse73) 4294967296)) .cse7 .cse8 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse73 2147483648)) .cse10 .cse11 (<= ULTIMATE.start_main_~N_LIN~5 .cse72) .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse33 .cse35 .cse36 .cse37 .cse39 (<= ULTIMATE.start_main_~k~5 .cse72) (<= 0 (+ .cse73 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 (<= ULTIMATE.start_main_~j~5 (+ .cse73 2147483648)) .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 (<= 0 (+ .cse73 ULTIMATE.start_main_~j~5 2147483648)) (<= 0 (+ .cse73 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse69 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse67 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse68 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse67 .cse41 .cse68 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse74 .cse75 .cse10 .cse11 .cse76 .cse12 .cse13 .cse14 .cse15 .cse77 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse78 .cse22 .cse23 .cse24 .cse25 .cse26 .cse79 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse80 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse81 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse82 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse69 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse69 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse67 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (let ((.cse83 (select v_prenex_453 v_idx_1071))) (let ((.cse84 (+ .cse83 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ .cse83 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse16 .cse17 .cse18 .cse19 .cse20 (<= ULTIMATE.start_main_~N_COL~5 .cse84) .cse21 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse83 2147483648)) .cse22 .cse23 .cse24 .cse25 (<= 0 (+ (* 2 .cse83) 4294967296)) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse39 (<= ULTIMATE.start_main_~k~5 .cse84) (<= ULTIMATE.start_main_~j~5 (+ .cse83 2147483648)) .cse40 (<= 0 (+ .cse83 ULTIMATE.start_main_~j~5 2147483648)) .cse41 .cse67 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 (<= 0 (+ .cse83 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse61 .cse62 .cse63 (<= ULTIMATE.start_main_~N_LIN~5 .cse84) .cse64 .cse65 .cse66))) (let ((.cse86 (select v_prenex_455 v_idx_1071))) (let ((.cse85 (+ .cse86 2147483649))) (and .cse0 .cse1 (<= ULTIMATE.start_main_~N_COL~5 .cse85) .cse2 .cse3 .cse4 .cse7 .cse8 (<= 0 (+ .cse86 ULTIMATE.start_main_~N_COL~5 2147483647)) .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse86 2147483648)) .cse16 .cse17 .cse18 .cse19 (<= 0 (+ (* 2 .cse86) 4294967296)) .cse20 .cse21 (<= ULTIMATE.start_main_~k~5 .cse85) .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 (<= 0 (+ .cse86 ULTIMATE.start_main_~j~5 2147483648)) .cse30 .cse31 .cse32 .cse34 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 (<= ULTIMATE.start_main_~j~5 (+ .cse86 2147483648)) .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 (<= 0 (+ .cse86 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse61 (<= ULTIMATE.start_main_~N_LIN~5 .cse85) .cse62 .cse63 .cse64 .cse65 .cse66))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse69 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse68 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (let ((.cse87 (select v_prenex_449 v_idx_1071))) (let ((.cse88 (+ .cse87 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (<= ULTIMATE.start_main_~j~5 (+ .cse87 2147483648)) .cse10 (<= 0 (+ (* 2 .cse87) 4294967296)) .cse11 .cse12 .cse13 .cse14 .cse15 (<= ULTIMATE.start_main_~N_COL~5 .cse88) .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 (<= ULTIMATE.start_main_~k~5 .cse88) .cse29 (<= ULTIMATE.start_main_~N_LIN~5 .cse88) .cse30 .cse31 .cse32 .cse34 .cse35 (<= 0 (+ .cse87 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse36 .cse37 .cse38 .cse39 .cse40 .cse67 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 (<= 0 (+ .cse87 ULTIMATE.start_main_~N_COL~5 2147483647)) (<= 0 (+ .cse87 ULTIMATE.start_main_~j~5 2147483648)) (<= 0 (+ ULTIMATE.start_main_~k~5 .cse87 2147483648)) .cse62 .cse63 .cse64 .cse65 .cse66))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse74 .cse75 .cse10 .cse11 .cse76 .cse12 .cse13 .cse14 .cse15 .cse77 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse78 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse79 .cse29 .cse30 .cse31 .cse32 .cse34 .cse80 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse81 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse82 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse69 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse33 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse42 .cse68 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse41 .cse68 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse69 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse68 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (let ((.cse90 (select v_prenex_451 v_idx_1071))) (let ((.cse89 (+ .cse90 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 (<= ULTIMATE.start_main_~N_LIN~5 .cse89) .cse10 (<= 0 (+ .cse90 ULTIMATE.start_main_~N_COL~5 2147483647)) (<= ULTIMATE.start_main_~N_COL~5 .cse89) .cse11 .cse12 .cse13 .cse14 (<= 0 (+ (* 2 .cse90) 4294967296)) .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse90 2147483648)) .cse22 .cse23 .cse24 .cse25 (<= 0 (+ .cse90 ULTIMATE.start_main_~j~5 2147483648)) .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (<= ULTIMATE.start_main_~k~5 .cse89) .cse35 .cse36 .cse37 .cse39 (<= ULTIMATE.start_main_~j~5 (+ .cse90 2147483648)) .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 (<= 0 (+ .cse90 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse61 .cse62 .cse63 .cse64 .cse65 .cse66))) (let ((.cse92 (select v_prenex_454 v_idx_1071))) (let ((.cse91 (+ .cse92 2147483649))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= ULTIMATE.start_main_~k~5 .cse91) .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 (<= ULTIMATE.start_main_~j~5 (+ .cse92 2147483648)) .cse27 .cse28 (<= 0 (+ ULTIMATE.start_main_~k~5 .cse92 2147483648)) .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 (<= ULTIMATE.start_main_~N_LIN~5 .cse91) .cse39 .cse40 .cse67 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 (<= 0 (+ .cse92 ULTIMATE.start_main_~N_COL~5 2147483647)) (<= 0 (+ .cse92 ULTIMATE.start_main_~j~5 2147483648)) .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 (<= ULTIMATE.start_main_~N_COL~5 .cse91) .cse59 .cse60 .cse61 (<= 0 (+ (* 2 .cse92) 4294967296)) .cse62 .cse63 .cse64 .cse65 (<= 0 (+ .cse92 ULTIMATE.start_main_~N_LIN~5 2147483647)) .cse66))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse69 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse67 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse69 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse69 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse67 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse67 .cse41 .cse68 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse33 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse68 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse35 .cse36 .cse37 .cse38 .cse39 .cse40 .cse67 .cse41 .cse68 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse68 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse7 .cse8 .cse10 .cse11 .cse12 .cse13 .cse14 .cse15 .cse16 .cse17 .cse18 .cse19 .cse20 .cse69 .cse21 .cse22 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse34 .cse33 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse7 .cse8 .cse74 .cse75 .cse10 .cse11 .cse76 .cse12 .cse13 .cse14 .cse15 .cse77 .cse16 .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse78 .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse79 .cse29 .cse30 .cse31 .cse32 .cse34 .cse80 .cse35 .cse36 .cse37 .cse39 .cse40 .cse41 .cse42 .cse43 .cse44 .cse45 .cse81 .cse46 .cse47 .cse48 .cse49 .cse50 .cse51 .cse52 .cse53 .cse54 .cse55 .cse56 .cse57 .cse58 .cse82 .cse59 .cse60 .cse61 .cse62 .cse63 .cse64 .cse65 .cse66))))) [2019-02-14 16:46:05,312 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ []. (let ((.cse6 (- ULTIMATE.start_main_~N_LIN~5))) (let ((.cse0 (<= (- (- ULTIMATE.start_main_~N_COL~5) .cse6) 0)) (.cse1 (<= (- ULTIMATE.start_main_~N_COL~5 ULTIMATE.start_main_~j~5) 1)) (.cse2 (<= (* 2 ULTIMATE.start_main_~j~5) 0)) (.cse3 (<= 2 (* 2 ULTIMATE.start_main_~N_LIN~5))) (.cse4 (<= ULTIMATE.start_main_~j~5 ULTIMATE.start_main_~k~5)) (.cse5 (<= (- .cse6 (- ULTIMATE.start_main_~k~5)) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 (+ v_idx_1075 ULTIMATE.start_main_~N_LIN~5))) (and .cse0 .cse1 .cse2 .cse3 (<= ULTIMATE.start_main_~k~5 (+ (select (select ULTIMATE.start_main_~matriz~5 v_idx_1075) v_idx_1071) 2147483649)) .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (<= 2 (+ ULTIMATE.start_main_~N_LIN~5 v_idx_1071))) (and .cse0 .cse1 .cse2 .cse3 .cse4 (< (+ ULTIMATE.start_main_~j~5 v_idx_1071) 0) .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (< (+ ULTIMATE.start_main_~k~5 v_idx_1075) 1))))) [2019-02-14 16:46:06,244 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 420 treesize of output 394 [2019-02-14 16:46:06,260 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:08,441 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-14 16:46:08,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:08,662 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:46:08,666 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:08,859 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:46:08,863 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:09,046 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:46:09,050 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:09,193 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 43 [2019-02-14 16:46:09,197 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:09,458 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:46:09,459 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 8 variables, input treesize:10025, output treesize:195 [2019-02-14 16:46:26,009 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:46:26,027 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:28,340 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 53 [2019-02-14 16:46:28,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:28,590 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:46:28,595 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:28,822 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:46:28,826 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:29,008 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:46:29,011 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:29,366 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:46:29,367 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:6359, output treesize:196 [2019-02-14 16:46:30,130 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 399 [2019-02-14 16:46:30,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:32,543 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 49 [2019-02-14 16:46:32,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:32,760 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2019-02-14 16:46:32,764 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:32,913 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2019-02-14 16:46:32,917 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:33,174 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2019-02-14 16:46:33,178 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:33,441 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-1 vars, End of recursive call: and 5 xjuncts. [2019-02-14 16:46:33,441 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 8 variables, input treesize:7741, output treesize:195 [2019-02-14 16:46:33,520 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-14 16:46:33,522 INFO L272 AbstractInterpreter]: Visited 6 different actions 121 times. Merged at 5 different actions 83 times. Widened at 4 different actions 57 times. Found 34 fixpoints after 3 different actions. Largest state had 0 variables. [2019-02-14 16:46:33,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-02-14 16:46:33,527 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-02-14 16:46:33,527 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-02-14 16:46:33,528 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-02-14 16:46:33,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-02-14 16:46:33,539 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-02-14 16:46:33,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:46:33,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-02-14 16:46:33,561 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-02-14 16:46:33,676 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 10 [2019-02-14 16:46:33,684 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 10 treesize of output 9 [2019-02-14 16:46:33,685 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:33,687 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:46:33,697 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-02-14 16:46:33,697 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:35, output treesize:20 [2019-02-14 16:46:33,703 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:46:33,703 WARN L398 uantifierElimination]: Input elimination task: ∃ [v_ULTIMATE.start_main_~matriz~5_7, ULTIMATE.start_main_~j~5, |v_ULTIMATE.start_main_#t~nondet3_4|]. (let ((.cse0 (mod ULTIMATE.start_main_~j~5 4294967296))) (and (<= (select (select ULTIMATE.start_main_~matriz~5 .cse0) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (= (store v_ULTIMATE.start_main_~matriz~5_7 .cse0 (store (select v_ULTIMATE.start_main_~matriz~5_7 .cse0) 0 |v_ULTIMATE.start_main_#t~nondet3_4|)) ULTIMATE.start_main_~matriz~5) (<= ULTIMATE.start_main_~j~5 0))) [2019-02-14 16:46:33,703 WARN L399 uantifierElimination]: ElimStorePlain result: ∃ [ULTIMATE.start_main_~j~5]. (and (<= (select (select ULTIMATE.start_main_~matriz~5 (mod ULTIMATE.start_main_~j~5 4294967296)) 0) ULTIMATE.start_main_~maior~5) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0)) [2019-02-14 16:46:33,756 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} is VALID [2019-02-14 16:46:33,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#(and (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {121#(and (= ULTIMATE.start_main_~k~5 0) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} is VALID [2019-02-14 16:46:33,775 INFO L273 TraceCheckUtils]: 2: Hoare triple {121#(and (= ULTIMATE.start_main_~k~5 0) (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1)) (<= ULTIMATE.start_main_~j~5 0))} assume !!(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~matriz~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296 := main_#t~nondet3];havoc main_#t~nondet3;assume main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296] >= main_~maior~5;main_~maior~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296];main_#t~post2 := main_~k~5;main_~k~5 := main_#t~post2 + 1;havoc main_#t~post2; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-02-14 16:46:33,775 INFO L273 TraceCheckUtils]: 3: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-02-14 16:46:33,776 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {110#false} is VALID [2019-02-14 16:46:33,776 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#false} assume !false; {110#false} is VALID [2019-02-14 16:46:33,777 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:46:33,777 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2019-02-14 16:46:33,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 treesize of output 7 [2019-02-14 16:46:33,842 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2019-02-14 16:46:33,849 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-02-14 16:46:33,850 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-02-14 16:46:33,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-02-14 16:46:33,856 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:23, output treesize:11 [2019-02-14 16:46:33,860 WARN L397 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2019-02-14 16:46:33,860 WARN L398 uantifierElimination]: Input elimination task: ∀ [ULTIMATE.start_main_~matriz~5, |ULTIMATE.start_main_#t~nondet3|]. (< (select (select (let ((.cse0 (mod ULTIMATE.start_main_~j~5 4294967296))) (store ULTIMATE.start_main_~matriz~5 .cse0 (store (select ULTIMATE.start_main_~matriz~5 .cse0) (mod ULTIMATE.start_main_~k~5 4294967296) |ULTIMATE.start_main_#t~nondet3|))) 0) 0) (+ |ULTIMATE.start_main_#t~nondet3| 1)) [2019-02-14 16:46:33,861 WARN L399 uantifierElimination]: ElimStorePlain result: ∀ []. (and (= 0 (mod ULTIMATE.start_main_~k~5 4294967296)) (= 0 (mod ULTIMATE.start_main_~j~5 4294967296))) [2019-02-14 16:46:33,886 INFO L273 TraceCheckUtils]: 5: Hoare triple {110#false} assume !false; {110#false} is VALID [2019-02-14 16:46:33,888 INFO L273 TraceCheckUtils]: 4: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);__VERIFIER_assert_#in~cond := (if main_~matriz~5[0,0] <= main_~maior~5 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond;assume __VERIFIER_assert_~cond == 0;assume !false; {110#false} is VALID [2019-02-14 16:46:33,889 INFO L273 TraceCheckUtils]: 3: Hoare triple {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} assume !(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);main_#t~post1 := main_~j~5;main_~j~5 := main_#t~post1 + 1;havoc main_#t~post1; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-02-14 16:46:33,891 INFO L273 TraceCheckUtils]: 2: Hoare triple {143#(and (= 0 (mod ULTIMATE.start_main_~k~5 4294967296)) (= 0 (mod ULTIMATE.start_main_~j~5 4294967296)))} assume !!(main_~k~5 % 4294967296 < main_~N_LIN~5 % 4294967296);assume -2147483648 <= main_#t~nondet3 && main_#t~nondet3 <= 2147483647;main_~matriz~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296 := main_#t~nondet3];havoc main_#t~nondet3;assume main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296] >= main_~maior~5;main_~maior~5 := main_~matriz~5[main_~j~5 % 4294967296,main_~k~5 % 4294967296];main_#t~post2 := main_~k~5;main_~k~5 := main_#t~post2 + 1;havoc main_#t~post2; {114#(<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5)} is VALID [2019-02-14 16:46:33,892 INFO L273 TraceCheckUtils]: 1: Hoare triple {147#(= 0 (mod ULTIMATE.start_main_~j~5 4294967296))} assume !!(main_~j~5 % 4294967296 < main_~N_COL~5 % 4294967296);main_~k~5 := 0; {143#(and (= 0 (mod ULTIMATE.start_main_~k~5 4294967296)) (= 0 (mod ULTIMATE.start_main_~j~5 4294967296)))} is VALID [2019-02-14 16:46:33,892 INFO L273 TraceCheckUtils]: 0: Hoare triple {109#true} havoc main_#res;havoc main_#t~nondet0, main_#t~nondet3, main_#t~post2, main_#t~post1, main_~N_LIN~5, main_~N_COL~5, main_~j~5, main_~k~5, main_~matriz~5, main_~maior~5;main_~N_LIN~5 := 1;main_~N_COL~5 := 1;havoc main_~j~5;havoc main_~k~5;havoc main_~matriz~5;havoc main_~maior~5;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~maior~5 := main_#t~nondet0;havoc main_#t~nondet0;main_~j~5 := 0; {147#(= 0 (mod ULTIMATE.start_main_~j~5 4294967296))} is VALID [2019-02-14 16:46:33,893 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:46:33,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-02-14 16:46:33,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2019-02-14 16:46:33,914 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-02-14 16:46:33,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-14 16:46:33,915 INFO L84 Accepts]: Finished accepts. word is accepted. [2019-02-14 16:46:33,915 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2019-02-14 16:46:33,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2019-02-14 16:46:33,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-02-14 16:46:33,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-02-14 16:46:33,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-02-14 16:46:33,930 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 7 states. [2019-02-14 16:46:34,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:46:34,069 INFO L93 Difference]: Finished difference Result 9 states and 11 transitions. [2019-02-14 16:46:34,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-02-14 16:46:34,069 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 6 [2019-02-14 16:46:34,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-02-14 16:46:34,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:46:34,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-02-14 16:46:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-02-14 16:46:34,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 10 transitions. [2019-02-14 16:46:34,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 10 transitions. [2019-02-14 16:46:34,086 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-14 16:46:34,087 INFO L225 Difference]: With dead ends: 9 [2019-02-14 16:46:34,087 INFO L226 Difference]: Without dead ends: 0 [2019-02-14 16:46:34,088 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-02-14 16:46:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-02-14 16:46:34,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-02-14 16:46:34,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2019-02-14 16:46:34,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2019-02-14 16:46:34,089 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-14 16:46:34,089 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-14 16:46:34,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:46:34,089 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-14 16:46:34,089 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:46:34,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:46:34,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:46:34,090 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2019-02-14 16:46:34,090 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2019-02-14 16:46:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-02-14 16:46:34,090 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2019-02-14 16:46:34,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:46:34,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:46:34,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2019-02-14 16:46:34,090 INFO L88 GeneralOperation]: Finished isEquivalent. [2019-02-14 16:46:34,090 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2019-02-14 16:46:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-02-14 16:46:34,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-02-14 16:46:34,091 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 6 [2019-02-14 16:46:34,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-02-14 16:46:34,091 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-02-14 16:46:34,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-02-14 16:46:34,091 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-02-14 16:46:34,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-02-14 16:46:34,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-02-14 16:46:34,408 WARN L181 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2019-02-14 16:46:34,416 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 71) no Hoare annotation was computed. [2019-02-14 16:46:34,416 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONASSERT(line 48) no Hoare annotation was computed. [2019-02-14 16:46:34,416 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(lines 1 71) no Hoare annotation was computed. [2019-02-14 16:46:34,416 INFO L444 ceAbstractionStarter]: At program point L59(lines 29 59) the Hoare annotation is: (let ((.cse3 (div ULTIMATE.start_main_~j~5 4294967296))) (let ((.cse0 (< 0 (+ .cse3 1))) (.cse1 (<= (div ULTIMATE.start_main_~N_LIN~5 4294967296) 0)) (.cse2 (<= 1 ULTIMATE.start_main_~N_LIN~5))) (or (and (<= (+ ULTIMATE.start_main_~j~5 1) ULTIMATE.start_main_~N_COL~5) .cse0 .cse1 .cse2 (<= ULTIMATE.start_main_~j~5 0) (<= (div ULTIMATE.start_main_~N_COL~5 4294967296) .cse3)) (and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) .cse0 .cse1 .cse2)))) [2019-02-14 16:46:34,417 INFO L444 ceAbstractionStarter]: At program point L42(lines 42 47) the Hoare annotation is: false [2019-02-14 16:46:34,417 INFO L444 ceAbstractionStarter]: At program point L70(lines 46 70) the Hoare annotation is: (let ((.cse0 (< 0 (+ (div ULTIMATE.start_main_~j~5 4294967296) 1))) (.cse2 (div ULTIMATE.start_main_~N_LIN~5 4294967296)) (.cse1 (<= 1 ULTIMATE.start_main_~N_LIN~5))) (or (and (= ULTIMATE.start_main_~k~5 0) .cse0 .cse1 (<= ULTIMATE.start_main_~j~5 0) (<= .cse2 (div ULTIMATE.start_main_~k~5 4294967296))) (and (<= (select (select ULTIMATE.start_main_~matriz~5 0) 0) ULTIMATE.start_main_~maior~5) .cse0 (<= .cse2 0) .cse1))) [2019-02-14 16:46:34,418 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2019-02-14 16:46:34,420 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONASSERT has no Hoare annotation [2019-02-14 16:46:34,425 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2019-02-14 16:46:34,431 INFO L202 PluginConnector]: Adding new model matrix.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.02 04:46:34 BoogieIcfgContainer [2019-02-14 16:46:34,432 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-02-14 16:46:34,433 INFO L168 Benchmark]: Toolchain (without parser) took 555124.25 ms. Allocated memory was 140.5 MB in the beginning and 263.2 MB in the end (delta: 122.7 MB). Free memory was 105.4 MB in the beginning and 107.1 MB in the end (delta: -1.7 MB). Peak memory consumption was 121.0 MB. Max. memory is 7.1 GB. [2019-02-14 16:46:34,434 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 106.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-14 16:46:34,434 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.16 ms. Allocated memory is still 140.5 MB. Free memory was 105.4 MB in the beginning and 103.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-02-14 16:46:34,434 INFO L168 Benchmark]: Boogie Preprocessor took 25.72 ms. Allocated memory is still 140.5 MB. Free memory was 103.6 MB in the beginning and 102.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-02-14 16:46:34,435 INFO L168 Benchmark]: RCFGBuilder took 628.32 ms. Allocated memory is still 140.5 MB. Free memory was 102.5 MB in the beginning and 89.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-02-14 16:46:34,435 INFO L168 Benchmark]: TraceAbstraction took 554420.84 ms. Allocated memory was 140.5 MB in the beginning and 263.2 MB in the end (delta: 122.7 MB). Free memory was 89.6 MB in the beginning and 107.1 MB in the end (delta: -17.6 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. [2019-02-14 16:46:34,437 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 140.5 MB. Free memory is still 106.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 43.16 ms. Allocated memory is still 140.5 MB. Free memory was 105.4 MB in the beginning and 103.6 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.72 ms. Allocated memory is still 140.5 MB. Free memory was 103.6 MB in the beginning and 102.5 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 628.32 ms. Allocated memory is still 140.5 MB. Free memory was 102.5 MB in the beginning and 89.8 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 554420.84 ms. Allocated memory was 140.5 MB in the beginning and 263.2 MB in the end (delta: 122.7 MB). Free memory was 89.6 MB in the beginning and 107.1 MB in the end (delta: -17.6 MB). Peak memory consumption was 105.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: false - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: (((((main_~j~5 + 1 <= main_~N_COL~5 && 0 < main_~j~5 / 4294967296 + 1) && main_~N_LIN~5 / 4294967296 <= 0) && 1 <= main_~N_LIN~5) && main_~j~5 <= 0) && main_~N_COL~5 / 4294967296 <= main_~j~5 / 4294967296) || (((main_~matriz~5[0][0] <= main_~maior~5 && 0 < main_~j~5 / 4294967296 + 1) && main_~N_LIN~5 / 4294967296 <= 0) && 1 <= main_~N_LIN~5) - InvariantResult [Line: 46]: Loop Invariant Derived loop invariant: ((((main_~k~5 == 0 && 0 < main_~j~5 / 4294967296 + 1) && 1 <= main_~N_LIN~5) && main_~j~5 <= 0) && main_~N_LIN~5 / 4294967296 <= main_~k~5 / 4294967296) || (((main_~matriz~5[0][0] <= main_~maior~5 && 0 < main_~j~5 / 4294967296 + 1) && main_~N_LIN~5 / 4294967296 <= 0) && 1 <= main_~N_LIN~5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 6 locations, 1 error locations. SAFE Result, 554.3s OverallTime, 3 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 8 SDtfs, 9 SDslu, 3 SDs, 0 SdLazy, 29 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 550.6s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 9 NumberOfFragments, 104 HoareAnnotationTreeSize, 3 FomulaSimplifications, 61 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 20 NumberOfCodeBlocks, 20 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 799 SizeOfPredicates, 7 NumberOfNonLiveVariables, 35 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 5 InterpolantComputations, 2 PerfectInterpolantSequences, 1/7 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...